Fast and flexible proof checking for SMT

Authors:
Duckki Oe;Andrew Reynolds;Aaron Stump
Affiliations:
The University of Iowa, Iowa City;The University of Iowa, Iowa City;The University of Iowa, Iowa City
Venue:
Proceedings of the 7th International Workshop on Satisfiability Modulo Theories
Year:
2009

Citing 5
Cited 3

Higher-order abstract syntax

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
HOL Light: A Tutorial Introduction

FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Formal Verification of a Combination Decision Procedure

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Towards an SMT proof format

SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite

Electronic Notes in Theoretical Computer Science (ENTCS)

CVC4

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
versat: a verified modern SAT solver

VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
SMT proof checking using a logical framework

Formal Methods in System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fast and flexible proof checking can be implemented for SMT using the Edinburgh Logical Framework with Side Conditions (LFSC). LFSC provides a declarative format for describing proof systems as signatures. We describe several optimizations for LFSC proof checking, and report experiments on QF_IDL benchmarks showing proof-checking overhead of 32% of the solving time required by our clsat solver.