Splitting on Demand in SAT Modulo Theories Clark Barrett, Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli New York Univ. Techn. Univ. Catalonia

First Page		Document Content
Date: 2006-11-16 20:30:50 Theoretical computer science Mathematical logic Mathematics Boolean algebra Logic in computer science Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem Phnom Penh Solver Propositional calculus		Splitting on Demand in SAT Modulo Theories Clark Barrett, Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli New York Univ. Techn. Univ. Catalonia Add to Reading List Source URL: www.lsi.upc.edu Download Document from Source Website File Size: 836,77 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