Fioravanti, Fabio and Pettorossi, Alberto and Proietti, Maurizio and Senni, Valerio Proving theorems by program transformation. Fundamenta Informaticae, 127 (14). pp. 115134. ISSN 18758681 (2013)

PDF
Download (187kB)  Preview 
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.
Item Type:  Article 

Identification Number:  10.3233/FI2013899 
Uncontrolled Keywords:  Automated theorem proving, program transformation, constraint logic programming, program specialization, bisimilarity, quantifier elimination, temporal logics. 
Subjects:  Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software 
Research Area:  Computer Science and Applications 
Depositing User:  Users 40 not found. 
Date Deposited:  14 Oct 2013 08:29 
Last Modified:  21 Jan 2014 13:19 
URI:  http://eprints.imtlucca.it/id/eprint/1832 
Actions (login required)
Edit Item 