SyGuS Techniques in the Core of an SMT Solver Andrew Reynolds SYNT Workshop July 22, 2017

Source URL: www.react.uni-saarland.de

• Theoretical computer science
• Logic in computer science
• Constraint programming
• Electronic design automation
• Satisfiability modulo theories

Splitting on Demand in SAT Modulo Theories Clark Barrett? , Robert Nieuwenhuis?? , Albert Oliveras??, and Cesare Tinelli? ? ? Abstract. Lazy algorithms for Satisfiability Modulo Theories (SMT) combine a generic DPLL-base

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematical logic
• Mathematics
• Constraint programming
• Automated theorem proving
• Logic in computer science
• Formal methods
• Propositional calculus
• Satisfiability modulo theories
• DPLL algorithm
• Unit propagation
• Solver

Instantiation and Pretending to be an SMT Solver with VAMPIRE ∗ Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,3,4 1 3

Source URL: smt-workshop.cs.uiowa.edu

• Theoretical computer science
• Mathematical logic
• Logic
• Automated theorem proving
• Logic in computer science
• Formal methods
• Logic programming
• Predicate logic
• Satisfiability modulo theories
• Unification
• Solver
• Resolution

SMT-Based Model Checking for Recursive Programs ⋆ Anvesh Komuravelli, Arie Gurfinkel, and Sagar Chaki Carnegie Mellon University, Pittsburgh, PA, USA Abstract. We present an SMT-based symbolic model checking algorithm

Source URL: seahorn.github.io

• Mathematics
• Symbol
• 120-cell
• Craig interpolation
• Computability theory
• Fiber bundles
• Differential topology

13th International Satisfiability Modulo Theories Competition SMT-COMPMatthias Heizmann Aina Niemetz

Source URL: smtcomp.sourceforge.net

Verification Using SAT and SMT Solvers1 N. Shankar Computer Science Laboratory SRI International Menlo Park, CA

Source URL: dream.inf.ed.ac.uk

• Theoretical computer science
• Mathematical logic
• Mathematics
• Boolean algebra
• Logic in computer science
• Electronic design automation
• Formal methods
• NP-complete problems
• Boolean satisfiability problem
• Satisfiability modulo theories
• Propositional calculus
• Model checking

Modular SMT-Based Analysis of Nonlinear Hybrid Systems Kyungmin Bae Sicun Gao

Source URL: scungao.github.io

SMT Beyond DPLL(T): A New Approach to Theory Solvers and Theory Combination by Dejan Jovanovi´c

Source URL: csl.sri.com

• Theoretical computer science
• Mathematical logic
• Mathematics
• Formal methods
• Logic in computer science
• Computability theory
• Electronic design automation
• NP-complete problems
• Satisfiability modulo theories
• Solver
• Entscheidungsproblem
• Decidability

Deciding Unbounded Heaps  in an SMT Framework  Zvonimir Rakamarić 1 , Roberto Bruttomesso 2 , Alan Hu 1 ,  Alessandro Cimatti 2  1 University of British Columbia; 2 ITC­IRST

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Constraint programming
• Electronic design automation
• Logic in computer science
• Satisfiability modulo theories
• Heap
• FO
• Transitive closure

Better Answers to Real Questions Thomas Sturm, Joint Work with M. Košta and A. Dolzmann SMT 2014, Vienna, 18 Julyhttp://www.mpi-inf.mpg.de/~sturm/

Source URL: smt2014.it.uu.se