Satisfiability Modulo Theories Competition (SMT-COMP) 2014: Rules and Procedures David R. Cok GrammaTech, Inc. Ithaca, NY (USA)

First Page		Document Content
Date: 2015-02-17 10:00:22 Theoretical computer science Computing Logic in computer science Electronic design automation Formal methods NP-complete problems Constraint programming Satisfiability modulo theories Benchmark Solver Standard Performance Evaluation Corporation Computer performance		Satisfiability Modulo Theories Competition (SMT-COMP) 2014: Rules and Procedures David R. Cok GrammaTech, Inc. Ithaca, NY (USA) Add to Reading List Source URL: smtcomp.sourceforge.net Download Document from Source Website File Size: 147,67 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