Proof Checking Technology for Satisfiability Modulo Theories

@article{Stump2009ProofCT,
  title={Proof Checking Technology for Satisfiability Modulo Theories},
  author={Aaron Stump},
  journal={Electr. Notes Theor. Comput. Sci.},
  year={2009},
  volume={228},
  pages={121-133}
}
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… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 32 CITATIONS, ESTIMATED 24% COVERAGE

136 Citations

0102030'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 136 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…