4573 search results - page 473 / 915 » Automated Reasoning |
138
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Bit vectors and bit operations are proposed for efficient propositional inference. Bit arithmetic has efficient software and hardware implementations, which can be put to advantage...
134
click to vote
CADE
2007
Springer
16 years 6 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...
158
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
In this paper we propose a method for inferring invariants for loops in Java programs. An example of a simple while loop is used throughout the paper to explain our approach. The m...
159
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
Abstract. We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus ...
158
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
We present a resolution-based decision procedure for the description logic SHOIQ--the logic underlying the Semantic Web ontology language OWL-DL. Our procedure is goal-oriented, an...