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.
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.
Leonardo de Moura and Nikolaj Bjørner
Is execution path P feasible?
Is assertion X violated?
Is Formula FSatisfiable?
Z3 is a collection of
Symbolic Reasoning Engines
Test Case Generation
Model Based Testing
Used by many research groups
TACAS paper (> 1500 citations)
More than 35k downloads
Ships with many popular systems
Isabelle, Pex, SLAM/SDV, …
Solved more than 5 Billion constraints created by SAGE when checking Win8 and Office.
2. Fixed Points
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