论文信息 - Program proving: Coroutines

Program proving: Coroutines

SummaryProof methods adequate for a wide range of computer programs have been given in [1–6]. This paper develops a method suitable for programs which incorporate coroutines. The implementation of coroutines described follows closely that given in SIMULA [7, 8], a language in which such features may be used to great advantage. Proof rules for establishing the correctness of coroutines are given and the method is illustrated by the proof of a useful program for histogram compilation.

Maurice Clint

[1] R.,et al. The Queen's University of Belfast , 2018, Nature.

[2] C. A. R. Hoare,et al. Procedures and parameters: An axiomatic approach , 1971, Symposium on Semantics of Algorithmic Languages.

[3] C. A. R. Hoare,et al. Proof of a Recursive Program: Quicksort , 1971, Comput. J..

[4] James C. King,et al. A Program Verifier , 1971, IFIP Congress.

[5] Melvin E. Conway,et al. Design of a separable transition-diagram compiler , 1963, CACM.

[6] C. A. R. Hoare,et al. Program proving: Jumps and functions , 1972, Acta Informatica.

[7] R. HoareC.A.. Proof of a program , 1971 .

[8] Ole-Johan Dahl,et al. Coroutine sequencing in a block structured environment , 1971 .

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

[10] Kristen Nygaard,et al. SIMULA: an ALGOL-based simulation language , 1966, CACM.