The correctness of the Schorr-Waite list marking algorithm |
| |
| Authors: | R W Topor |
| |
| Affiliation: | (1) Department of Computer Science, Monash University, 3168 Clayton, Victoria, Australia |
| |
| Abstract: | Summary This paper presents a relatively simple proof of a nontrivial algorithm for marking all the nodes of a list structure. The proof separates properties of the algorithm from properties of the data on which it operates and is a significant application of the method of  intermittent assertions .(This paper grew out of an earlier version which was submitted to this journal on October 16, 1974) |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
