%V 124
%N 4
%X Program specialization has been proposed as a means of improving constraint-based analysis of infinite state reactive systems. In particular, safety properties can be specified by constraint logic programs encoding (backward or forward) reachability algorithms. These programs are then transformed, before their use for checking safety, by specializing them with respect to the initial states (in the case of backward reachability) or with respect to the unsafe states (in the case of forward reachability). By using the specialized reachability programs, we can considerably increase the number of successful verifications. An important feature of specialization algorithms is the so called polyvariance, that is, the number of specialized variants of the same predicate that are introduced by specialization. Depending on this feature, the specialization time, the size of the specialized program, and the number of successful verifications may vary. We present a specialization framework which is more general than previous proposals and provides control on polyvariance. We demonstrate, through experiments on several infinite state reactive systems, that by a careful choice of the degree of polyvariance we can design specialization-based verification procedures that are both efficient and precise.
%L eprints1619
%K Program specialization, constraint logic programming, polyvariance, generalization, verification of infinite state reactive systems, unfold/fold transformation
%I IOS Press
%D 2013
%A Fabio Fioravanti
%A Alberto Pettorossi
%A Maurizio Proietti
%A Valerio Senni
%R 10.3233/FI-2013-845
%T Controlling Polyvariance for Specialization-based Verification
%J Fundamenta Informaticae
%P 483-502