A generalized iterative construct and its semantics
- 1 October 1987
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 9 (4) , 567-581
- https://doi.org/10.1145/29873.30391
Abstract
A new programming language construct, called DOupon, subsumes Dijkstra's selective (IF) and iterative (DO) constructs. DOupon has a predicate transformer approximately equivalent in complexity to that for DO. In addition, it simplifies a wide variety of algorithms, in form as well as in discovery and proof. Several theorems are demonstrated that are useful for correctness proofs and for optimization and that are not applicable to DO or IF. The general usefulness of DOupon derives from a separation of the concerns of invariance, through iteration, from those of termination.Keywords
This publication has 5 references indexed in Scilit:
- A generalized control structure and its formal definitionCommunications of the ACM, 1983
- A critique of the foundations of Hoare style programming logicsCommunications of the ACM, 1982
- Communicating sequential processesCommunications of the ACM, 1978
- Multiple exits from a loop using neither GO TO nor labelsCommunications of the ACM, 1974
- Multiple exits from a loop without the GOTOCommunications of the ACM, 1973