Sciweavers

1410 search results - page 162 / 282
» Proving theorems by reuse
Sort
View
CADE
2009
Springer
16 years 6 months ago
Superposition and Model Evolution Combined
We present a new calculus for first-order theorem proving with equality, ME+Sup, which generalizes both the Superposition calculus and the Model Evolution calculus (with equality)...
Peter Baumgartner, Uwe Waldmann
PODC
2009
ACM
16 years 6 months ago
Brief announcement: self-assembly as graph grammar as distributed system
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
Aaron Sterling
CADE
2007
Springer
16 years 6 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
2003
Springer
16 years 6 months ago
A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae
In this paper we present a translation principle, called the axiomatic translation, for reducing propositional modal logics with background theories, including triangular propertie...
Renate A. Schmidt, Ullrich Hustadt
ICSE
2005
IEEE-ACM
16 years 6 months ago
Check 'n' crash: combining static checking and testing
We present an automatic error-detection approach that combines static checking and concrete test-case generation. Our approach consists of taking the abstract error conditions inf...
Christoph Csallner, Yannis Smaragdakis