<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2018-10-23 05:42:15Theoretical computer science Logic in computer science NP-complete problems Electronic design automation Formal methods Constraint programming Satisfiability modulo theories Solver Benchmark Unsatisfiable core Lis |
Add to Reading List |
11th International Satisfiability Modulo Theories Competition (SMT-COMP 2016): Rules and Procedures Sylvain Conchon Paris-Sud University France | 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 |