The Schorr-Waite graph marking algorithm

1. Floyd, R.W.: Assigning meanings to programs. Proc. Amer. Math. Soc. (Symp. in Applied Math.) 19, 19–31 (1967)

   Google Scholar 

2. Hoare, C.A.R.: An axiomatic basis for computer programming. Comm. ACM 12, 576–580, 583 (1969)

   Google Scholar 

3. Dijkstra, E.W.: A discipline of programming. Englewood Cliffs, N.J.: Prentice-Hall 1976

   Google Scholar 

4. Schorr, H., Waite, W.M.: An efficient machine-independent procedure for garbage collection in various list structures. Comm. ACM 10, 501–506 (1967)

   Google Scholar 

5. Burstall, R.M.: Program proving as hand simulation with a little induction. Proc. IFIP Congress pp. 308–312, 1974

6. Manna, Z., Waldinger, R.: Is “sometime” sometimes better than “always”? Intermittent assertions in proving program correctness. Comm. ACM 21, 159–172 (1978)

   Google Scholar 

7. Gries, D.: The multiple assignment statement. IEEE Trans. Software Engrg. SE-4, 89–93 (1978)

   Google Scholar 

Download references