A principle for sequential reasoning about distributed algorithms

DOI10.1007/BF03259394zbMath0829.68066OpenAlexW2045364115MaRDI QIDQ1346611

V. Pereyra

Publication date: 6 April 1995

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03259394

zbMATH Keywords

connectivitytemporal logictrue concurrencynetwork flowminimum-pathsminimum-weight spanning trees

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Related Items (7)

Causing communication closure: safe program composition with reliable non-FIFO channels ⋮ A principle for sequential reasoning about distributed algorithms ⋮ Petri net based verification of distributed algorithms: An example ⋮ Synchronous development of asynchronous systems ⋮ Layered reasoning for randomized distributed algorithms ⋮ Structural transformations for data-enriched real-time systems ⋮ A Bibliography of Willem-Paul de Roever

Uses Software

• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stepwise refinement of parallel algorithms
• Decomposition of distributed programs into communication-closed layers
• Termination detection for diffusing computations
• An axiomatic proof technique for parallel programs
• A principle for sequential reasoning about distributed algorithms
• Interleaving set temporal logic
• Distributed network protocols
• Using message passing for distributed programming: proof rules and disciplines
• A Proof System for Communicating Sequential Processes
• Distributed Termination
• Decentralized maximum-flow protocols
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• From sequential layers to distributed processes

This page was built for publication: A principle for sequential reasoning about distributed algorithms