论文信息 - The 2012 SMT Competition

The 2012 SMT Competition

The 2012 SMT Competition was held in conjunction with the SMT workshop at IJCAR 2012. Eleven solvers participated, showing improvements over 2011 in some but not all divisions. The competition featured a new unsat-core-generation track and encouraged the demonstration of proof-generation solvers. The series of competitions is expected to be continued at SAT 2013.

[1] Jan Peleska,et al. A Unified Approach to Abstract Interpretation, Formal Verification and Testing of C/C++ Modules , 2008, ICTAC.

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

[3] Armin Biere,et al. Lemmas on demand for the extensional theory of arrays , 2008, SMT '08/BPR '08.

[4] Jan Peleska,et al. Integrated and Automated Abstract Interpretation, Verification and Testing of C/C++ Modules , 2010, Concurrency, Compositionality, and Correctness.

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

[6] Roberto Bruttomesso,et al. Broadening the Scope of SMT-COMP: the Application Track , 2012, COMPARE.

[7] Clark W. Barrett,et al. The SMT-LIB Standard Version 2.0 , 2010 .

[8] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.

[9] David R. Cok. The SMT-LIBv2 Language and Tools: A Tutorial , 2012 .

[10] Jan Peleska,et al. A Real-World Benchmark Model for Testing Concurrent Real-Time Systems in the Automotive Domain , 2011, ICTSS.