Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Constructing two-writer atomic registers
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Commutativity-Based Concurrency Control for Abstract Data Types
IEEE Transactions on Computers
Constructing Two-Writer Atomic Registers
IEEE Transactions on Computers
Impossibility and universality results for wait-free synchronization
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Sticky bits and universality of consensus
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
The impact of recovery on concurrency control
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the relations computable by a class of concurrent automata
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Designing algorithms for distributed systems with partially synchronized clocks
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
A tale of two directories: implementing distributed shared objects in Java
JAVA '99 Proceedings of the ACM 1999 conference on Java Grande
A Distributed Deadlock Resolution Algorithm for the AND Model
IEEE Transactions on Parallel and Distributed Systems
Towards a Characterisation of Finite-State Message-Passing Systems
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
Mechanical Translation of I/O Automaton Specifications into First-Order Logic
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Distributed implementation of a process-algebra based programming language for embedded systems
Nordic Journal of Computing
Resolving Distributed Deadlocks in the OR Request Model
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Formal Methods of Analysis of System Properties
Cybernetics and Systems Analysis
A relational model of non-deterministic dataflow
Mathematical Structures in Computer Science
The inhibition spectrum and the achievement of causal consistency
Distributed Computing
Long-lived Rambo: Trading knowledge for communication
Theoretical Computer Science
Verifying distributed systems: the operational approach
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Compositional semantics of an actor-based language using constraint automata
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
Modeling and Verification of Reactive Systems using Rebeca
Fundamenta Informaticae
| Hi-index | 0.01 |
This thesis introduces a new model for distributed computation in asynchronous networks, the input-output automaton. This simple, powerful model captures in a novel way the game-theoretical interaction between a system and its environment, and allows fundamental properties of distributed computation such as fair computation to be naturally expressed. Furthermore, this model can be used to construct modular, hierarchical correctness proofs of distributed algorithms. This thesis defines the input-output automaton model, and presents an interesting example of how this model can be used to construct such proofs.