First Page | Document Content | |
---|---|---|
Date: 2018-07-14 13:51:00Theoretical computer science NP-complete problems Logic in computer science Constraint programming Electronic design automation Formal methods Satisfiability modulo theories Solver Benchmark Unsatisfiable core Lis | 13th International Satisfiability Modulo Theories Competition (SMT-COMP 2018): Rules and Procedures Matthias Heizmann University of Freiburg GermanyAdd to Reading ListSource URL: smtcomp.sourceforge.netDownload Document from Source WebsiteFile Size: 203,66 KBShare Document on Facebook |
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 |