We describe a tool called CVC Lite (CVCL), an automated theorem prover for formulas in a
union of first-order theories. CVCL supports a set of theories which are useful in verification …

Decision procedures for decidable logics and logical theories have proven to be useful tools
in verification. This paper describes the CVC (“Cooperating Validity Checker”) decision …

PVS is a prototype system for writing specifications and constructing proofs. Its development
has been shaped by our experiences studying or using several other systems 1 and …

ACL2 is a theorem proving system under development at Computational Logic, Inc., by the
authors of the Boyer-Moore system, Nqthm, and its interactive enhancement, Pc-Nqthm …

Decision procedures are at the core of many industrial-strength verification systems such as
ACL2 [KM97], PVS [ORS92], or STeP [MtSg96]. Effective use of decision procedures in these …

Many verification problems reduce to proving the validity of formulas involving both
propositional connectives and domain-specific functions and predicates. This paper …

Experience has shown that large or multi-user interactive proof efforts can benefit
significantly from structuring mechanisms, much like those available in many modern …

Interactive proof assistants should verify the proofs they receive from automatic theorem
provers. Normally this proof reconstruction takes place internally, forming part of the …

Current automatic theorem provers, particularly those based on some variant of resolution,
have concentrated on obtaining ever higher inference rates by using clever programming …

In this paper we give a short introduction in first-order theorem proving and the use of the
theorem prover Vampire. We discuss the superposition calculus and explain the key …