Proof Checking Technology for Satisfiability Modulo Theories

https://doi.org/10.1016/j.entcs.2008.12.121Get rights and content
Under a Creative Commons license
open access

Abstract

A common proof format for solvers for Satisfiability Modulo Theories (SMT) is proposed, based on the Edinburgh Logical Framework (LF). Two problems arise: checking very large proofs, and keeping proofs compact in the presence of complex side conditions on rules. Incremental checking combines parsing and proof checking in a single step, to avoid building in-memory representations of proof subterms. LF with Side Conditions (LFSC) extends LF to allow side conditions to be expressed using a simple first-order functional programming language. Experimental data with an implementation show very good proof checking times and memory usage on benchmarks including the important example of resolution inferences.

Keywords

Edinburgh LF
incremental checking
Satisfiability Modulo Theories
LF with Side Conditions

Cited by (0)

This work supported by the U.S. National Science Foundation under grant number CNS-0551697.