A Language-Independent Proof System for ...
Type de document :
Article dans une revue scientifique: Article original
Titre :
A Language-Independent Proof System for Full Program Equivalence
Auteur(s) :
Ciobaca, Stefan [Auteur]
Department of Computer Science [Lasi]
Lucanu, Dorel [Auteur]
Department of Computer Science [Lasi]
Rusu, Vlad [Auteur]
Dynamic Reconfigurable Massively Parallel Architectures and Languages [DREAMPAL]
Rosu, Grigore [Auteur]
University of Illinois at Urbana-Champaign [Urbana] [UIUC]
Department of Computer Science [Lasi]
Lucanu, Dorel [Auteur]
Department of Computer Science [Lasi]
Rusu, Vlad [Auteur]

Dynamic Reconfigurable Massively Parallel Architectures and Languages [DREAMPAL]
Rosu, Grigore [Auteur]
University of Illinois at Urbana-Champaign [Urbana] [UIUC]
Titre de la revue :
Formal Aspects of Computing
Pagination :
469--497
Éditeur :
Springer Verlag
Date de publication :
2016
ISSN :
0934-5043
Discipline(s) HAL :
Informatique [cs]/Logique en informatique [cs.LO]
Informatique [cs]/Langage de programmation [cs.PL]
Informatique [cs]/Langage de programmation [cs.PL]
Résumé en anglais : [en]
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 ...
Lire la suite >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).Lire moins >
Lire la suite >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).Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.inria.fr/hal-01245528v2/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01245528v2/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01245528v2/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- icfem-postproceedings-final-version.pdf
- Accès libre
- Accéder au document