46 search results - page 3 / 10 » cade 2007 |
CADE
2007
Springer
14 years 5 months ago
2007
Springer
This paper describes the design, implementation, and testing of a system for selecting necessary axioms from a large set also containing superfluous axioms, to obtain a proof of a...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
We show how theorem proving and methods for handling real algebraic constraints can be combined for hybrid system verification. In particular, we highlight the interaction of deduc...
CADE
2007
Springer
14 years 5 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...
CADE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail ...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices ? a class of...