1 / 10

# Logic Engines as a Service - PowerPoint PPT Presentation

Logic Engines as a Service. Leonardo de Moura and Nikolaj Bjørner Microsoft Research. Satisfiability. Solution/Model. s at, . unsat , P roof. Is execution path P feasible?. Is assertion X violated?. WI TNESS. SAGE. Is Formula F Satisfiable ?. Theorem Prover. Simplex.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about ' Logic Engines as a Service' - aviva

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

### Logic Engines as a Service

Leonardo de Moura and Nikolaj Bjørner

Microsoft Research

Solution/Model

sat,

unsat, Proof

Is execution path P feasible?

Is assertion X violated?

WI

TNESS

SAGE

Is Formula FSatisfiable?

Theorem Prover

Simplex

Rewriting

DPLL

Superposition

Z3 is a collection of

Symbolic Reasoning Engines

Congruence

Closure

Euclidean

Solver

Groebner

Basis



elimination

Test Case Generation

Verifying Compilers

Model Based Testing

Invariant Generation

Type Checking

Model Checking

SAGE

HAVOC

Vigilante

Used by many research groups

TACAS paper (> 1500 citations)

Ships with many popular systems

Isabelle, Pex, SLAM/SDV, …

Solved more than 5 Billion constraints created by SAGE when checking Win8 and Office.

Algorithms

Decidable Fragments

Data structures

Heuristics

1. Interpolants

2. Fixed Points

Beyond

Satisfiability

Arithmetic, Bit-Vectors,

Booleans, Arrays,

Datatypes, Quantifiers

New Engines

3. Strings

4.Nonlinear arith.

Z3 with objective functions (Bjørner)

Leverage progress in MaxSATfor SMT

Stochastic Local Search in Z3 (Wintersteiger)

For hard feasibility problems from symbolic execution, floating points

Lean: new theorem prover(de Moura)

Powerful Dependent Type system, Higher-Order