Share This Author
The SMT-LIB Standard Version 2.0
This paper introduces Version 2 of the SMT-LIB Standard, a major upgrade of the previous Version 1.2 which, in addition to simplifying and extending the languages of that version, includes a new command language for interfacing with SMT solvers.
Introducing StarExec: a Cross-Community Infrastructure for Logic Solving
StarExec allows community organizers to store, manage and make available benchmark libraries; competition organizers to run logic solver competitions; and community members to do comparative evaluations of logic solvers on public or private benchmark problems.
CVC: A Cooperating Validity Checker
- Aaron Stump, C. Barrett, D. Dill
- Business, Computer ScienceInternational Conference on Computer Aided…
- 27 July 2002
The CVC ("Cooperating Validity Checker") decision procedure is described, which implements a framework for combining subsidiary decision procedures for certain logical theories into a decision procedure for the theories' union.
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
This paper describes an alternative but similar approach to using SAT in conjunction with a more expressive fragment of first-order logic, however, rather than translating the entire formula up front, the formula is incrementally translated during a search for the solution.
A decision procedure for an extensional theory of arrays
- Aaron Stump, C. Barrett, D. Dill, J. Levitt
- Computer ScienceProceedings 16th Annual IEEE Symposium on Logic…
- 16 June 2001
A decision procedure for an extensional theory of arrays is presented and it is proved that it is correct.
SMT-COMP: Satisfiability Modulo Theories Competition
- C. Barrett, L. D. Moura, Aaron Stump
- Computer ScienceInternational Conference on Computer Aided…
- 6 July 2005
Of particular recent interest are solvers for Satisfiability Modulo Theories (SMT), which decide logical satisfiability (or dually, validity) with respect to a background theory in classical first-order logic with equality.
A Generalization of Shostak's Method for Combining Decision Procedures
Two new algorithms based on Shostak's method for solving the problem of determining whether a quantifier-free formula o is satisfiable in some first-order theory are presented.
Verified programming in Guru
- Aaron Stump, Morgan Deters, Adam Petcher, Todd W. Schiller, T. Simpson
- Computer SciencePLPV '09
- 20 January 2009
This paper gives an introduction to verified programming in Guru, a type theory allowing possibly diverging programs while retaining decidability of type checking and a consistent logic.
Slothrop: Knuth-Bendix Completion with a Modern Termination Checker
An implementation of the new procedure, Slothrop, which automatically obtains such completions for theories that do not admit path orderings and is also not just ground-convergent, but fully convergent.
Foundational proof checkers with small witnesses
The theory, design, and implementation of a proof-checker that permits small proof witnesses and machine-checkable proofs of the soundness of the system are shown.