Program Equivalence by Circular Reasoning - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Formal Aspects of Computing Year : 2015

Program Equivalence by Circular Reasoning


We propose a logic and a deductive system for stating and automatically proving the equivalence of programs written in languages having a rewriting-based operational semantics. The chosen equivalence is parametric in a so-called observation relation, and it says that two programs satisfying the observation relation will inevitably be, in the future, in the observation relation again. This notion of equivalence generalises several well-known equivalences and is appropriate for deterministic (or, at least, for confluent) programs. The deductive system is circular in nature and is proved sound and weakly complete; together, these results say that, when it terminates, our system correctly solves the given program-equivalence problem. We show that our approach is suitable for proving equivalence for terminating and non-terminating programs as well as for concrete and symbolic programs. The latter are programs in which some statements or expressions are symbolic variables. By proving the equivalence between symbolic programs, one proves the equivalence of (infinitely) many concrete programs obtained by replacing the variables by concrete statements or expressions. The approach is illustrated by proving program equivalence in two languages from different programming paradigms. The examples in the paper, as well as other examples, can be checked using an online tool.
Fichier principal
Vignette du fichier
ifm-faoc.pdf (694.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01065830 , version 1 (18-09-2014)



Dorel Lucanu, Vlad Rusu. Program Equivalence by Circular Reasoning. Formal Aspects of Computing, 2015, 27 (4), pp.701-726. ⟨10.1007/s00165-014-0319-6⟩. ⟨hal-01065830⟩
237 View
187 Download



Gmail Facebook X LinkedIn More