A Language-Independent Proof System for Full Program Equivalence - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Formal Aspects of Computing Year : 2016

A Language-Independent Proof System for Full Program Equivalence


Two programs are mutually equivalent if, for the same input, either they both diverge or they both terminate with the same result. Mutual equivalence is an adequate notion of equivalence for programs written in deterministic languages. It is useful in many contexts, such as capturing the correctness of program transformations within the same language, or capturing the correctness of compilers between two different languages. In this paper we introduce a language-independent proof system for mutual equivalence, which is para-metric in the operational semantics of two languages and in a state-similarity relation. The proof system is sound: if it terminates then it establishes the mutual equivalence of the programs given to it as input. We illustrate it on two programs in two different languages (an imperative one and a functional one), that both compute the Collatz sequence. The Collatz sequence is an interesting case study since it is not known wether the sequence terminates or not; nevertheless, our proof system shows that the two programs are mutually equivalent (even if we cannot establish termination or divergence of either one).
Fichier principal
Vignette du fichier
icfem-postproceedings-final-version.pdf (465.27 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01245528 , version 1 (17-12-2015)
hal-01245528 , version 2 (25-01-2016)



Stefan Ciobaca, Dorel Lucanu, Vlad Rusu, Grigore Rosu. A Language-Independent Proof System for Full Program Equivalence. Formal Aspects of Computing, 2016, 28 (3), pp.469--497. ⟨10.1007/s00165-016-0361-7⟩. ⟨hal-01245528v2⟩
162 View
355 Download



Gmail Facebook X LinkedIn More