relation: http://eprints.imtlucca.it/1832/
title: Proving theorems by program transformation
creator: Fioravanti, Fabio
creator: Pettorossi, Alberto
creator: Proietti, Maurizio
creator: Senni, Valerio
subject: QA75 Electronic computers. Computer science
subject: QA76 Computer software
description: 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.
publisher: IOS Press
date: 2013
type: Article
type: PeerReviewed
format: application/pdf
language: en
identifier: http://eprints.imtlucca.it/1832/1/Fiorav-Senni.pdf
identifier:   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)  
relation: http://iospress.metapress.com/content/0480055u62738804/?p=3456de1a2cbc47178e8f67e94b991d32&pi=0
relation: 10.3233/FI-2013-899