Abstract. We address the problem of the automated verification of temporal properties of infinite state reactive systems. We present some improvements of a verification method based on the specialization of constraint logic programs (CLP). First, we reformulate the verification method as a two-phase procedure: (1) in the first phase a CLP specification of an infinite state system is specialized with respect to the initial state of the system and the temporal property to be verified, and (2) in the second phase the specialized program is evaluated by using a bottom-up strategy. In this paper we propose some new strategies for performing program specialization during the first phase. We evaluate the effectiveness of these new strategies, as well as that of some old strategies, by presenting the results of experiments performed on several infinite state systems and temporal properties. Finally, we compare the implementation of our specialization-based verification method with various constraint-based model checking tools. The experimental results show that our method is effective and competitive with respect to the methods used in those other tools.
It has been shown in REF that properties of infinite state reactive systems can be verified by first (1) specializing the program that encodes the properties of the system with respect to the property of interest, and then (2) constructing the perfect model of the specialized program by the standard bottom-up procedure based on the evaluation of the immediate consequence operator.
Program specialization for verifying infinite state systems: An experimental evaluation
In LOPSTR’10
Computer Science