• Publications
  • Influence
Z3: An Efficient SMT Solver
TLDR
Z3 is a new and efficient SMT Solver freely available from Microsoft Research that is used in various software verification and analysis applications. Expand
Generalized Property Directed Reachability
TLDR
This work provides a specification of the IC3 algorithm using an abstract transition system and highlights its dual operation: model search and conflict resolution, and generalizes the method to Boolean constraints involving theories. Expand
Checking Beliefs in Dynamic Networks
TLDR
NoD generalizes a specialized system, SecGuru, and is currently use in production to catch hundreds of configuration bugs a year and can also scale to large to large header spaces because of a new filter-project operator and a symbolic header representation. Expand
Efficient E-Matching for SMT Solvers
TLDR
An index that works on E-graphs is introduced, called E-matching code treesthat combine features of substitution and code trees, used in saturation based theorem provers and shows substantial performance improvements over existing state-of-the-art SMT solvers. Expand
Satisfiability Modulo Theories: An Appetizer
TLDR
Satisfiability Modulo Theories is about checking the satisfiability of logical formulas over one or more theories, which combines the problem of Boolean satisfiability with domains, such as those studied in convex optimization and term-manipulating symbolic systems. Expand
νZ - An Optimizing SMT Solver
TLDR
usage scenarios of i¾?Z are described, the tool architecture that allows dispatching problems to special purpose solvers is outlined, and use cases are examined. Expand
Path Feasibility Analysis for String-Manipulating Programs
TLDR
Results on the complexity of the problem of path feasibility for programs manipulating strings using a collection of standard string library functions, including its undecidability in the general case and decidability of some special cases are proved. Expand
STeP: The Stanford Temporal Prover
TLDR
The Stanford Temporal Prover is described, a system being developed to support the computer-aided formal verification of concurrent and reactive systems based on temporal specifications that combines model checking and deductive methods to allow the verification of a broad class of systems. Expand
Horn Clause Solvers for Program Verification
TLDR
The authors summarize main useful properties of Horn clauses, illustrate encodings of procedural program verification into Horn clauses and then highlight a number of useful simplification strategies at the level of Horn clause. Expand
νZ - Maximal Satisfaction with Z3
TLDR
Z (new-Z, or max-Z), an extension within Z3 that lets users formulate objective functions directly with Z3, and under the hood there is a portfolio of approaches for solving linear optimization problems over SMT formulas, MaxSMT, and their combinations. Expand
...
1
2
3
4
5
...