Joseph Goguen
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.
- {1} Joseph Goguen, Kai Lin, Akira Mori, Grigore Rosu, and Akiyoshi Sato. Distributed cooperative formal methods tools. In Michael Lowry, editor, Proceedings, Automated Software Engineering, pages 55-62. IEEE, 1997. Google Scholar
Digital Library
- {2} Joseph Goguen and Grant Malcolm. Algebraic Semantics of Imperative Programs. MIT, 1996. Google ScholarDigital Library
- {3} Joseph Goguen and Grant Malcolm. Hidden coinduction: Behavioral correctness proofs for objects. Mathematical Structures in Computer Science, 9(3):287-319, June 1999. Google ScholarDigital Library
- {4} Joseph Goguen and Grant Malcolm. A hidden agenda. Theoretical Computer Science, to appear. Also UCSD Dept. Computer Science & Eng. Technical Report CS97-538, May 1997.Google Scholar
- {5} Joseph Goguen and Grigore Rosu. A protocol for distributed cooperative work. In Gheorghe Stefaneseu, editor, Proceedings, FCT'99, Workshop on Distributed Systems, pages 1-22. Elsevier, 1999. (Iasi, Romania). Also, Electronic Lecture Notes in Theoretical Computer Science, Elsevier Volume 28, to appear 1999.Google Scholar
- {6} Joseph Goguen, James Thatcher, and Eric Wagner. An initial algebra approach to the specification, correctness and implementation of abstract data types. In Raymond Yeh, editor, Current Trends in Programming Methodology, IV, pages 80-149. Prentice-Hall, 1978.Google Scholar
- {7} Joseph Goguen, Timothy Winkler, José Meseguer, Kokichi Futatsugi, and Jean-Pierre Jouannaud. Introducing OBJ. In Joseph Goguen and Grant Malcolm, editors, Software Engineering with OBJ: Algebraic Specification in Action. Kluwer, to appear. Also Technical Report SRI-CSL-SS-9, August 1988, SRI International.Google Scholar
- {8} Grigore Rosu. Behavioral coinductive rewriting. In Kokichi Futatsugi, Joseph Goguen, and José Meseguer, editors, OBJ/CafeOBJ/Maude at Formal Methods '99, pages 179-196. Theta (Bucharest), 1999. Proceedings of a workshop in Toulouse, 20 and 22 September 1999.Google Scholar
- {9} Grigore Rosu and Joseph Goguen. Hidden congruent deduction. In Ricardo Caferra and Gernot Salzer, editors, Proceedings, 1998 Workshop on First Order Theorem Proving, pages 213-223. Technische Universität Wien, 1998. Full version to appear, Lecture Notes in Artificial Intelligence, Springer, 1999.Google Scholar
Index Terms
- Hidden algebra and concurrent distributed software
Recommendations
Concurrent Dynamic Algebra
We reconstruct Peleg’s concurrent dynamic logic in the context of modal Kleene algebras. We explore the algebraic structure of its multirelational semantics and develop an axiomatization of concurrent dynamic algebras from that basis. In this context, ...
Concurrent Kleene Algebra
CONCUR 2009: Proceedings of the 20th International Conference on Concurrency TheoryA concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and concurrent composition, related by an inequational form of the exchange law. We show applicability of the algebra to a partially-ordered trace model of ...
Construction of quotient BCI(BCK)-algebra via a fuzzy ideal
The present paper gives a new construction of a quotient BCI(BCK)- algebra X/µ by a fuzzy ideal µ in X and establishes the Fuzzy Homomorphism Fundamental Theorem. We show that if µ is a fuzzy ideal (closed fuzzy ideal) of X. then X/µ is a commutative (...
Comments