SMT-COMP: Satisfiability modulo theories competition

DOI10.1007/11513988_4MaRDI QIDQ5716582zbMATH OpenOpenAlexFDO

Authors Clark Barrett, Leonardo de Moura, Aaron Stump

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b138445

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
• Satisfiability modulo theories
• A Tutorial on Satisfiability Modulo Theories
• Satisfiability checking: theory and applications
• A survey of satisfiability modulo theory

Cited in

(43)

• Solving quantified verification conditions using satisfiability modulo theories
• Theory decision by decomposition
• Deciding local theory extensions via E-matching
• Modular strategic SMT solving with \textbf{SMT-RAT}
• SMT proof checking using a logical framework
• Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)
• Visualizing SAT instances and runs of the DPLL algorithm
• The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
• \textsf{SC}\(^2\): satisfiability checking meets symbolic computation. (Project paper)
• Synthesis of domain specific CNF encoders for bit-vector solvers
• OpenSMT2: an SMT solver for multi-core and cloud computing
• A survey of satisfiability modulo theory
• Using satisfiability modulo theories for inductive verification of Lustre programs
• The 2013 evaluation of SMT-COMP and SMT-LIB
• An experiment with satisfiability modulo SAT
• Taking satisfiability to the next level with Z3 (abstract)
• I-RiSC: an SMT-compliant solver for the existential fragment of real algebra
• Beyond satisfiability: extensions and applications
• Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
• Efficient Term-ITE Conversion for Satisfiability Modulo Theories
• Satisfiability checking: theory and applications
• Precise and complete propagation based local search for satisfiability modulo theories
• The strategy challenge in SMT solving
• A system for solving constraint satisfaction problems with SMT
• Decision procedures. An algorithmic point of view
• Exploiting symmetry in SMT problems
• The problem of checking the satisfiability of formulae of decidable theories (survey)
• The MathSAT5 SMT solver
• Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
• A Tutorial on Satisfiability Modulo Theories
• Rocket-Fast Proof Checking for SMT Solvers
• Bugs, moles and skeletons: symbolic reasoning for software development
• From Propositional Satisfiability to Satisfiability Modulo Theories
• Combined Satisfiability Modulo Parametric Theories
• Formal Methods for Hardware Verification
• Getting saturated with induction
• Equality detection for linear arithmetic constraints
• On the modelling and optimization of preferences in constraint-based temporal reasoning
• Satisfiability modulo finite fields
• An empirical assessment of progress in automated theorem proving
• Multiple interdependent simple temporal networks with uncertainty: a semi-decentralized multi-agent model with shared control of activity durations
• Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
• Fast congruence closure and extensions

Describes a project that uses

Uses Software

• SMT-LIB

This page was built for publication: SMT-COMP: Satisfiability modulo theories competition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716582)