Communicating sequential processes
Communicating sequential processes
Actors: a model of concurrent computation in distributed systems
Actors: a model of concurrent computation in distributed systems
Concurrent object-oriented programming
Communications of the ACM
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
A logical theory of concurrent objects and its realization in the Maude language
Research directions in concurrent object-oriented programming
Actor languages. their syntax, semantics, translation, and equivalence
Theoretical Computer Science
Proof, language, and interaction
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Composable Semantic Models for Actor Theories
Higher-Order and Symbolic Computation
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Towards a Verification Logic for Rewriting Logic
WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Modular Reasoning for Actor Specification Diagrams
Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS)
Foundations of Actor Semantics
Foundations of Actor Semantics
Proof-theoretic foundations for the design of actor systems
Mathematical Structures in Computer Science
A foundation for actor computation
Journal of Functional Programming
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Towards a Toolkit for Actor System Specification
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Modeling and Verification of Reactive Systems using Rebeca
Fundamenta Informaticae
Actors and Logical Analysis of Interactive Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
IOP: The InterOperability Platform & IMaude: An Interactive Extension of Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Rebeca: theory, applications, and tools
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Ten years of analyzing actors: Rebeca experience
Formal modeling
Modeling and Verification of Reactive Systems using Rebeca
Fundamenta Informaticae
Hi-index | 0.00 |
The actor theory framework is a general semantic framework, based on the actor computation model, for specifying and reasoning about components of open distributed systems. It can be used to define both operational and trace-like interaction semantics for actor programming languages and specification notations. It can also be used to directly specify actor system components. The framework allows descriptions of system components written using different notations or at different levels of abstraction to be related: translations between actor programming languages can be shown to preserve interaction semantics, notions of satisfaction and refinement for specification notations can be defined and, using actor theory transformations, different descriptions of a component can be shown to be equivalent. In this paper we define the notion of an equationally presented actor theory and a mapping of equational presentations to theories in rewriting logic. We show that this mapping gives a correct representation of actor theory semantics by defining a correspondence between finite actor theory computations and rewrite theory proofs. To treat infinite computations and admissibility we extend the rewriting logic initial model construction to include infinite proofs, extend the mapping to infinite computations, and show that the correspondence preserves interaction semantics.