eprintid: 1619
rev_number: 11
eprint_status: archive
userid: 40
dir: disk0/00/00/16/19
datestamp: 2013-10-14 08:31:48
lastmod: 2013-10-14 08:31:48
status_changed: 2013-10-14 08:31:48
type: article
metadata_visibility: show
contact_email: valerio.senni@imtlucca.it
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: Controlling Polyvariance for Specialization-based Verification
ispublished: pub
subjects: QA75
subjects: QA76
divisions: CSA
full_text_status: none
keywords: Program specialization, constraint logic programming, polyvariance, generalization, verification of infinite state reactive systems, unfold/fold transformation
abstract: 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.
date: 2013
date_type: published
publication: Fundamenta Informaticae
volume: 124
number: 4
publisher: IOS Press
pagerange: 483-502
id_number: 10.3233/FI-2013-845
institution: IMT Institute for Advanced Studies Lucca
refereed: TRUE
issn: 1875-8681
official_url: http://iospress.metapress.com/content/e1uu330492641pk4/fulltext.pdf
citation:   Fioravanti, Fabio and Pettorossi, Alberto and Proietti, Maurizio and Senni, Valerio  Controlling Polyvariance for Specialization-based Verification.  Fundamenta Informaticae, 124 (4).  pp. 483-502.  ISSN 1875-8681      (2013)