Algebraic Specification of Distributed Systems based on Concurrent Object-Oriented Modeling
We propose a new executable algebraic specification method for object-oriented concurrent and distributed systems. We formalize a concurrent object-oriented model that can explicitly handle communication networks. In this model, a system is described as a collection of primitive objects and network objects. We use the algebraic specification language CafeOBJ[Futatsugi and Sawada 1995] [Sawada and Futatsugi 1995] for describing specifications. Since specifications using our method can be executed, the CafeOBJ processor aids semi-automatic verifications. We illustrate some actual verifications via an example.
KeywordsFormal Method Algebraic Specifications Concurrent Object-Oriented Model Concurrent and Distributed Systems
Unable to display preview. Download preview PDF.
- Gul A. Agha. ACTORS: A Model of Concurrent Computation in Distributed Systems. The MIT Press, 1986.Google Scholar
- Kokichi Futatsugi Trends in formal specification methods based on algebraic specification techniques — from abstract data types to software processes: A personal perspective —. In Proceedings of the International Conference of Information Technology to Commemorating the 30th Anniversary of the Information Processing Society of Japan (Info Japan 80), pages 59–66, October 1990.Google Scholar
- Kokichi Futatsugi, Joseph Goguen, Jean-Pierre Jouannaud, and José Meseguer. Principles of OBJ2. In Proceedings of the 12th ACM Symposium on Principles of Programming Languages, pages 52–66. ACM, 1985.Google Scholar
- Kokichi Futatsugi and Toshimi Sawada. Design considerations for Cafe specification environment. In The 10th Anniversary of OBJ2, October 1995.Google Scholar
- Joseph Goguen, Timothy Winkler, José Mesegure, Kokichi Fututsugi, and Jean-Pierre Jouannaud. Introducing OBJ. Technical report, SRI International, Computer Science Laboratory, 1993.Google Scholar
- Nancy A. Lynch and Mark R. Tuttle. Hierarchical correctness proofs for distrubuted algorithms. In F.B. Schneider, editor, Sixth ACM Annual Symposium on Principles of Distributed Computing, 1987.Google Scholar
- Michael Merritt. Completeness theorems for automata. In REX Workshop on Stepwise Refinement. Springer-Verlag, 1989. LNCS Number 430.Google Scholar
- José Meseguer. A logical theory of concurrent objects. In ECOOP-OOPSLA’90 Conference on Object-Oriented Programming, pages 101–115. ACM, 1990.Google Scholar
- José Meseguer. A logical theory of concurrent objects and its realization in the Maude language. In Gul Agha, Peter Wegner, and Akinori Yonezawa, editors, Research Directions in Concurrent Object-Oriented Programming. The MIT Press, 1993.Google Scholar
- José Meseguer, Kokichi Futatsugi, and Timothy Winkler. Using rewriting logic to specify, program, integrate, and reuse open concurrent systems of cooperating agents. Technical report, SRI International, Computer Science Laboratory, September 1992. also In Proc. of IMSA 92 International Symposium on New Models for Software Architecture, Tokyo, October 1992.Google Scholar
- Toshimi Sawada and Kokichi Futatsugi. Basic features of CHAOS specification kernel language. In The 10th Anniversary of OBJ2, October 1995.Google Scholar
- William E. Weihl. Specifications of concurrent and distributed systems. In Shape Mullender, editor, DISTRIBUTED SYSTEMS, chapter 3, pages 27–53. ACM PRESS, ADDISON-WESLEY, second edition, 1993.Google Scholar