Sciweavers

ETRICS
2006
13 years 8 months ago
Allowing State Changes in Specifications
Abstract. We provide a static analysis (using both dataflow analysis and theorem proving) to allow state changes within specifications. This can be used for specification languages...
Michael Barnett, David A. Naumann, Wolfram Schulte...
ATVA
2004
Springer
138views Hardware» more  ATVA 2004»
13 years 8 months ago
Providing Automated Verification in HOL Using MDGs
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
Tarek Mhamdi, Sofiène Tahar
ITP
2010
140views Mathematics» more  ITP 2010»
13 years 8 months ago
Case-Analysis for Rippling and Inductive Proof
Abstract. Rippling is a heuristic used to guide rewriting and is typically used for inductive theorem proving. We introduce a method to support case-analysis within rippling. Like ...
Moa Johansson, Lucas Dixon, Alan Bundy
PPCP
1993
13 years 8 months ago
Higher-Order Logic Programming as Constraint Logic Programming
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
Spiro Michaylov, Frank Pfenning
HICSS
1994
IEEE
105views Biometrics» more  HICSS 1994»
13 years 8 months ago
A Methodology for Equational Reasoning
1 This paper presents a methodology to guide equational reasoning in a goal directed way. Suggested by rippling methods developed in the eld of inductive theorem proving we use att...
Jürgen Cleve, Dieter Hutter
LOPSTR
1997
Springer
13 years 8 months ago
A Multi-level Approach to Program Synthesis
Abstract. We present an approach to a coherent program synthesis system which integrates a variety of interactively controlled and automated techniques from theorem proving and alg...
Wolfgang Bibel, Daniel S. Korn, Christoph Kreitz, ...
ECP
1997
Springer
102views Robotics» more  ECP 1997»
13 years 8 months ago
Event Calculus Planning Revisited
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
Murray Shanahan
TPHOL
1997
IEEE
13 years 8 months ago
An Isabelle-Based Theorem Prover for VDM-SL
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...
Sten Agerholm, Jacob Frost
TPHOL
1999
IEEE
13 years 8 months ago
Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
Mark Aagaard, Robert B. Jones, Carl-Johan H. Seger
GI
2001
Springer
13 years 9 months ago
Formal Analysis of a Self-Stabilizing Algorithm Using Predicate Diagrams
We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized base...
Dominique Cansell, Dominique Méry, Stephan ...