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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Formal aspects of computing Ročník 28; číslo 3; s. 469 - 497
Hlavní autori:	Ciobâcă, Ştefan, Lucanu, Dorel, Rusu, Vlad, Roşu, Grigore
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Springer London 01.05.2016 Association for Computing Machinery Springer Verlag
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!