Parallel program design: a foundation
Parallel program design: a foundation
Completing the temporal picture
Selected papers of the 16th international colloquium on Automata, languages, and programming
Information Processing Letters
Derivation of concurrent programs: two examples
Science of Computer Programming
Theoretical Computer Science - Special issue on algebraic methodology and software technology
On a method of multiprogramming
On a method of multiprogramming
Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394
Formal Methods in System Design
Distributed Algorithms
A Discipline of Programming
A Method for the Development of Totally Correct Shared-State Parallel Programs
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Streamlining progress-based derivations of concurrent programs
Formal Aspects of Computing
Constructing and Reasoning About Security Protocols Using Invariants
Electronic Notes in Theoretical Computer Science (ENTCS)
Assertion-based proof checking of chang-roberts leader election in PVS
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Incremental verification of owicki/gries proof outlines using PVS
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Formalising progress properties of non-blocking programs
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
A UNITY-based framework towards component based systems
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Progress in deriving concurrent programs: emphasizing the role of stable guards
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Hi-index | 0.00 |
To facilitate the construction of concurrent programs based on progress requirements, we study an integration of the Owicki/Gries theory with UNITY's leads-to relation. In particular we investigate a set of calculational rules for leads-to, and we study the composition of programs regarding their effect on progress. Apart from parallel composition, we consider the less familiar notion of weak sequential composition. Our techniques are illustrated on two network initialisation protocols that are related to the protocol standard IEEE 1394.