Outline SMT: Where Do We Go From Here? Clark Barrett, New York University SMT Workshop, July 17, 2014

First Page		Document Content
Date: 2014-07-21 06:41:07 Theoretical computer science Mathematics Computational complexity theory Logic in computer science NP-complete problems Electronic design automation Formal methods Constraint programming Satisfiability modulo theories Boolean satisfiability problem Solver Automated reasoning		Outline SMT: Where Do We Go From Here? Clark Barrett, New York University SMT Workshop, July 17, 2014 Add to Reading List Source URL: smt2014.it.uu.se Download Document from Source Website File Size: 507,51 KB Share Document on Facebook

	DryadSynth: A Concolic SyGuS Solver Xiaokang Qiu (joint work with Kangjing Huang and Yanjun Wang) Purdue University SYNT Workshop DocID: 1xW38 - View Document
	Bounded Model Generation for Isabelle/HOL Using a SAT Solver Tjark Weber DocID: 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 Weber DocID: 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 Execution DocID: 1xV4A - View Document