Actors: a model of concurrent computation in distributed systems
Actors: a model of concurrent computation in distributed systems
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Concurrent programming in ERLANG (2nd ed.)
Concurrent programming in ERLANG (2nd ed.)
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Programming dynamically reconfigurable open systems with SALSA
ACM SIGPLAN Notices
Composable Semantic Models for Actor Theories
Higher-Order and Symbolic Computation
A foundation for actor computation
Journal of Functional Programming
Creol: a type-safe object-oriented model for distributed concurrent systems
Theoretical Computer Science - Components and objects
Malleable applications for scalable high performance computing
Cluster Computing
Proceedings of the 2008 ACM symposium on Applied computing
A Framework for State-Space Exploration of Java-Based Actor Programs
ASE '09 Proceedings of the 2009 IEEE/ACM International Conference on Automated Software Engineering
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
Programming Distributed Computing Systems: A Foundational Approach
Programming Distributed Computing Systems: A Foundational Approach
Hi-index | 0.00 |
The actor model of distributed computing imposes important restrictions on concurrent computations in order to be valid. In particular, an actor language implementation must provide fairness, the property that if a system transition is infinitely often enabled, the transition must eventually happen. Fairness is fundamental to proving progress properties. We show that many properties of actor computation can be expressed and proved at an abstract level, independently of the details of a particular system of actors. As in abstract algebra, we formulate and prove theorems at the most abstract level possible, so that they can be applied at all more refined levels of the theory hierarchy. Our most useful abstract-level theorems concern persistence of actors, conditional persistence of messages, preservation of unique actor identifiers, monotonicity properties of actor local states, guaranteed message delivery, and general consequences of fairness. We apply the general actor theory to a concrete ticker and clock actor system, proving several system-specific properties, including conditional invariants and a progress theorem. We develop our framework within the Athena proof system, in which proofs are both human-readable and machine-checkable, taking advantage of it library of algebraic and relational theories.