TY  - CHAP
N1  - 26th Italian Conference on Computational Logic, Pescara, Italy, August 31 - September 2, 2011
UR  - http://ceur-ws.org/Vol-810/paper-l11.pdf
N2  - We present some extensions of a method for verifying safety
properties of infinite state reactive systems. Safety properties are specified by constraint logic programs encoding (backward or forward) reachability algorithms. These programs are 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). In particular, we present a specialization
strategy which is more general than previous proposals and we show, through some experiments performed on several infinite state reactive systems, that by using the specialized reachability programs obtained by our new strategy, we considerably increase the number of successful
verifications. Then we show that the specialization time, the size of the specialized program, and the number of successful verifications may vary, depending on the polyvariance introduced by the specialization, that is,
the set of specialized predicates which have been introduced. Finally, we propose a general framework for controlling polyvariance and we use our set of examples of infinite state reactive systems to compare in an experimental way various control strategies one may apply in practice.
AV  - none
ID  - eprints1354
TI  - Controlling Polyvariance for Specialization-based Verification
Y1  - 2011///
T3  - CEUR Workshop Proceedings
SP  - 179
T2  - (ed. by F. Fioravanti) Proceedings of the 26th Italian Conference on Computational Logic (CILC'11)
A1  - Fioravanti, Fabio
A1  - Pettorossi, Alberto
A1  - Proietti, Maurizio
A1  - Senni, Valerio
EP  - 197
PB  - CEUR Workshop Proceedings
ER  -