Abstract. Isabelle/HOL is a popular interactive theorem prover based on higherorder logic. It owes its success to its ease of use and powerful automation. Much of the automation is...
Jasmin Christian Blanchette, Lukas Bulwahn, Tobias...
Combination of theories underlies the design of satisfiability modulo theories (SMT) solvers. The Nelson-Oppen framework can be used to build a decision procedure for the combinat...
Pascal Fontaine, Stephan Merz, Christoph Weidenbac...
Abstract. The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of unsatisfiability. We present independent reconstruction of these proofs in the theorem provers...
Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...