Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Supporting Fault-Tolerant Parallel Programming in Linda
IEEE Transactions on Parallel and Distributed Systems
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
ACM Transactions on Computer Systems (TOCS)
On the expressiveness of Linda coordination primitives
Information and Computation - Special issue on EXPRESS 1997
Making tuple spaces safe for heterogeneous distributed systems
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Coordinating processes with secure spaces
Science of Computer Programming - Special issue on coordination languages and architectures
Small Byzantine Quorum Systems
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Resilient distributed objects: Basic results and application to shared tuple spaces
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
BASE: Using abstraction to improve fault tolerance
ACM Transactions on Computer Systems (TOCS)
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Intrusion-tolerant architectures: concepts and design
Architecting dependable systems
Research note: On Byzantine generals with alternative plans
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Generative coordination is one of the most prominent coordination models for implementing open systems due to its spatial and temporal decoupling. Recently, a coordination community effort have been trying to integrate security mechanisms to this model aiming to improve its robustness. In this context, this paper presents the BTS coordination model, which provides a Byzantine fault-tolerant tuple space. Byzantine faults are commonly used to represent both process crashes and intrusions. As far as we know. BTS is the first coordination model that supports this dependability level.