Affiliations: University of Chieti-Pescara, Viale Pindaro 42, 65127 Pescara, Italy, [email protected] | University of Rome Tor Vergata, Via del Politecnico 1, 00133 Rome, Italy, [email protected] | IASI-CNR, Viale Manzoni 30, 00185 Rome, Italy, [email protected] | University of Rome Tor Vergata, Via del Politecnico 1, 00133 Rome, Italy, [email protected]
Note: [] Address for correspondence: Department of Sciences, University of Chieti-Pescara, Viale Pindaro 42, 65127 Pescara, Italy
Abstract: We consider infinite state reactive systems specified by using linear constraints over the integers, and we address the problem of verifying safety properties of these systems by applying reachability analysis techniques. We propose a method based on program specialization, which improves the effectiveness of the backward and forward reachability analyses. For backward reachability our method consists in: (i) specializing the reactive system with respect to the initial states, and then (ii) applying to the specialized system the reachability analysis that works backwards from the unsafe states. For reasons of efficiency, during specialization we make use of a relaxation from integers to reals. In particular, we test the satisfiability or entailment of constraints over the real numbers, while preserving the reachability properties of the reactive systems when constraints are interpreted over the integers. For forward reachability our method works as for backward reachability, except that the role of the initial states and the unsafe states are interchanged. We have implemented our method using the MAP transformation system and the ALV verification system. Through various experiments performed on several infinite state systems, we have shown that our specialization-based verification technique considerably increases the number of successful verifications without a significant degradation of the time performance.
Keywords: Reachability analysis, automatic verification, program transformation, constraint logic programming
