Computer Aided Verification

DOI10.1007/b11831zbMath1278.68259OpenAlexW1571340194MaRDI QIDQ5900690

James B. Saxe, Rajeev Joshi, Xinming Ou, Cormac Flanagan

Publication date: 20 April 2010

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

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

Mathematics Subject Classification ID

Related Items (17)

HordeSat: A Massively Parallel Portfolio SAT Solver ⋮ Satisfiability Modulo Theories ⋮ SAT race 2015 ⋮ The SAT-based approach to separation logic ⋮ M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures ⋮ Fast congruence closure and extensions ⋮ Extending a Resolution Prover for Inequalities on Elementary Functions ⋮ Synchronous counting and computational algorithm design ⋮ Efficient theory combination via Boolean search ⋮ Preface to the special issue ``SI: satisfiability modulo theories ⋮ Complexity-sensitive decision procedures for abstract argumentation ⋮ Abstraction-Based Algorithm for 2QBF ⋮ Variant-Based Satisfiability in Initial Algebras ⋮ A framework for satisfiability modulo theories ⋮ Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis ⋮ Combining Equational Reasoning ⋮ Distributing the Workload in a Lazy Theorem-Prover

Uses Software

• SATO
• SIMPLIFY
• Chaff

This page was built for publication: Computer Aided Verification