SMT-COMP: Satisfiability Modulo Theories Competition

  • Clark Barrett
  • Leonardo de Moura
  • Aaron Stump
Conference paper

DOI: 10.1007/11513988_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3576)
Cite this paper as:
Barrett C., de Moura L., Stump A. (2005) SMT-COMP: Satisfiability Modulo Theories Competition. In: Etessami K., Rajamani S.K. (eds) Computer Aided Verification. CAV 2005. Lecture Notes in Computer Science, vol 3576. Springer, Berlin, Heidelberg


Decision procedures for checking satisfiability of logical formulas are crucial for many verification applications (e.g., [2,6,3]). Of particular recent interest are solvers for Satisfiability Modulo Theories (SMT). SMT solvers decide logical satisfiability (or dually, validity) with respect to a background theory in classical first-order logic with equality. Background theories useful for verification are supported, like equality and uninterpreted functions (EUF), real or integer arithmetic, and theories of bitvectors and arrays. Input formulas are often syntactically restricted; for example, to be quantifier-free or to involve only difference constraints. Some solvers support a combination of theories, or quantifiers.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Clark Barrett
    • 1
  • Leonardo de Moura
    • 2
  • Aaron Stump
    • 3
  1. 1.Department of Computer ScienceNew York University 
  2. 2.Computer Science LaboratorySRI International 
  3. 3.Department of Computer Science and EngineeringWashington University in St. Louis 

Personalised recommendations