The correctness of the Schorr-Waite list marking algorithm-Reference-Cited by-同舟云学术

The correctness of the Schorr-Waite list marking algorithm

Published:1979 Issue:3 Volume:11 Page:211-221
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Topor R. W.

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00289067.pdf

Reference15 articles.

1. Burstall, R.M.: Proving properties of programs by structural induction. Comput. J. 12, 41?48 (1969)

2. Burstall, R.M.: Some techniques for proving correctness of programs which alter data structures. In: Machine intelligence, Vol. 7 (B. Meltzer, D. Michie, eds.), pp. 23?50. Edinburgh: University Press 1972

3. Burstall, R.M.: Program proving as hand simulation with a little induction. In: Proc. IFIP Congress 1974, pp. 308?312. Amsterdam: North-Holland 1974

4. Floyd, R.W.: Assigning meanings to programs. In: Proc. Symposium in Applied Mathematics 19 (J.T. Schwartz, ed.), pp. 19?32. Providence, R.I.: AMS 1967

5. Hoare, C.A.R.: Proof of correctness of data representations. Acta Informat. 1, 271?281 (1972)

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Formal Proof of Node Level Trust Evaluation in Wireless Sensor Network;Proceeding of First Doctoral Symposium on Natural Computing Research;2021

2. Pointer Program Derivation Using Coq: Graphs and Schorr-Waite Algorithm;Formal Methods and Software Engineering;2014

3. Automated verification of pointer programs in pointer logic;Frontiers of Computer Science in China;2008-11-05

4. FUNCTIONAL PEARL Unfolding pointer algorithms;Journal of Functional Programming;2001-05

5. Proving Pointer Programs in Hoare Logic;Lecture Notes in Computer Science;2000