Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)

Authors:
Clark Barrett;Leonardo Moura;Aaron Stump
Affiliations:
Department of Computer Science, New York University, New York, USA 10012;Microsoft Research, Redmond, USA 98052;CSE Department, Washington University in St. Louis, St. Louis, USA 63130
Venue:
Formal Methods in System Design
Year:
2007

Citing 9
Cited 2

Bounded Model Checking Using Satisfiability Solving

Formal Methods in System Design
Counter-Example Based Predicate Discovery in Predicate Abstraction

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Automatically proving the correctness of compiler optimizations

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Design and Results of the First Satisfiability Modulo Theories Competition (SMT-COMP 2005)

Journal of Automated Reasoning
The development of CASC

AI Communications - CASC
Boogie: a modular reusable verifier for object-oriented programs

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
SMT techniques for fast predicate abstraction

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
TVOC: a translation validator for optimizing compilers

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Data structure specifications via local equality axioms

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification

Model checking for the practical verificationist: a user's perspective on SAL

Proceedings of the second workshop on Automated formal methods
Safety Guarantees from Explicit Resource Management

Formal Methods for Components and Objects

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Satisfiability Modulo Theories Competition (SMT-COMP) arose from the SMT-LIB initiative to spur adoption of common, community-designed formats, and to spark further advances in satisfiability modulo theories (SMT). The first SMT-COMP was held in 2005 as a satellite event of CAV 2005. SMT-COMP 2006 was held August 17---19, 2006, as a satellite event of CAV 2006. This paper describes the rules and competition format for SMT-COMP 2006, the benchmarks used, the participants, and the results.