Results 1 
5 of
5
veriT: an open, trustable and efficient SMTsolver
 Proc. Conference on Automated Deduction (CADE), volume 5663 of Lecture Notes in Computer Science
, 2009
"... Abstract. This article describes the first public version of the satisfiability modulo theory (SMT) solver veriT. It is opensource, proofproducing, and complete for quantifierfree formulas with uninterpreted functions and difference logic on real numbers and integers. 1 ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
Abstract. This article describes the first public version of the satisfiability modulo theory (SMT) solver veriT. It is opensource, proofproducing, and complete for quantifierfree formulas with uninterpreted functions and difference logic on real numbers and integers. 1
L.: A flexible proof format for SMT: A proposal
, 2011
"... The standard input format for Satisfiability Modulo Theories (SMT) solvers has now reached its second version and integrates many of the features useful for users to interact with their favourite SMT solver. However, although many SMT solvers do output proofs, no standardised proof format exists. We ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The standard input format for Satisfiability Modulo Theories (SMT) solvers has now reached its second version and integrates many of the features useful for users to interact with their favourite SMT solver. However, although many SMT solvers do output proofs, no standardised proof format exists. We, here, propose for discussion at the PxTP Workshop a generic proof format in the SMTLIB philosophy that is flexible enough to be easily recast for any SMT solver. The format is configurable so that the proof can be provided by the solver at the desired level of detail. 1
Efficient Generation of Craig Interpolants in Satisfiability Modulo Theories
"... The problem of computing Craig Interpolants has recently received a lot of interest. In this paper, we address the problem of efficient generation of interpolants for some important fragments of firstorder logic, which are amenable for effective decision procedures, called Satisfiability Modulo The ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
The problem of computing Craig Interpolants has recently received a lot of interest. In this paper, we address the problem of efficient generation of interpolants for some important fragments of firstorder logic, which are amenable for effective decision procedures, called Satisfiability Modulo Theory solvers. We make the following contributions. First, we provide interpolation procedures for several basic theories of interest: the theories of linear arithmetic over the rationals, difference logic over rationals and integers, and UTVPI over rationals and integers. Second, we define a novel approach to interpolate combinations of theories, that applies to the Delayed Theory Combination approach. Efficiency is ensured by the fact that the proposed interpolation algorithms extend stateoftheart algorithms for Satisfiability Modulo Theories. Our experimental evaluation shows that the MathSAT SMT solver can produce interpolants with minor overhead in search, and much more efficiently than other competitor solvers.
A NelsonOppen based Proof System using Theory Specific Proof Systems ∗
"... SMT solvers are nowadays pervasive in verification tools. When the verification is about a critical system, the result of the SMT solver is also critical and cannot be trusted. The SMTLIB 2.0 is a standard interface for SMT solvers but does not specify the output of the getproof command. We presen ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
SMT solvers are nowadays pervasive in verification tools. When the verification is about a critical system, the result of the SMT solver is also critical and cannot be trusted. The SMTLIB 2.0 is a standard interface for SMT solvers but does not specify the output of the getproof command. We present a proof system that is geared towards SMT solvers and follows their conceptually modular architecture. Our proof system makes a clear distinction between propositional and theory reasoning. Moreover, individual theories provide specific proof systems that are combined using the NelsonOppen proof scheme. We propose specific proof systems for linear real arithmetic (LRA) and uninterpreted functions (EUF) and discuss proof generation and proof checking. We have evaluated the cost of generating proofs in our proof system. Our experiments on benchmarks taken from the SMTLIB library show that the simple mechanisms used in our approach suffice for a large majority of the selected benchmarks. 1
Walking through the Forest: a Fast EUF ProofChecking Algorithm
"... The quantifierfree logic of equality with uninterpreted function symbols (EUF) is at the core of SMT solvers. However, there exist several competing proof formats to validate EUF proofs. As EUF proof, we advocate for the proof forest that is the artifact proposed by Nieuwenhuis and Oliveras to extr ..."
Abstract
 Add to MetaCart
The quantifierfree logic of equality with uninterpreted function symbols (EUF) is at the core of SMT solvers. However, there exist several competing proof formats to validate EUF proofs. As EUF proof, we advocate for the proof forest that is the artifact proposed by Nieuwenhuis and Oliveras to extract efficiently EUF unsatisfiable cores. An advantage of this proof format is that it can be generated by the SMT solver for almost free. Our preliminary experiments show that our proof forest verifier outperforms other EUF verifiers and that proof forests appear to be more concise than existing EUF proofs. 1