Transformational Verification of Parameterized Protocols Using Array Formulas

Abstract

Abstract. We propose a method for the speci cation and the automated veri cation of temporal properties of parameterized protocols. Our method is based on logic programming and program transformation. We specify the properties of parameterized protocols by using an extension of strati ed logic programs. This extension allows premises of clauses to contain rst order formulas over arrays of parameterized length. A property of a given protocol is proved by applying suitable unfold/fold transformations to the speci cation of that protocol. We demonstrate our method by proving that the parameterized Peterson's protocol among N processes, for any N ≥ 2, ensures the mutual exclusion property.

Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming

“…partial evaluation) is another example of techniques that can be used to automatically control the abstraction required for infinitestate model checking [54,52,53]. In [29,62] program transformation techniques combined with specialized decision procedures are used to verify temporal properties of infinite-state systems.…”