Adequate proof principles for invariance and liveness properties of concurrent programs
Science of Computer Programming
Data structures and network algorithms
Data structures and network algorithms
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Modeling concurrency with partial orders
International Journal of Parallel Programming
Parallel program design: a foundation
Parallel program design: a foundation
A lattice-structured proof of a minimum spanning
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Understanding and verifying distributed algorithms using stratified decomposition
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
A derivation of a broadcasting protocol using sequentially phased reasoning
REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
Verification of sequential and concurrent programs
Verification of sequential and concurrent programs
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Craft of Programming
Proceedings of the 3rd International Workshop on Distributed Algorithms
Action Systems and Action Refinement in the Development of Parallel Systems - An Algebraic Approach
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Protocol Design by Layered Decomposition: A Compositional Approach
Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Layering Techniques for Development of Parallel Systems
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Layering and Action Refinement for Timed Systems
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Verification of distributed programs using representative interleaving sequences
Distributed Computing
Compositional Transformational Design for Concurrent Programs
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Transition Refinement for Deriving a Distributed Minimum Weight Spanning Tree Algorithm
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
A compositional trace logic for behavioural interface specifications
Nordic Journal of Computing
Aspect Oriented Approach for Capturing and Verifying Distributed Properties
Languages: From Formal to Natural
A new proof of the GHS minimum spanning tree algorithm
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Causing communication closure: safe program composition with Non-FIFO channels
DISC'05 Proceedings of the 19th international conference on Distributed Computing
On horizontal specification architectures and their aspect-oriented implementations
Transactions on Aspect-Oriented Software Development II
Hi-index | 0.00 |
Analysis and design of distributed algorithms and protocols are difficult issues. An important cause for those difficulties is the fact that the logical structure of the solution is often invisible in the actual implementation. We introduce a framework that allows for a formal treatment of the design process, from an abstract initial design to an implementation tailored to specific architectures. A combination of algebraic and axiomatic techniques is used to verify correctness of the derivation steps. This is shown by deriving an implementation of a distributed minimum weight spanning tree algorithm in the style of [GHS].