Abstract

Abstract. In this work, we investigate various proof systems for quantifier-free Linear Real Arithmetic, focusing on the continuum between declarative and com-putational styles of proof checking. We use LFSC, a high-level declarative lan-guage for defining proof systems and proof objects for virtually any logic. One of the distinguishing features of LFSC is its support for computational side con-ditions on proof rules. Side conditions facilitate the design of proof systems that reflect closely the sort of high-performance inferences made by SMT solvers. We propose a proof translation for LRA that exploits the continuum between declar-ative and computational proof checking, and report on our comparative experi-mental results on generating and checking proofs using alternative strategies. 1