eprintid: 1349
rev_number: 14
eprint_status: archive
userid: 40
dir: disk0/00/00/13/49
datestamp: 2012-09-14 14:53:15
lastmod: 2013-06-20 10:52:52
status_changed: 2013-06-20 10:35:48
type: article
metadata_visibility: show
creators_name: Fioravanti, Fabio
creators_name: Pettorossi, Alberto
creators_name: Proietti, Maurizio
creators_name: Senni, Valerio
creators_id: 
creators_id: 
creators_id: 
creators_id: valerio.senni@imtlucca.it
title: Generalization strategies for the verification of infinite state systems
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
keywords: computational tree logic; constraint logic programs; generalization strategies; infinite state systems; program specialization; program verification
note: Special Issue 02 (25th Annual GULP Conference)
abstract: We present a method for the automated verification of temporal properties of infinite state systems. Our verification method is based on the specialization of constraint logic programs (CLP) and works in two phases: (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. The effectiveness of the method strongly depends on the generalization strategy which is applied during the program specialization phase. We consider several generalization strategies obtained by combining techniques already known in the field of program analysis and program transformation, and we also introduce some new strategies. Then, through many verification experiments, we evaluate the effectiveness of the generalization strategies we have considered. Finally, we compare the implementation of our specialization-based verification method to other constraint-based model checking tools. The experimental results show that our method is competitive with the methods used by those other tools.
date: 2013-03
date_type: published
publication: Theory and Practice of Logic Programming
volume: 13
number: 2
publisher: Cambridge University Press
pagerange: 175-199
id_number: 10.1017/S1471068411000627
refereed: TRUE
issn: 1471-0684
official_url: http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=8852332
citation:   Fioravanti, Fabio and Pettorossi, Alberto and Proietti, Maurizio and Senni, Valerio  Generalization strategies for the verification of infinite state systems.  Theory and Practice of Logic Programming, 13 (2).  pp. 175-199.  ISSN 1471-0684      (2013)