A language-independent proof system for full program equivalence

Two programs are fully equivalent if, for the same input, either they both diverge or they both terminate with the same result. Full 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 p...

Full description

Saved in:

Bibliographic Details
Published in:	Formal aspects of computing Vol. 28; no. 3; pp. 469 - 497
Main Authors:	Ciobâcă, Ştefan, Lucanu, Dorel, Rusu, Vlad, Roşu, Grigore
Format:	Journal Article
Language:	English
Published:	London Springer London 01.05.2016 Association for Computing Machinery Springer Verlag
Subjects:	Compilers Computer Science Equivalence Languages Logic in Computer Science Math Applications in Computer Science Original Article Programming Languages Proving Semantics Sequences Sound Theory of Computation Transformations Program equivalence Matching logic Programming language aggregation Programming language semantics Full equivalence
ISSN:	0934-5043, 1433-299X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!