论文信息 - The Schorr-Waite graph marking algorithm - 字舞流文

The Schorr-Waite graph marking algorithm

SummaryAn explanation is given of the Schorr-Waite algorithm for marking all nodes of a directed graph that are reachable from one given node, using the axiomatic method.

[1] Zohar Manna,et al. Is “sometime” sometimes better than “always”?: Intermittent assertions in proving program correctness , 1976, ICSE '76.

[2] C. A. R. HOARE,et al. An axiomatic basis for computer programming , 1969, CACM.

[3] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .

[4] Robert W. Floyd,et al. Assigning Meanings to Programs , 1993 .

[5] David Gries. The Multiple Assignment Statement , 1978, Program Construction.

[6] Rod M. Burstall,et al. Program Proving as Hand Simulation with a Little Induction , 1974, IFIP Congress.

[7] William M. Waite,et al. An efficient machine-independent procedure for garbage collection in various list structures , 1967, CACM.