Last update: Sun Aug 5 02:03:07 MDT 2018
@Article{Goguen:2000:HAC,
author = "Joseph Goguen",
title = "Hidden algebra and concurrent distributed software",
journal = j-SIGSOFT,
volume = "25",
number = "1",
pages = "51--52",
month = jan,
year = "2000",
CODEN = "SFENDP",
DOI = "https://doi.org/10.1145/340855.340889",
ISSN = "0163-5948 (print), 1943-5843 (electronic)",
ISSN-L = "0163-5948",
bibdate = "Wed Aug 1 17:13:50 MDT 2018",
bibsource = "http://www.math.utah.edu/pub/tex/bib/sigsoft2000.bib",
abstract = "Cleverly designed software often fails to strictly
satisfy its specifications, but instead satisfies them
behaviorally, in the sense that they appear to be true
under all possible experiments. Hidden algebra extends
prior work on abstract data types and algebraic
specification [2, 6] to concurrent distributed systems,
in a surprisingly simple way that also handles
nondeterminism, internal states, and more [4, 3].
Advantages of an algebraic approach include
decidability results for problems that are undecidable
for more expressive logics, and powerful algorithms
like term rewriting and unification, for implementing
equational logic tools. Much work in formal methods has
addressed code verification, but since empirical
studies show that little of software cost comes from
coding errors, our approach focuses on behavioral
specification and verification at the design level,
thus avoiding the distracting complications of
programming language semantics.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGSOFT Software Engineering Notes",
journal-URL = "https://dl.acm.org/citation.cfm?id=J728",
}