Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)
暂无分享,去创建一个
[1] Clark W. Barrett,et al. Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite , 2006, Electron. Notes Theor. Comput. Sci..
[2] Bor-Yuh Evan Chang,et al. Boogie: A Modular Reusable Verifier for Object-Oriented Programs , 2005, FMCO.
[3] Cesare Tinelli,et al. DPLL( T): Fast Decision Procedures , 2004, CAV.
[4] Geoff Sutcliffe,et al. The development of CASC , 2002, AI Commun..
[5] Sorin Lerner,et al. Automatically proving the correctness of compiler optimizations , 2003, PLDI '03.
[6] Cesare Tinelli,et al. The SMT-LIB Standard: Version 1.2 , 2005 .
[7] David L. Dill,et al. Counter-Example Based Predicate Discovery in Predicate Abstraction , 2002, FMCAD.
[8] Armin Biere,et al. Bounded Model Checking Using Satisfiability Solving , 2001, Formal Methods Syst. Des..
[9] Albert Oliveras,et al. SMT Techniques for Fast Predicate Abstraction , 2006, CAV.
[10] George C. Necula,et al. Data Structure Specifications via Local Equality Axioms , 2005, CAV.
[11] Aaron Stump,et al. Design and Results of the First Satisfiability Modulo Theories Competition (SMT-COMP 2005) , 2005, Journal of Automated Reasoning.
[12] Geoff Sutcliffe,et al. The state of CASC , 2006, AI Commun..
[13] Amir Pnueli,et al. TVOC: A Translation Validator for Optimizing Compilers , 2005, CAV.