article

Free access

A logical theory of concurrent objects

Author:

José MeseguerAuthors Info & Claims

ACM SIGPLAN Notices, Volume 25, Issue 10

Pages 101 - 115

https://doi.org/10.1145/97946.97958

Published: 01 September 1990 Publication History

Abstract

A new theory of concurrent objects is presented. The theory has the important advantage of being based directly on a logic called rewriting logic in which concurrent object-oriented computation exactly corresponds to logical deduction. This deduction is performed by concurrent rewriting modulo structural axioms of associativity, commutativity and identity that capture abstractly the essential aspects of communication in a distributed object-oriented configuration made up of concurrent objects and messages. Thanks to this axiomatization, it becomes possible to study the behavior of concurrent objects by formal methods in a logic intrinsic to their computation. The relationship with Actors and with other models of concurrent computation is also discussed. A direct fruit of this theory is a new language, called Maude, to program concurrent object-oriented modules in an entirely declarative way using rewriting logic; modules written in this language are used to illustrate the main ideas with examples. Maude contains OBJ3 as a functional sublanguage and provides a simple and semantically rigorous integration of functional programming and concurrent object-oriented programming.

References

[1]

G. Agha. Actors. MIT Press, 1986.

[2]

G. Agha emrt G. Hewitt. Concurrent programming using actors. In .k. Yonezawa and M. Tokoro, editors, Object- Oriented Concurrent Programming. MIT Press, 1988.

Digital Library

[3]

M. B~-r an:l C. Wells. Toposes, Triples and Theories. Springer-VerIag, 1985.

[4]

G4rarcl Berr~ and G4rard Boudol. The Chemical Abstract Machine. In Proc. POPL'90, pages 81-94. ACM, 1990.

Digital Library

[5]

K. Many Ch.~ndy and Jayadev Misra. Parallel ;Program Design: A Fou~tdation. Addison-Wesley, 1988.

Digital Library

[6]

Will Clinger. Foundations of actor semantics. AI-TR-633, Massachuset Ls Institute of Technology, Artificial Intelligence Laboratory, t981.

Digital Library

[7]

N. Dershowit.z and J.-P. Jouarmaud. Rewrite systems. In Handbook of Theoretical Computer Science, Vol. B. North- Holland, 1990.

Digital Library

[8]

J. Engelfriet Net-based description of parallel object-based systems, or POTs and POPs. TechnLcal report, Noordwijkerhout FOOIJ Workshop, May 1990.

Digital Library

[9]

J. Engelfriet, G. Leih, and G. Rozenberg. Parallel objectbased systenas and Petri nets, I and II. Technical Report 90-04-5, Del:t. of Computer Science, University of Leiden, February 19c.~0.

[10]

Joseph Goguen. Sheaf semantics for concurrent interacting objects. Mar~uscript, University of Oxford, May 1990; given as a tutorial at the REX School on Foundations of Object- Oriented Pr(,gramming, Noorwijkerhout, The Netherlands, May 28-June 1, 1990.

[11]

Joseph Goguen. Types as theories. Manuscript, University of Oxford, Mar,:h 1990; to appear in G.M. Reed, A.W. Roscoe and R. Wach:er (ads.), Proceedings of the Oxford Symposium on Topology in Computer Science, Oxford University Press, 1990.

[12]

Joseph Goguen, Claude Kirchner, H~l~ne Kirchner, Aristide M~grelis, Jo~,6 Meseguer, and Timothy Winkler. An introduction to OBJ3. in Jean-Pierre Jouannaud and Stephane Kaplan, editors, Proceedings, Conference on Conditional Term Rewriting, Orsay, France, July 8-i0, 1987, pages 258- 263. Springer-~erlag, Lecture Notes in Computer Science No. 308, 1988.

[13]

Joseph Goguen, Claude Kirchner, and Jos~ Meseguer. Concurrent tern', rewriting as a model of computation. In R. Keller an,} J. Fasel, editors, Proc. Workshop on Graph Reduction, ~anta Fe, New Me~cico, pages 53-93. Springer LNCS 279, 1'987.

Digital Library

[14]

Joseph Goga:en and Jos~ Meseguer. Unifying functional, object-orient,~d and relational programming with logical semantics. In 13ruce Shriver and Peter Wegner, editors, Research Direc;'.ion~ in Object-Oriented Programmir~g, pages 417-477. MI'F Press, 1987. Preliminary version in SIC- PLAN IYotic,'.s, Volume 21, Number 10, pages 153-162, October 1986; ~dso, Technical Report CSLL87-93, Center for the Study of Language and Information, Stanford University, March 1987.

Digital Library

[15]

Joseph Goguen and Jos~ Meseguer. Software for the rewrite rule machine, in Proceedings of the International Conference on Fifth Generation Computer Systems, Tokyo, Japan, pages 628-637". ICOT, 1988.

[16]

Joseph Goguen and Jos~ Meseguer. Order-sorted algebra I: Partial and overloaded operations, errors and inheritance. Technical Report SRI-CSL-89-10, SRI International, Computer Science Lab, July 1989. Given as lecture at Seminar on Types, Carnegie-Mellon University, June 1983. Submitted for publication.

[17]

Joseph Goguen, Jos~ Meseguer, Sany Leinwand, Timothy Winkler, and Hitoshi Aid& The rewrite rule machine. Technical Report SR.I-CSL-89-6, SRI International, Computer Science Lab, March 1989.

[18]

Joseph Goguen, James Thatcher, Eric Wagner, and Jesse Wright. Initial algebra semantics and continuous algebras. Journal o} the Association }or Computing Machinery, 24(1):68--95, January 1977.

Digital Library

[19]

Joseph A. Goguert and David Wolfram. On types and POOPS. Manuncript, University of Oxford, 1990; to appear in Proc. IFIP TC-2 Cord'. on Object-Oriented Databases, Windemere.

[20]

Gerard Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the Association for Computing M~chinery, 27:797--821, 1980. Prelimlnary version in 18th Symposium on Mathematical Foundations of Computer Science, 1977.

Digital Library

[21]

Saunders MacLane. Categories for the working mathematician. Springer, 1971.

[22]

Narciso Marti-Oliet and Jose~ Meseguer. An algebraic axiomatization of linear logic models. Technical Report SRI-CSL- 89-11, SRI International, Computer Science Lab, December 1989. To appear in G.M. Reed, A.W. Roscoe and R. Wachter (ads.), Proceedings of the Oxford S~mposium on Topology in Computer Science, Oxford University Press, 1990.

[23]

Narciso Marti-Oliet and Jos~ Meseguer. From Petri nets to linear logic. In D.H. Pitt et aI., editor, Category Theory and Computer Science, pages 313-340. Springer Lecture Notes in Computer Science, Vol. 389, 1989. Full version to appear in Mathem6ticaI Structures in Computer Science.

[24]

Jos~ Meseguer. General logics. In H.-D. Ebbinghaus et al., editor, Logic Colloquium '87, pages 275-329. North-Holland, 1989.

[25]

Jos~ Meseguer. Rewriting as a unified model of concurrency. Teclmical Report SRI-CSL-90-02, SRI International, Computer Science Laboratory, February 1990. Revised June 1990.

[26]

Jos~ Meseguer. Rewriting as a unified model of concurrency. In Proceedings o/ the Concur'90 Conference, Amsterdam, A~ga~gt i990. Springer LNCS, 1990.

Digital Library

[27]

Jos~ Meseguer and Ugo Montaxtarl. Patti nets are monoids. Technical report, SRI International, Computer Science Laboratory, January 1988. Revised June 1989; to appear in In- }ormation and Computation.

[28]

3os~ Meseguer and Ugo Montanazi. Petri nets are monoids: A new MgebrMc foundation for rtet theory. In Proc. LICS'88, pages 155-164. IEEE, 1988.

[29]

Robin Milner. Communication and Concurrency. Prentice Hall, 1989.

Digital Library

[30]

A. Yonezawa, J.-P. Briot, and Etsuya Shibayama. Objectoriented concurrent programming in ABCL/1. in OOP- SLA'86 Conference on Object-Oriented Programming, Portland, Oregon, September-October 1986, pages 258-268. ACM, 1986.

Digital Library

Cited By

Zhang YLiao LYang ZLiu TLuo D(2016)An algebraic specification language for organizational behavior of OOMASProceedings of the 1st International Workshop on Specification, Comprehension, Testing, and Debugging of Concurrent Programs10.1145/2975954.2975957(1-6)Online publication date: 3-Sep-2016
https://dl.acm.org/doi/10.1145/2975954.2975957
Padberg JSchulz A(2016)Model Checking Reconfigurable Petri Nets with MaudeGraph Transformation10.1007/978-3-319-40530-8_4(54-70)Online publication date: 22-Jun-2016
https://doi.org/10.1007/978-3-319-40530-8_4
Clavel MDurán FEker SEscobar SLincoln PMartí-Oliet NTalcott C(2015)Two Decades of MaudeLogic, Rewriting, and Concurrency10.1007/978-3-319-23165-5_11(232-254)Online publication date: 27-Aug-2015
https://doi.org/10.1007/978-3-319-23165-5_11
Show More Cited By

Index Terms

A logical theory of concurrent objects
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Concurrent programming structures
        Modules / packages
      2. Language types
2. Theory of computation

Recommendations

A logical theory of concurrent objects
OOPSLA/ECOOP '90: Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications

A new theory of concurrent objects is presented. The theory has the important advantage of being based directly on a logic called rewriting logic in which concurrent object-oriented computation exactly corresponds to logical deduction. This deduction is ...
A logical framework for reasoning about logical specifications
Representing model theory in a type-theoretical logical framework

In a broad sense, logic is the field of formal languages for knowledge and truth that have a formal semantics. It tends to be difficult to give a narrower definition because very different kinds of logics exist. One of the most fundamental contrasts is ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 25, Issue 10

Oct. 1990

320 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/97946

Editor:
Norman Meyrowitz

Issue’s Table of Contents

OOPSLA/ECOOP '90: Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications
September 1990
336 pages
ISBN:0897914112
DOI:10.1145/97945
Chairman:
Akinori Yonezawa
Univ. of Tokyo, Tokyo, Japan

Copyright © 1990 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1990

Published in SIGPLAN Volume 25, Issue 10

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

65
Total Citations
View Citations
712
Total Downloads

Downloads (Last 12 months)102
Downloads (Last 6 weeks)15

Reflects downloads up to 05 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zhang YLiao LYang ZLiu TLuo D(2016)An algebraic specification language for organizational behavior of OOMASProceedings of the 1st International Workshop on Specification, Comprehension, Testing, and Debugging of Concurrent Programs10.1145/2975954.2975957(1-6)Online publication date: 3-Sep-2016
https://dl.acm.org/doi/10.1145/2975954.2975957
Padberg JSchulz A(2016)Model Checking Reconfigurable Petri Nets with MaudeGraph Transformation10.1007/978-3-319-40530-8_4(54-70)Online publication date: 22-Jun-2016
https://doi.org/10.1007/978-3-319-40530-8_4
Clavel MDurán FEker SEscobar SLincoln PMartí-Oliet NTalcott C(2015)Two Decades of MaudeLogic, Rewriting, and Concurrency10.1007/978-3-319-23165-5_11(232-254)Online publication date: 27-Aug-2015
https://doi.org/10.1007/978-3-319-23165-5_11
Bruni RLluch Lafuente A(2012)Evaluating the Performance of Model Transformation Styles in MaudeFormal Aspects of Component Software10.1007/978-3-642-35743-5_6(79-96)Online publication date: 2012
https://doi.org/10.1007/978-3-642-35743-5_6
Lechner ULengauer CWirsing M(2005)An object-oriented airport: Specification and refinement in MaudeRecent Trends in Data Type Specification10.1007/BFb0014438(351-367)Online publication date: 26-Jun-2005
https://doi.org/10.1007/BFb0014438
Vasconcelos VTokoro M(2005)Trace semantics for actor systemsObject-Based Concurrent Computing10.1007/3-540-55613-3_7(141-162)Online publication date: 27-May-2005
https://doi.org/10.1007/3-540-55613-3_7
Nierstrasz O(2005)Towards an object calculusObject-Based Concurrent Computing10.1007/3-540-55613-3_1(1-20)Online publication date: 27-May-2005
https://doi.org/10.1007/3-540-55613-3_1
Delzanno GGalmiche DMartelli M(1999)A specification logic for concurrent object-oriented programmingMathematical Structures in Computer Science10.1017/S09601295990027899:3(253-286)Online publication date: 1-Jun-1999
https://dl.acm.org/doi/10.1017/S0960129599002789
Briggs TWerth J(1994)A specification language for object-oriented analysis and designObject-Oriented Programming10.1007/BFb0052192(365-385)Online publication date: 1994
https://doi.org/10.1007/BFb0052192
Matsuoka STaura KYonezawa A(1993)Highly efficient and encapsulated re-use of synchronization code in concurrent object-oriented languagesACM SIGPLAN Notices10.1145/167962.16587528:10(109-126)Online publication date: 1-Oct-1993
https://dl.acm.org/doi/10.1145/167962.165875
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Issue’s Table of Contents