Journal ArticleDOI
Reachability analysis in verification via supercompilation
TLDR
It is shown that reachability analysis performed by supercompilation can be seen as the proof of a correctness condition by induction.Abstract:
We present an approach to verification of parameterized systems, which is based on program transformation technique known as supercompilation. In this approach the statements about safety properties of a system to be verified are translated into the statements about properties of the program that simulates and tests the system. Supercompilation is used then to establish the required properties of the program. In this paper we show that reachability analysis performed by supercompilation can be seen as the proof of a correctness condition by induction. We formulate suitable induction principles and proof strategies and illustrate their use by examples of verification of parameterized protocols.read more
Citations
More filters
Book ChapterDOI
Proving the equivalence of higher-order terms by means of supercompilation
TL;DR: This paper presents another approach to proving term equivalence by means of supercompilation for a higher-order lazy functional language and may lead to the development of a more powerful “higher-level” supercompiler.
Journal ArticleDOI
Proving Correctness of Imperative Programs by Linearizing Constrained Horn Clauses
TL;DR: A method for verifying the correctness of imperative programs which is based on the automated transformation of their specifications, and it is shown that several specifications that could not be proved valid by LA-solving methods, can be provedvalid after linearization.
Journal ArticleDOI
Monotonic abstraction: on efficient verification of parameterized systems
TL;DR: The simple and efficient method of monotonic abstraction is introduced to prove safety properties for parameterized systems with linear topologies and its application to finite-state automato systems is explained.
Proceedings ArticleDOI
Constraint Specialisation in Horn Clause Verification
TL;DR: This work uses abstract interpretation to compute a model of a query-answer transformation of a given set of clauses and a goal, which is to propagate the constraints from the goal top-down and propagate answer constraints bottom-up.
Journal ArticleDOI
Constraint specialisation in Horn clause verification
TL;DR: A method for specialising the constraints in constrained Horn clauses with respect to a goal by using abstract interpretation to compute a model of a query–answer transformed version of a given set of clauses and a goal.
References
More filters
Model checking
TL;DR: Model checking tools, created by both academic and industrial teams, have resulted in an entirely novel approach to verification and test case generation that often enables engineers in the electronics industry to design complex systems with considerable assurance regarding the correctness of their initial designs.
Book
Partial evaluation and automatic program generation
TL;DR: This paper presents a guide to the literature the self-applicable scheme specializer, a partial evaluator for a subset of scheme for a first-order functional languages.
Journal ArticleDOI
Deforestation: transforming programs to eliminate trees
TL;DR: The algorithm applies to any term containing only functions with definitions in a given syntactic form, and is suitable for incorporation in an optimizing compiler.