eprintid: 1832
rev_number: 11
eprint_status: archive
userid: 40
dir: disk0/00/00/18/32
datestamp: 2013-10-14 08:29:30
lastmod: 2014-01-21 13:19:07
status_changed: 2013-10-14 08:29:30
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: Proving theorems by program transformation
ispublished: pub
subjects: QA75
subjects: QA76
divisions: CSA
full_text_status: public
keywords: Automated theorem proving, program transformation, constraint logic programming, program specialization, bisimilarity, quantifier elimination, temporal logics.
abstract: In this paper we present an overview of the unfold/fold proof method, a method for proving theorems about programs, based on program transformation. As a metalanguage for specifying programs and program properties we adopt constraint logic programming (CLP), and we present a set of transformation rules (including the familiar unfolding and folding rules) which preserve the semantics of CLP programs. Then, we show how program transformation strategies can be used, similarly to theorem proving tactics, for guiding the application of the transformation rules and inferring the properties to be proved. We work out three examples: (i) the proof of predicate equivalences, applied to the verification of equality between CCS processes, (ii) the proof of first order formulas via an extension of the quantifier elimination method, and (iii) the proof of temporal properties of infinite state concurrent systems, by using a transformation strategy that performs program specialization.
date: 2013
date_type: completed
publication: Fundamenta Informaticae
volume: 127
number: 1-4
publisher: IOS Press
pagerange: 115-134
id_number: 10.3233/FI-2013-899
refereed: TRUE
issn: 1875-8681
official_url: http://iospress.metapress.com/content/0480055u62738804/?p=3456de1a2cbc47178e8f67e94b991d32&pi=0
citation:   Fioravanti, Fabio and Pettorossi, Alberto and Proietti, Maurizio and Senni, Valerio  Proving theorems by program transformation.  Fundamenta Informaticae, 127 (1-4).  pp. 115-134.  ISSN 1875-8681      (2013)  
document_url: http://eprints.imtlucca.it/1832/1/Fiorav-Senni.pdf