The correctness of the Schorr-Waite list marking algorithm
From MaRDI portal
Publication:1250706
DOI10.1007/BF00289067zbMath0388.68038OpenAlexW2087565681MaRDI QIDQ1250706
Publication date: 1979
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00289067
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Schorr-Waite graph marking algorithm
- Proof of correctness of data representations
- Is “sometime” sometimes better than “always”?
- Data Structures and Correctness of Programs
- An efficient machine-independent procedure for garbage collection in various list structures
- Proving Properties of Programs by Structural Induction