Data

Tools

Indexes

Applications

Experiments

Awesome

An open API service indexing awesome lists of open source software.

https://github.com/microsoft/zen

Zen is a constraint solving library for .NET
https://github.com/microsoft/zen

constraint solving verification zen

Last synced: about 2 months ago
JSON representation

Zen is a constraint solving library for .NET

Awesome Lists containing this project

README 

        
[![License: MIT](https://img.shields.io/badge/License-MIT-blue.svg)](https://opensource.org/licenses/MIT)

![Build Status](https://github.com/microsoft/Zen/actions/workflows/dotnet.yml/badge.svg)

![badge](https://img.shields.io/endpoint?url=https://gist.githubusercontent.com/rabeckett/6623db8f2d0c01f6b2bc880e6219f97f/raw/code-coverage.json)



# Introduction

Zen is a constraint solving library for .NET. Zen makes it easy to express high-level symbolic computations directly in .NET. It translates these symbolic expressions to low-level constraint solvers and then back to .NET objects. The Zen library comes equipped with a number of built-in tools for processing symbolic models, including a compiler (to .NET IL), an exhaustive model checker, and a test input generator. It supports multiple backends including one based on the Z3 SMT solver and another based on Binary Decision Diagrams (BDDs).



# Table of contents

- [Introduction](#introduction)

- [Table of contents](#table-of-contents)

- [Installation](#installation)

- [Overview of Zen](#overview-of-zen)

  - [Zen Expressions](#zen-expressions)

  - [Executing a function](#executing-a-function)

  - [Searching for inputs](#searching-for-inputs)

  - [Computing with sets](#computing-with-sets)

  - [Generating test inputs](#generating-test-inputs)

  - [Optimization](#optimization)

- [Supported data types](#supported-data-types)

  - [Primitive types](#primitive-types)

  - [Integer types](#integer-types)

  - [Options, Tuples](#options-tuples)

  - [Real Values](#real-values)

  - [Finite Sequences, Bags, Maps](#finite-sequences-bags-maps)

  - [Unbounded Sets and Maps](#unbounded-sets-and-maps)

  - [Constant Sets and Maps](#constant-sets-and-maps)

  - [Fixed Length Arrays](#fixed-length-arrays)

  - [Sequences, Strings, and Regular Expressions](#sequences-strings-and-regular-expressions)

  - [Custom classes and structs](#custom-classes-and-structs)

  - [Enumerated values](#enumerated-values)

- [Zen Attributes](#zen-attributes)

- [Solver Backends](#solver-backends)

- [Solver Timeouts](#solver-timeouts)

- [Example: Network ACLs](#example-network-acls)

- [Implementation Details](#implementation-details)

- [Contributing](#contributing)





# Installation

Just add the project to your visual studio solution. Alternatively, a nuget package is available [here](https://www.nuget.org/packages/ZenLib).





# Overview of Zen



To import the Zen library, add the following line to your source file:



```csharp

using ZenLib;

```



Most library methods are found in the `Zen.*` namespace. To avoid having to write this prefix out every time, you can alternatively add the following using statement:



```csharp

using static ZenLib.Zen;

```



The Zen library provides the type `Zen`, which represents a symbolic value of type `T`. The library can then solve constraints involving symbolic values. The following code shows a basic use of Zen -- it creates several symbolic variables of different types (e.g., `bool`, `int`, `string`, `FSeq` - finite sequences) and then encodes constraints over those variables.



```csharp

// create symbolic variables of different types

var b = Zen.Symbolic();

var i = Zen.Symbolic();

var s = Zen.Symbolic();

var o = Zen.Symbolic>();

var l = Zen.Symbolic>(depth: 10);



// build constraints on these variables

var c1 = Zen.Or(b, i <= 10);

var c2 = Zen.Or(Zen.Not(b), o == Option.Some(1UL));

var c3 = Zen.Or(s.Contains("hello"), o.IsNone());

var c4 = Zen.And(

        l.Where(x => x == i).Length() == (BigInteger)5,

        Zen.Not(l.All(x => x == i)));

var c5 = l.All(x => Zen.And(x >= 0, x <= 100));



// solve the constraints to get a solution

var solution = Zen.And(c1, c2, c3, c4, c5).Solve();



System.Console.WriteLine("b: " + solution.Get(b));

System.Console.WriteLine("i: " + solution.Get(i));

System.Console.WriteLine("s: " + solution.Get(s));

System.Console.WriteLine("o: " + solution.Get(o));

System.Console.WriteLine("l: " + string.Join(",", solution.Get(l)));

```



An example output is the following values:



```csharp

b: True

i: 38

s: hello

o: Some(1)

l: [10,38,38,38,38,38]

```





## Zen Expressions



`Zen` objects are just normal .NET objects, we can pass them and return them from functions. For instance, the following code computes a new symbolic integer from two integer inputs `x` and `y`:



```csharp

Zen MultiplyAndAdd(Zen x, Zen y)

{

    return 3 * x + y;

}

```



Zen overloads common C# operators such as `&,|,^,<=, <, >, >=, +, -, *, true, false` to work with Zen values and supports implicit conversions to lift C# values (of type `T`) to Zen values (of type `Zen`). Zen can represent a "function" like the one above to perform various symbolic tasks by creating a `ZenFunction` to wrap the `MultiplyAndAdd` function:



```csharp

var function = new ZenFunction(MultiplyAndAdd);

```





## Executing a function



Zen can execute the function we have built on inputs by calling the `Evaluate` method on the `ZenFunction`:



```csharp

var output = function.Evaluate(3, 2); // output = 11

```



This will interpret the expression tree created by the Zen function at runtime and return back a C# `int` value in this case. Of course interpreting a tree is quite slow compared to multiplying a few numbers, so if you need to execute a function many times, Zen can compile the model using the C# `System.Reflection.Emit` API. This generates IL instructions that execute efficiently - as if the function had been written using actual `int` values. Doing so is easy, just call the `Compile` method on the function first:



```csharp

function.Compile();

output = function.Evaluate(3, 2); // output = 11

```



Or alternatively:



```csharp

Func f = Zen.Compile(MultiplyAndAdd);

var output = f(3, 2); // output = 11

```



We can see the difference by comparing the performance between the two:



```csharp

var watch = System.Diagnostics.Stopwatch.StartNew();



for (int i = 0; i < 1000000; i++)

    function.Evaluate(3, 2);



Console.WriteLine($"interpreted function time: {watch.ElapsedMilliseconds}ms");

watch.Restart();



function.Compile();



Console.WriteLine($"compilation time: {watch.ElapsedMilliseconds}ms");

watch.Restart();



for (int i = 0; i < 1000000; i++)

    function.Evaluate(3, 2);



Console.WriteLine($"compiled function time: {watch.ElapsedMilliseconds}ms");

```



```text

interpreted function time: 4601ms

compilation time: 4ms

compiled function time: 2ms

```





## Searching for inputs



Zen can find function inputs that lead to some (un)desirable outcome. For example, we can find an `(x, y)` input pair such that `x` is less than zero and the output of the function is `11`:



```csharp

var input = function.Find((x, y, result) => Zen.And(x <= 0, result == 11)); 

// input.Value = (-1883171776, 1354548043)

```



The type of the result in this case is `Option<(int, int)>`, which will have a pair of integer inputs that make the output 11 if such a pair exists. In this case the library will find `x = -1883171776` and `y = 1354548043`



To find multiple inputs, Zen supports an equivalent `FindAll` method, which returns an `IEnumerable` of inputs where each input in `inputs` will be unique so there are no duplicates.



```csharp

using System.Linq;

...

var inputs = function.FindAll((x, y, result) => Zen.And(x <= 0, result == 11)).Take(5);

```





## Computing with sets



While the `Find` function provides a way to find a single input to a function, Zen also provides an additional API for reasoning about sets of inputs and outputs to functions. It does this through a `StateSetTransformer` API. A transformer is created by calling the `Transformer()` method on a `ZenFunction` (or by calling `Zen.Transformer(...)`):



```csharp

var f = new ZenFunction(i => i + 1);

StateSetTransformer t = f.Transformer();

```



Transformers allow for manipulating (potentially huge) sets of objects efficient. For example, we can get the set of all input `uint` values where adding one will result in an output `y` that is no more than 10 thousand:



```csharp

StateSet inputSet = t.InputSet((x, y) => y <= 10000);

```



This set will include all the values `0 - 9999` as well as `uint.MaxValue` due to wrapping. Transformers can also manpulate sets by propagating them forward or backwards: 



```csharp

StateSet outputSet = t.TransformForward(inputSet);

```



Finally, `StateSet` objects can also be intersected, unioned, and negated. We can pull an example element out of a set as follows (if one exists):



```csharp

Option example = inputSet.Element(); // example.Value = 0

```



Internally, transformers leverage [binary decision diagrams](https://github.com/microsoft/DecisionDiagrams) to represent, possibly very large, sets of objects efficiently.





## Generating test inputs



Zen can automatically generate test inputs for a given model by finding inputs that will lead to different execution paths. For instance, consider an insertion sort implementation. We can ask Zen to generate test inputs for the function that can then be used, for instance to test other sorting algorithms:



```csharp

var f = new ZenFunction, int>(pair => Zen.If(pair.Item1() < pair.Item2(), 1, 2));



foreach (var input in f.GenerateInputs())

{

    Console.WriteLine($"input: {input}");

}

```



In this case, we get the following output:



```text

input: (0, 0)

input: (0, 1)

```



The test generation approach uses [symbolic execution](https://en.wikipedia.org/wiki/Symbolic_execution) to enumerate program paths and solve constraints on inputs that lead down each path. Each `Zen.If` expression is treated as a program branch point (note: you can set the setting `Settings.PreserveBranches = true` to prevent Zen from simplifying formulas involving `If` by default if you want to preserve the expression structure.).





## Optimization



Zen supports optimization of objective functions subject to constraints. The API is similar to that for `Solve`, but requires a maximization or minimization objective. The solver will find the maximal satisfying assignment to the variables.



```csharp

var a = Zen.Symbolic();

var b = Zen.Symbolic();

var constraints = Zen.And(a <= (Real)10, b <= (Real)10, a + (Real)4 <= b);

var solution = Zen.Maximize(objective: a + b, subjectTo: constraints); // a = 6, b = 10

```





# Supported data types



Zen currently supports a subset of .NET types and also introduces some of its own data types summarized below.



| .NET Type   | Description          | Supported by Z3 backend | Supported by BDD backend | Supported by `StateSetTransformers`

| ------ | -------------------- | ----------------------- | ------------------------ | ------------|

| `bool`   | {true, false}        | :heavy_check_mark:      | :heavy_check_mark:       | :heavy_check_mark: |

| `byte`   | 8-bit value          | :heavy_check_mark:      | :heavy_check_mark:       | :heavy_check_mark: |

| `char`   | 16-bit UTF-16 character   | :heavy_check_mark:      | :heavy_check_mark:       | :heavy_check_mark: |

| `short`  | 16-bit signed value  | :heavy_check_mark:      | :heavy_check_mark:       | :heavy_check_mark: |

| `ushort` | 16-bit unsigned value| :heavy_check_mark:      | :heavy_check_mark:       | :heavy_check_mark: |

| `int`    | 32-bit signed value  | :heavy_check_mark:      | :heavy_check_mark:       | :heavy_check_mark: |

| `uint`   | 32-bit unsigned value| :heavy_check_mark:      | :heavy_check_mark:       | :heavy_check_mark: |

| `long`   | 64-bit signed value  | :heavy_check_mark:      | :heavy_check_mark:       | :heavy_check_mark: |

| `ulong`  | 64-bit unsigned value| :heavy_check_mark:      | :heavy_check_mark:       | :heavy_check_mark: |

| `Int<_N>` | N-bit signed value| :heavy_check_mark:      | :heavy_check_mark:  | :heavy_check_mark: |

| `UInt<_N>` | N-bit unsigned value| :heavy_check_mark: | :heavy_check_mark:  | :heavy_check_mark: |

| `Option`    | an optional/nullable value of type `T` | :heavy_check_mark: | :heavy_check_mark: | :heavy_check_mark:  |

| `Pair`  | pairs of different values | :heavy_check_mark: | :heavy_check_mark: | :heavy_check_mark:  |

| `class`, `struct` | classes and structs with public fields and/or properties | :heavy_check_mark: | :heavy_check_mark:  | :heavy_check_mark:  |

| `FSeq`       | finite length sequence of elements of type `T` | :heavy_check_mark: | :heavy_minus_sign: | :heavy_minus_sign:  |

| `FSet`       | finite size set of elements of type `T` | :heavy_check_mark: | :heavy_minus_sign: | :heavy_minus_sign:  |

| `FString` | finite length string | :heavy_check_mark: | :heavy_minus_sign:  | :heavy_minus_sign:  |

| `BigInteger` | arbitrary length integer| :heavy_check_mark:           | :heavy_minus_sign:                 | :heavy_minus_sign:  |

| `Real` | arbitrary precision rational number | :heavy_check_mark:           | :heavy_minus_sign:                 | :heavy_minus_sign:  |

| `Map` | arbitrary size maps of keys and values of type `T1` and `T2`. Note that `T1` and `T2` can not use finite sequences | :heavy_check_mark: | :heavy_minus_sign: | :heavy_minus_sign:  |

| `Set` | arbitrary size sets of values of type `T`. Same restrictions as with `Map` | :heavy_check_mark: | :heavy_minus_sign: | :heavy_minus_sign:  |

| `CMap` | maps of constant keys of type `T1` to values of type `T2`. | :heavy_check_mark: | :heavy_minus_sign: | :heavy_minus_sign:  |

| `CSet` | sets of constants of type `T`. | :heavy_check_mark: | :heavy_minus_sign: | :heavy_minus_sign:  |

| `Array` | Fixed size arrays of values of type `T`. | :heavy_check_mark: | :heavy_minus_sign: | :heavy_minus_sign:  |

| `Seq` | arbitrary size sequences of values of type `T`. Same restrictions as with `Set`. Note that SMT solvers use heuristics to solve for sequences and are incomplete. | :heavy_check_mark: | :heavy_minus_sign: | :heavy_minus_sign:  |

| `string` | arbitrary size strings. Implemented as `Seq` | :heavy_check_mark: | :heavy_minus_sign: | :heavy_minus_sign:  |





## Primitive types



Zen supports the primitive types `bool, byte, char, short, ushort, int, uint, long, ulong`. All primitive types support (in)equality and integer types support integer arithmetic operations. As an example:



```csharp

var x = Symbolic();

var y = Symbolic();

var c1 = (~x & y) == 1;

var c2 = And(x + y > 0, x + y < 100);

var solution = And(c1, c2).Solve(); // x = -20, y = 105

```





## Integer types



Aside from primitive types, Zen also supports the `BigInteger` type found in `System.Numerics` for reasoning about ubounded integers as well as other types of integers with fixed, but non-standard bit width (for instance a 7-bit integer). Out of the box, Zen provides the types `Int<_N>` and `UInt<_N>` for `N`=1, 2, 3, ..., 99, 100, 128, 256, 512 ,1024. You can also create a custom integer size by simply declaring a new struct:



```csharp

public struct _101 { }

```





## Options, Tuples



Zen offers `Pair`, types as a lightweight alternative to classes. By default all values are assumed to be non-null by Zen. For nullable values, it provides an `Option` type.



```csharp

var b = Symbolic>();

var p = Symbolic>>();

var solution = And(b.IsNone(), p.Item1() == 3).Solve(); // b = None, p = (3, 0)

```





## Real Values



Zen supports arbitrary precision rational numbers through the `Real` type.



```csharp

var c = new Real(3, 2); // the fraction 3/2 or equivalently 1.5 

var x = Symbolic();

var y = Symbolic();

var solution = (2 * x + 3 * y == c).Solve(); // x = 1/2, y = 1/6

```





## Finite Sequences, Bags, Maps



Zen supports several high-level data types that are finite (bounded) in size (the default size is 5 but can be changed). These include:



- `FSeq` for reasoning about variable length sequences of values where the order is important.

- `FSet` represents finite sets.



One can implement complex functionality over `FSeq` types by combining the elements of the sequence. For instance, we can sum the elements of a sequence:



```csharp

public Zen Sum(Zen> seq)

{

    return seq.Fold(Zen.Constant(0), (x, y) => x + y);

}

```





## Unbounded Sets and Maps



Zen supports `Set` and `Map` data types that do not restrict the size of the set/map. This type only works with the Z3 backend and requires that `T`, `T1` and `T2` not contain any finitized types (`FSeq`, `FString`, or `FSet`). Primitive types (bool, integers, string, BigInteger), classes/structs are allowed.



```csharp

var s  = Symbolic();

var s1 = Symbolic>();

var s2 = Symbolic>();

var s3 = Symbolic>();

var s4 = Symbolic>();



var c1 = s1.Contains("a");

var c2 = s1.Intersect(s2).Contains("b");

var c3 = Implies(s == "c", s3.Add(s) == s2);

var c4 = s4 == s1.Union(s2);

var solution = And(c1, c2, c3, c4).Solve(); // s = "a", s1 = {b, a}, s2 = {b}, s3 = {}, s4 = {b, a}

```





## Constant Sets and Maps



Arbitrary sets and maps described above are compiled to the SMT solver theory of Arrays. While this theory is quite general, it has known performance limitations. As a lightweight alternative, Zen provides the `CMap` and `CSet` classes that offer similar APIs but with the restriction that any map keys or set elements must be C# constant values and not Zen expressions. Zen will compile these sets and maps by creating fresh variables for all possible constants used by the user for these types.



Constant maps are useful for managing a finite number of unknown variables that should be indexed to some data (e.g., a symbolic boolean variable for every edge in a C# graph), and may have better performance in many cases.



`CMap` represents a total map from keys of type `T1` to values of type `T2`. When a key is not explicitly added to the map, the resulting value will be the Zen default value for the type `T2` (e.g., `0` for integers, `false` for booleans). `CSet` is simply implemented as a `CMap` that says for each key, if the element is in the set. Any example use is shown below:



```csharp

var x = Symbolic();

var m1 = Symbolic>();

var m2 = Symbolic>();



var c1 = m1.Get("a") == Zen.If(x < 10, x + 1, x + 2);

var c2 = m2 == m1.Set("b", x);

var solution = And(c1, c2).Solve(); // x = 0, m1 = m2 = {"a" => 1, _ => 0}

```



Constant maps and sets have several limitations:

* Inequality may not always give the expected result, as the constant maps do not have a canonical representation.

* They can not be used as values in the `Map`, `Set`, or `Seq` types. This restriction may be relaxed in the future.





## Fixed Length Arrays



Zen can model fixed-length arrays of symbolic values using the `Array` class. As an example:



```csharp

var a = Zen.Symbolic>();           // create a symbolic array of size 10

Zen[] elements = a.ToArray();                 // get the symbolic elements of the array

var solution = Zen.And(

    elements.Aggregate(Zen.Plus) == 100,

    a.All(x => Zen.And(x >= 1, x <= 20))).Solve(); // a = [8,6,13,16,14,15,5,13,5,5]

```



The type parameter `TSize` specifies the size of the array. The types `_1` through `_100` are predefined in the library. To add a custom size, you can create a new struct following this naming convention:



```csharp

struct _150 { }

```





## Sequences, Strings, and Regular Expressions



Zen has a `Seq` type to represent arbitrarily large sequences of elements of type `T`. As there is no complete decision procedure for sequences in constraint solvers, queries for sequences may not always terminate, and you may need to use a timeout. If this is not acceptable, you can always use `FSeq` or `FString` instead, which will model a finite sequence up to a given size. Sequences also support matching against regular expressions. As an example:



```csharp

Regex r = Regex.Star(Regex.Char(1)); // zero or more 1s in a Seq



var s1 = Symbolic>();

var s2 = Symbolic>();



var c1 = s1.MatchesRegex(r);

var c2 = s1 != Seq.Empty();

var c3 = Not(s2.MatchesRegex(r));

var c4 = s1.Length() == s2.Length();

var solution = And(c1, c2, c3, c4).Solve(); // s1 = [1], s2 = [0]

```



Zen supports the `string` type for reasoning about unbounded strings (the `string` type is implemented as a `Seq`). Strings also support matching regular expressions. Zen supports a limited subset of regex constructs currently - it supports anchors like `$` and `^` but not any other metacharacters like `\w,\s,\d,\D,\b` or backreferences `\1`. As an example:



```csharp

Regex r1 = Regex.Parse("[0-9a-z]+");

Regex r2 = Regex.Parse("(0.)*");



var s = Symbolic();



var c1 = s.MatchesRegex(Regex.Intersect(r1, r2));

var c2 = s.Contains("a0b0c");

var c3 = s.Length() == new BigInteger(10);

var solution = And(c1, c2, c3).Solve(); // s = "020z0a0b0c"

```





## Custom classes and structs



Zen supports custom `class` and `struct` types with some limitations. It will attempt to model all public fields and properties. For these types to work, either (1) the class/struct must also have a default constructor and all properties must be allowed to be set, or (2) there must be a constructor with matching parameter names and types for all the public fields. For example, the following are examples that are and are not allowed:



```csharp

// this will work because the fields are public

public class Point 

{ 

    public int X;

    public int Y;

}



// this will work because the properties are public and can be set.

public class Point 

{ 

    public int X { get; set; }

    public int Y { get; set; }

}



// this will NOT work because X can not be set.

public class Point 

{ 

    public int X { get; }

    public int Y { get; set; }

}



// this will work as well since there is a constructor with the same parameter names.

// note that _z will not be modeled by Zen.

public class Point 

{ 

    public int X { get; }

    public int Y { get; set; }

    private int _z;



    public Point(int x, int y) 

    {

        this.X = x;

        this.Y = y;

    }

}



```





## Enumerated values



Enums in C# are just structs that wrap some backing type. Zen will model enums like any other struct. For example, Zen will model the following enum as a byte:



```csharp

public enum Origin : byte

{

    Egp,

    Igp,

    Incomplete,

}

```



By default, Zen does not constraint an enum value to only be one of the enumerated values - it can be any value allowed by the backing type (any value between 0 and 255 in this example instead of just the 3 listed). If you want to add a constraint to ensure the value is only one of those enumerated by the user, you write a function like the following to test if a value is one of those expected:



```csharp

public Zen IsValidOrigin(Zen origin)

{

    return Zen.Or(Enum.GetValues().Select(x => origin == x));

}

```





# Zen Attributes



Zen provides two attributes to simplify the creation and manipulation of symbolic objects. The first attribute `[ZenObject]` can be applied to classes or structs. It uses C# source generators to generate Get and With methods for all public fields and properties.



```csharp

[ZenObject]

public class Point 

{ 

    public int X { get; set; }

    public int Y { get; set; }



    public static Zen Add(Zen p1, Zen p2)

    {

        return p1.WithX(p1.GetX() + p2.GetX()).WithY(p1.GetY() + p2.GetY());

    }

}

```



Note that this requires C# 9.0 and .NET 6 or later to work. In addition, you must add the ZenLib.Generators nuget package to enable code generation. The other attribute supported is the `ZenSize` attribute, which controls the size of a generated field in an object. For example, to fix the size of a `FSeq` to 10:



```csharp

public class Person

{

    [ZenSize(depth: 10)]

    public FSeq Contacts { get; set; }

}

```





# Solver Backends



Zen currently supports two solvers, one based on the [Z3](https://github.com/Z3Prover/z3) SMT solver and another based on [binary decision diagrams](https://github.com/microsoft/DecisionDiagrams) (BDDs). The `Find` and `Zen.Solve` APIs provide an option to select one of the two backends and will default to Z3 if left unspecified. The `StateSetTransformer` API uses the BDD backend. The BDD backend has the limitation that it can only reason about bounded-size objects. This means that it can not reason about values with type `BigInteger` or `string` and will throw an exception. Similarly, these types along with `FSeq`, `FSet`, and `Map` can not be used with transformers.





# Solver Timeouts



Zen supports terminating a call to the solver via the `Solve`, `Maximize`, `Minimize`, and `Find` methods for the Z3 backend. If the solver times out, it will raise a `ZenSolverTimeoutException`. For example, you can try to find a solution within 100 milliseconds with the following:



```csharp

var solverConfig = new ZenLib.Solver.SolverConfig

{

    SolverType = SolverType.Z3,

    SolverTimeout = TimeSpan.FromMilliseconds(100),

};



try

{

    var solution = Zen.And(constraints).Solve(config: solverConfig);

    ...

}

catch (ZenSolverTimeoutException)

{

    Console.WriteLine($"a timeout occurred.");

}

```





# Example: Network ACLs



As a more complete example, the following shows how to use Zen to encode and then verify a simplified network access control list that allows or blocks packets. ACLs generally consist of an ordered collection of match-action rules that apply in sequence with the first applicable rule determining the fate of the packet. We can model an ACL with Zen:



```csharp

// define a class to model Packets using public properties

[ZenObject]

public class Packet

{

    // packet destination ip

    public uint DstIp { get; set; } 

    // packet source ip

    public uint SrcIp { get; set; }

}



// class representing an ACL with a list of prioritized rules.

public class Acl

{

    public string Name { get; set; }

    public AclLine[] Lines { get; set; }



    public Zen Allowed(Zen packet)

    {

        return Allowed(packet, 0);

    }



    // compute whether a packet is allowed by the ACL recursively

    private Zen Allowed(Zen packet, int lineNumber)

    {

        if (lineNumber >= this.Lines.Length) 

        {

            return false; // Zen implicitly converts false to Zen

        }



        var line = this.Lines[lineNumber];



        // if the current line matches, then return the action, otherwise continue to the next line

        return If(line.Matches(packet), line.Action, this.Allowed(packet, lineNumber + 1));

    }

}



// An ACL line that matches a packet.

public class AclLine

{

    public bool Action { get; set; }

    public uint DstIpLow { get; set; }

    public uint DstIpHigh { get; set; }

    public uint SrcIpLow { get; set; }

    public uint SrcIpHigh { get; set; }



    // a packet matches a line if it falls within the specified ranges.

    public Zen Matches(Zen packet)

    {

        return And(

            packet.GetDstIp() >= this.DstIpLow,

            packet.GetDstIp() <= this.DstIpHigh,

            packet.GetSrcIp() >= this.SrcIpLow,

            packet.GetSrcIp() <= this.SrcIpHigh);

    }

}

```





# Implementation Details

Zen builds an abstract syntax tree (AST) for a given user function and then leverages C#'s reflection capabilities to interpret, compile, and symbolically evaluate the AST.





# Contributing



This project welcomes contributions and suggestions.  Most contributions require you to agree to a

Contributor License Agreement (CLA) declaring that you have the right to, and actually do, grant us

the rights to use your contribution. For details, visit https://cla.opensource.microsoft.com.



When you submit a pull request, a CLA bot will automatically determine whether you need to provide

a CLA and decorate the PR appropriately (e.g., status check, comment). Simply follow the instructions

provided by the bot. You will only need to do this once across all repos using our CLA.



This project has adopted the [Microsoft Open Source Code of Conduct](https://opensource.microsoft.com/codeofconduct/).

For more information see the [Code of Conduct FAQ](https://opensource.microsoft.com/codeofconduct/faq/) or

contact [[email protected]](mailto:[email protected]) with any additional questions or comments.