An example of stepwise refinement of distributed programs: quiescence detection

DOI10.1145/5956.5958zbMath0598.68031OpenAlexW2154004999MaRDI QIDQ3732953

Mani Chandy, Jayadev Misra

Publication date: 1986

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toplas/1986-8/

zbMATH Keywords

concurrent programsprogram developmenttermination and deadlock detection

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Related Items (6)

Systolic algorithms as programs ⋮ Derivation of efficient parallel programs: An example from genetic sequence analysis ⋮ Efficient detection of a class of stable properties ⋮ An algebraic foundation for automatic feature-based program synthesis ⋮ On the memory overhead of distributed snapshots ⋮ An efficient parallel termination detection algorithm

This page was built for publication: An example of stepwise refinement of distributed programs: quiescence detection