Sciweavers

CADE
2007
Springer
14 years 11 months ago
Inferring Invariants by Symbolic Execution
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...
Benjamin Weiß, Peter H. Schmitt
CADE
2007
Springer
14 years 11 months ago
Combining Deduction and Algebraic Constraints for Hybrid System Analysis
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...
André Platzer
CADE
2007
Springer
14 years 11 months ago
ALICE: An Advanced Logic for Interactive Component Engineering
This paper presents an overview of the verication framework ALICE in its current version 0.7. It is based on the generic theorem prover Isabelle [Pau03a]. Within ALICE a software o...
Borislav Gajanovic, Bernhard Rumpe
CADE
2007
Springer
14 years 11 months ago
A History-based Verification of Distributed Applications
Safety and security guarantees for individual applications in general depend on assumptions on the given context provided by distributed instances of operating systems, hardware pl...
Bruno Langenstein, Andreas Nonnengart, Georg Rock,...
CADE
2007
Springer
14 years 11 months ago
Formal Device and Programming Model for a Serial Interface
Abstract. The verification of device drivers is essential for the pervasive verification of an operating system. To show the correctness of device drivers, devices have to be forma...
Eyad Alkassar, Mark A. Hillebrand, Steffen Knapp, ...
CADE
2007
Springer
14 years 11 months ago
A Termination Checker for Isabelle Hoare Logic
Abstract. Hoare logic is widely used for software specification and verification. Frequently we need to prove the total correctness of a program: to prove that the program not only...
Jia Meng, Lawrence C. Paulson, Gerwin Klein
CADE
2007
Springer
14 years 11 months ago
MaLARea: a Metasystem for Automated Reasoning in Large Theories
MaLARea (a Machine Learner for Automated Reasoning) is a simple metasystem iteratively combining deductive Automated Reasoning tools (now the E and the SPASS ATP systems) with a m...
Josef Urban
CADE
2007
Springer
14 years 11 months ago
First Order Reasoning on a Large Ontology
We present results of our work on using first order theorem proving to reason over a large ontology (the Suggested Upper Merged Ontology ? SUMO), and methods for making SUMO suita...
Adam Pease, Geoff Sutcliffe
CADE
2007
Springer
14 years 11 months ago
Certified Size-Change Termination
We develop a formalization of the Size-Change Principle in Isabelle/HOL and use it to construct formally certified termination proofs for recursive functions automatically.
Alexander Krauss