A decomposition-based parallel SAT solver that decomposes SAT formulas efficiently and reconciles solutions between partitions by means of propositional (Craig) interpolation.
Date: 23 April 2014
Size: 0.15 MB
Automata is a .NET tool kit that provides facilities for manipulating and analyzing regular expressions, symbolic finite automata, and symbolic finite transducers. It supports automata and transducers where input and output alphabets can be fully symbolic. Constraints over the alphabets can be analyzed using Satisfiability Modulo Theory (SMT) solvers. The tool kit provides a particular extension that uses the Microsoft SMT solver Z3.
Date: 27 October 2011
Size: 3.13 MB
Privacy Integrated Queries (PINQ) is a LINQ-like API for writing programs against sensitive data sets, while providing differential privacy guarantees for the underlying records. This first release provides the PINQ infrastructure, several example data analysis applications, and should be suitable for prototyping many differentially-private data analyses.
Date: 18 August 2009
Size: 0.27 MB