CADE
2001
Springer
14 years 11 months ago
2001
Springer
RACER implements a TBox and ABox reasoner for the logic SHIQ. RACER was the first full-fledged ABox description logic system for a very expressive logic and is based on optimized s...
CADE
2001
Springer
14 years 11 months ago
2001
Springer
Canonical propositional Gentzen-type systems are systems which in addition to the standard axioms and structural rules have only pure logical rules with the subformula property, in...
CADE
2001
Springer
14 years 11 months ago
2001
Springer
The modalities of Dynamic Logic refer to the final state of a program execution and allow to specify programs with pre- and postconditions. In this paper, we extend Dynamic Logic w...
CADE
2001
Springer
14 years 11 months ago
2001
Springer
CADE
2002
Springer
14 years 11 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
CADE
2002
Springer
14 years 11 months ago
2002
Springer
CADE
2002
Springer
14 years 11 months ago
2002
Springer
This paper reports on the formal proof of correctness of a compiler from a substantial subset of Java source language to Java bytecode in the proof environment Isabelle. This work ...
CADE
2002
Springer
14 years 11 months ago
2002
Springer
CADE
2002
Springer
14 years 11 months ago
2002
Springer
Abstract. Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In the original approach to PCC, the safety policy inc...
CADE
2002
Springer
14 years 11 months ago
2002
Springer
The reflection theorem has been proved using Isabelle/ZF. This theorem cannot be expressed in ZF, and its proof requires reasoning at the meta-level. There is a particularly elegan...