<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2009-09-10 10:56:53Theoretical computer science Logic Mathematics Formal methods Logic in computer science Boolean algebra Electronic design automation NP-complete problems Boolean satisfiability problem Satisfiability modulo theories Solver Propositional calculus |
Add to Reading List |
Introduction SAT Solvers Satisfiability Modulo Theories Conclusions Integrating SAT and SMT Solvers | DryadSynth: A Concolic SyGuS Solver Xiaokang Qiu (joint work with Kangjing Huang and Yanjun Wang) Purdue University SYNT WorkshopDocID: 1xW38 - View Document |
 | Bounded Model Generation for Isabelle/HOL Using a SAT Solver Tjark WeberDocID: 1xVzf - View Document |
 | Integrating a SAT Solver with an LCF-style Theorem Prover A Fast Decision Procedure for Propositional Logic for the Isabelle System Tjark WeberDocID: 1xVu1 - View Document |
 | The Barcelogic SMT Solver (Tool Paper)? Miquel Bofill† , Robert Nieuwenhuis? , Albert Oliveras? , Enric Rodr´ıguez-Carbonell? and Albert Rubio? †DocID: 1xVrM - View Document |
 | Multi-Solver Support in Symbolic Execution Hristina Palikareva, Cristian Cadar SMT Workshop 2014, Vienna, 17 July 2014 Dynamic Symbolic ExecutionDocID: 1xV4A - View Document |