An example of stepwise refinement of distributed programs: quiescence detection

DOI10.1145/5956.5958MaRDI QIDQ3732953zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Stepwise refinement and concurrency: The finite-state case
• scientific article; zbMATH DE number 177782
• scientific article; zbMATH DE number 1231462
• Concurrency without toil: A systematic method for parallel program design
• scientific article; zbMATH DE number 3958701

Cited in

(7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3732953)