%0 Journal Article
%@ 1875-8681
%A Fioravanti, Fabio
%A Pettorossi, Alberto
%A Proietti, Maurizio
%A Senni, Valerio
%D 2013
%F eprints:1832
%I IOS Press
%J Fundamenta Informaticae
%K Automated theorem proving, program transformation, constraint logic programming, program specialization, bisimilarity, quantifier elimination, temporal logics.
%N 1-4
%P 115-134
%T Proving theorems by program transformation
%U http://eprints.imtlucca.it/1832/
%V 127
%X 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.