Abstract. We prove several results related to local proofs, interpolation and suion calculus and discuss their use in predicate abstraction and invariant generation. Our proofs and...
Abstract. This paper presents verified quantifier elimination procedures for dense linear orders (DLO), for real and for integer linear arithmetic. The DLO procedures are new. All ...
We present a verified enumeration of tame graphs as defined in Hales' proof of the Kepler Conjecture and confirm the completeness of Hales' list of all tame graphs while ...
One of the keys to the success of the TPTP and related projects is their consistent use of the TPTP language. The ability of the TPTP language to express solutions as well as probl...
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Al...
Abstract. Basically, the connection of two many-sorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must...