Correctness proofs of distributed termination algorithms

DOI10.1145/5956.6000zbMath0599.68017OpenAlexW2059229220MaRDI QIDQ3735060

Krzysztof R. Apt

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

CSPglobal invariantdeadlockliveness properties of temporal logicweak total correctness

Mathematics Subject Classification ID

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

Related Items (5)

A compositional framework for fault tolerance by specification transformation ⋮ Two normal form theorems for CSP programs ⋮ A fully distributed termination detection scheme ⋮ Design and verification of fault tolerant systems with CSP ⋮ Fifty years of Hoare's logic

This page was built for publication: Correctness proofs of distributed termination algorithms