article · 1990
A logical theory of concurrent objects
Cited by 101Open access
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.
Cite this paper
Meseguer, J. (1990). A logical theory of concurrent objects. https://doi.org/10.1145/97945.97958
Meseguer, José. “A logical theory of concurrent objects.” 1990, pp. 101–15, https://doi.org/10.1145/97945.97958.
Meseguer, José. 1990. “A logical theory of concurrent objects.” https://doi.org/10.1145/97945.97958.
Meseguer, J. (1990) ‘A logical theory of concurrent objects’. Available at: https://doi.org/10.1145/97945.97958.
@article{meseguer1990logical,
title = {{A logical theory of concurrent objects}},
author = {Meseguer, José},
pages = {101--115},
year = {1990},
doi = {10.1145/97945.97958}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Order-sorted Term Rewriting
A. J. J. Dick · The Computer Journal · 1991
Cited by 8
Nominal Completion for Rewrite Systems with Binders
Maribel Fernández, Albert Rubio · Lecture notes in computer science · 2012
Cited by 8Open access
Relating Nominal and Higher-Order Rewriting
Jesús Domínguez, Maribel Fernández · Lecture notes in computer science · 2014
Cited by 3
Generalized Innermost Rewriting
Jaco van de Pol, Hans Zantema · Lecture notes in computer science · 2005
Cited by 7
Incremental Rewriting Modulo SMT
Gerald Whitters, Vivek Nigam, Carolyn Talcott · Lecture notes in computer science · 2023
Cited by 3Open access
Rewriting modulo a rewrite system
Patrick Viry · UnipiEprints Open Archive (Università di Pisa) · 1995
Cited by 18
Complete sets of reductions modulo associativity, commutativity and identity
Timothy B. Baird, Gerald E. Peterson, Ralph W. Wilkerson · Lecture notes in computer science · 1989
Cited by 21
Ground Confluence and Strong Commutation Modulo Alpha-Equivalence in Nominal Rewriting
Kentaro Kikuchi · Lecture notes in computer science · 2022
Cited by 1