Verification of Parameterized Systems Using Logic Program Transformations

Abstract

Abstract. We show how the problem of verifying parameterized systems can be reduced to the problem of determining the equivalence of goals in a logic program. We further show how goal equivalences can be established using induction-based proofs. Such proofs rely on a powerful new theory of logic program transformations (encompassing unfold, fold and goal replacement over multiple recursive clauses), can be highly automated, and are applicable to a variety of network topologies, including uni-and bi-directional chains, rings, and trees of processes. Unfold transformations in our system correspond to algorithmic model-checking steps, fold and goal replacement correspond to deductive steps, and all three types of transformations can be arbitrarily interleaved within a proof. Our framework thus provides a seamless integration of algorithmic and deductive verification at fine levels of granularity.

Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation

“…Another approach based on program transformation for verifying parameterized (and, hence, infinite state) systems has been presented in [35]. It is an approach based on unfold/fold transformations which are more general than the ones used by us.…”

“…It is an approach based on unfold/fold transformations which are more general than the ones used by us. However, the strategy for guiding the unfold/fold rules proposed in [35] works in fully automatic mode in a small set of examples only.…”

“…This is due to the limited ability of these proof procedures to cope with infinitely failed derivations. For this reason, instead of simply applying program evaluation, many logic programming-based verification systems make use of reasoning techniques such as: (i) abstract interpretation [4,14] and (ii) program transformation [16,26,28,31,35].…”

Model checking the Java metalocking algorithm

“…As future work, we intend to apply the technique of [8] for verifying parametereized sytems to attain a general correctness proof of the metalocking algorithm, i.e., for any Å and AE .…”

Improving Reachability Analysis of Infinite State Systems by Specialization

“…Also transformation techniques for constraint logic programs have been shown to be useful for the verification of infinite state systems [12,13,21,23,24]. In the approach presented in this paper, constraint logic programs provide as an intermediate representation of the systems to be verified so that one can easily specialize those systems.…”