• Publications
  • Influence
The SMT-LIB Standard Version 2.0
The SMT-LIB initiative is an international effort, supported by research groups worldwide, with the two-fold goal of producing an extensive on-line library of benchmarks and promoting the adoption ofExpand
  • 827
  • 96
  • PDF
CVC: A Cooperating Validity Checker
TLDR
This paper describes the CVC ("Cooperating Validity Checker") decision procedure that combines subsidiary decision procedures for certain logical theories into a decision procedure for the theories' union. Expand
  • 241
  • 20
Introducing StarExec: a Cross-Community Infrastructure for Logic Solving
TLDR
We introduce StarExec, a public web-based service built to facilitate the experimental evaluation of logic solvers, broadly understood as automated tools based on formal reasoning. Expand
  • 153
  • 20
  • PDF
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
TLDR
We describe a number of obstacles that had to be overcome before developing an approach which was ultimately very effective, and give results on verification benchmarks using CVC (Cooperating Validity Checker), which includes the Chaff SAT solver. Expand
  • 170
  • 13
  • PDF
A decision procedure for an extensional theory of arrays
TLDR
This paper presents a decision procedure for an extensional theory of arrays and proves it correct. Expand
  • 157
  • 13
  • PDF
SMT-COMP: Satisfiability Modulo Theories Competition
TLDR
The Satisfiability Modulo Theories Competition (SMT-COMP) is intended to spark further advances in SMT field, especially for applications in verification. Expand
  • 113
  • 7
  • PDF
Verified programming in Guru
TLDR
Operational Type Theory is a type theory allowing possibly diverging programs while retaining decidability of type checking and a consistent logic. Expand
  • 47
  • 7
  • PDF
Slothrop: Knuth-Bendix Completion with a Modern Termination Checker
TLDR
A Knuth-Bendix completion procedure is parametrized by a reduction ordering used to ensure termination of intermediate rewrite systems. Expand
  • 41
  • 5
  • PDF
A Generalization of Shostak's Method for Combining Decision Procedures
TLDR
We present two new algorithms based on Shostak's method based on a variation of the Nelson-Oppen method for combining theories. Expand
  • 63
  • 4
  • PDF
Irrelevance, Heterogeneous Equality, and Call-by-value Dependent Type Systems
TLDR
We present a full-spectrum dependently typed core language which includes both nontermination and computational irrelevance (a.k.a. erasure), a combination which has not been studied before. Expand
  • 24
  • 4
  • PDF
...
1
2
3
4
5
...