CADE
2007
Springer
14 years 5 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
In this paper, a proof assistant, called SAD, is presented. SAD deals with mathematical texts that are formalized in the ForTheL language (brief description of which is also given)...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Inductive definitions and rule inductions are two fundamental reasoning tools in logic and computer science. When inductive definitions involve binders, then Barendregt&#...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
The E-KRHyper system is a model generator and theorem prover for first-order logic with equality. It implements the new E-hyper tableau calculus, which integrates a superposition-b...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
CADE
2007
Springer
14 years 5 months ago
2007
Springer
We bring together two recent trends in description logic (DL): lightweight DLs in which the subsumption problem is tractable and conservative extensions as a central tool for forma...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
We add labels to first-order clauses to simultaneously apply superpositions to several proof obligations inside one clause set. From a theoretical perspective, the approach unifies...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We present KeY-C, a tool for deductive verification of C programs. KeY-C allows to prove partial correctness of C programs relative to pre- and postconditions. It is base...
CADE
2008
Springer
14 years 5 months ago
2008
Springer
Specifications of programs use auxiliary symbols to encapsulate concepts for a variety of reasons: readability, reusability, structuring and, in particular, for writing recursive d...
CADE
2008
Springer
14 years 5 months ago
2008
Springer