论文信息 - 10th International Satisfiability Modulo Theories Competition (SMT-COMP 2015): Rules and Procedures - 字舞流文

10th International Satisfiability Modulo Theories Competition (SMT-COMP 2015): Rules and Procedures

Sylvain Conchon | Tjark Weber | S. Conchon | Tjark Weber

[1] Aaron Stump,et al. The 2013 Evaluation of SMT-COMP and SMT-LIB , 2015, Journal of Automated Reasoning.

[2] Armin Biere,et al. Boolector 2 . 0 system description , 2015 .

[3] David Déharbe,et al. The 2014 SMT Competition , 2014, J. Satisf. Boolean Model. Comput..

[4] Andrei Voronkov,et al. First-Order Theorem Proving and Vampire , 2013, CAV.

[5] Roberto Bruttomesso,et al. The 2012 SMT Competition , 2013, SMT@IJCAR.

[6] Jochen Hoenicke,et al. SMTInterpol: An Interpolating SMT Solver , 2012, SPIN.

[7] Albert Oliveras,et al. Design and Results of the 3rd Annual Satisfiability Modulo Theories Competition (SMT-Comp 2007) , 2008, Int. J. Artif. Intell. Tools.

[8] Aaron Stump,et al. Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006) , 2007, Formal Methods Syst. Des..

[9] Aaron Stump,et al. Design and Results of the First Satisfiability Modulo Theories Competition (SMT-COMP 2005) , 2005, Journal of Automated Reasoning.

[10] Laurent Simon,et al. The Essentials of the SAT 2003 Competition , 2003, SAT.

[11] Geoff Sutcliffe,et al. The development of CASC , 2002, AI Commun..