Formal and incremental construction of distributed algorithms: on the distributed reference counting algorithm
From MaRDI portal
Publication:860848
DOI10.1016/j.tcs.2006.08.015zbMath1153.68560OpenAlexW2011959275MaRDI QIDQ860848
Dominique Cansell, Dominique Méry
Publication date: 9 January 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.015
Uses Software
Cites Work
- On correct refinement of programs
- A mechanically proved and incremental development of IEEE 1394 tree identify protocol
- Click’n Prove: Interactive Proofs within Set Theory
- The B-Book
- Incremental Proof of the Producer/Consumer Property for the PCI Protocol
- Mathematical Foundations of Computer Science 2005
- A construction of distributed reference counting
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item