|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
16th Annual Symposium on Foundations of Computer Science (FOCS 1975)
Flow of control in the proof theory of structured programming
October 13-October 15
| ASCII Text | x | ||
| J. W. de Bakker, "Flow of control in the proof theory of structured programming," Foundations of Computer Science, IEEE Annual Symposium on, pp. 29-33, 16th Annual Symposium on Foundations of Computer Science (FOCS 1975), 1975. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1975.15, author = {J. W. de Bakker}, title = {Flow of control in the proof theory of structured programming}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1975}, issn = {0272-5428}, pages = {29-33}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1975.15}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Flow of control in the proof theory of structured programming SN - 0272-5428 SP29 EP33 A1 - J. W. de Bakker, PY - 1975 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1975.15
The proof theory of structured programming insofar as concerned with flow of control is investigated. Various proof rules for the while, repeat-until and simple iteration statements - all essentially variants of Hoare's original while rule - are analyzed with respect to their soundness and adequacy. Next, a recently proposed proof rule for recursive procedures due to Dijkstra is - after correction - shown to be a simple instance of Scott's induction rule. Finally, Manna & Pnueli's rule for total correctness of the while statement is formally justified using the Hitchcock & Park theory of program termination based on well-founded relations.
Citation:
J. W. de Bakker, "Flow of control in the proof theory of structured programming," focs, pp.29-33, 16th Annual Symposium on Foundations of Computer Science (FOCS 1975), 1975
Usage of this product signifies your acceptance of the Terms of Use.
