Equivalence is in the Eye of the Beholder

Simple item page
dc.creatorGurevich, Yuri
dc.creatorHuggins, James K.
dc.date1998-10-26
dc.date.accessioned2026-07-07T03:23:46Z
dc.date.available2026-07-07T03:23:46Z
dc.descriptionIn a recent provocative paper, Lamport points out "the insubstantiality of processes" by proving the equivalence of two different decompositions of the same intuitive algorithm by means of temporal formulas. We point out that the correct equivalence of algorithms is itself in the eye of the beholder. We discuss a number of related issues and, in particular, whether algorithms can be proved equivalent directly.
dc.descriptionSee also the ASM web site at http://www.eecs.umich.edu/gasm/
dc.identifierhttps://arxiv.org/abs/cs/9810023
dc.identifierhttp://arxiv.org/abs/cs/9810023
dc.identifierTheoretical Computer Science (179) 1-2 (1997), 353-380
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/33070
dc.subjectSoftware Engineering
dc.subjectD.2.4
dc.titleEquivalence is in the Eye of the Beholder
dc.typetext

Files

Collections

arXiv