Equivalence is in the Eye of the Beholder

James Huggins; Yuri Guravich

doi:10.1016/S0304-3975(96)00315-5

Equivalence is in the Eye of the Beholder

James Huggins
, Yuri Guravich

Kettering University

Research output: Contribution to journal › Article › peer-review

Abstract

In a recent provocative paper, Lamport points out “the insubstantiality of processess” 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.

Original language	American English
Journal	Theoretical Computer Science
Volume	179
DOIs	https://doi.org/10.1016/S0304-3975(96)00315-5
State	Published - Jun 1 1997

Keywords

Eveloving Algebras
Specification
Verification
Formal Methods
Distributed Algorithms

Disciplines

Computer Sciences
Theory and Algorithms

Access to Document

10.1016/S0304-3975(96)00315-5License: CC BY

https://www.sciencedirect.com/science/article/pii/S0304397596003155

Cite this

@article{d0165b458a554e149fa417642b32057b,

title = "Equivalence is in the Eye of the Beholder",

abstract = " In a recent provocative paper, Lamport points out “the insubstantiality of processess” 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.",

keywords = "Eveloving Algebras, Specification, Verification, Formal Methods, Distributed Algorithms",

author = "James Huggins and Yuri Guravich",

year = "1997",

month = jun,

day = "1",

doi = "10.1016/S0304-3975(96)00315-5",

language = "American English",

volume = "179",

journal = "Theoretical Computer Science",

}

TY - JOUR

T1 - Equivalence is in the Eye of the Beholder

AU - Huggins, James

AU - Guravich, Yuri

PY - 1997/6/1

Y1 - 1997/6/1

N2 - In a recent provocative paper, Lamport points out “the insubstantiality of processess” 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.

AB - In a recent provocative paper, Lamport points out “the insubstantiality of processess” 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.

KW - Eveloving Algebras

KW - Specification

KW - Verification

KW - Formal Methods

KW - Distributed Algorithms

UR - https://digitalcommons.kettering.edu/computerscience_facultypubs/9

UR - https://www.sciencedirect.com/science/article/pii/S0304397596003155

U2 - 10.1016/S0304-3975(96)00315-5

DO - 10.1016/S0304-3975(96)00315-5

M3 - Article

VL - 179

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

Equivalence is in the Eye of the Beholder

Abstract

Keywords

Disciplines

Access to Document

Other files and links

Cite this