13th International Satisfiability Modulo Theories Competition (SMT-COMP 2018): Rules and Procedures Matthias Heizmann University of Freiburg Germany

First Page		Document Content
Date: 2018-07-14 13:51:00 Theoretical 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 Germany Add to Reading List Source URL: smtcomp.sourceforge.net Download Document from Source Website File Size: 203,66 KB Share Document on Facebook

	On Improving MUS Extraction Algorithms Joao Marques-Silva1,2 and Ines Lynce2 1 2 DocID: 1pFKE - View Document
	sets-graph-msuc-opt.ipeps DocID: 1pkHb - View Document
	What Gives? A Hybrid Algorithm for Error Trace Explanation Vijayaraghavan Murali1 , Nishant Sinha2 , Emina Torlak3 , and Satish Chandra4 1 NUS, Singapore DocID: 18Gpq - View Document
	Instantiations, Zippers and EPR Interpolation Nikolaj Bjørner, Arie Gurfinkel, Konstantin Korovin and Ori Lahav Microsoft Research, Software Engineering Institute, University of Manchester, Tel Aviv University Abstract DocID: 18EQ6 - View Document
	A Constraint Solver for Software Engineering: Finding Models and Cores of Large Relational Specifications by Emina Torlak DocID: 18m13 - View Document