SMT proof checking using a logical framework

  • Authors:

  • Aaron Stump;Duckki Oe;Andrew Reynolds;Liana Hadarean;Cesare Tinelli

  • Affiliations:

  • The University of Iowa, Iowa City, USA;The University of Iowa, Iowa City, USA;The University of Iowa, Iowa City, USA;New York University, New York, USA;The University of Iowa, Iowa City, USA

  • Venue:
  • Formal Methods in System Design
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Producing and checking proofs from SMT solvers is currently the most feasible method for achieving high confidence in the correctness of solver results. The diversity of solvers and relative complexity of SMT over, say, SAT means that flexibility, as well as performance, is a critical characteristic of a proof-checking solution for SMT. This paper describes such a solution, based on a Logical Framework with Side Conditions (LFSC). We describe the framework and show how it can be applied for flexible proof production and checking for two different SMT solvers, clsat and cvc3. We also report empirical results showing good performance relative to solver execution time.