Principles of interactive computer graphics (2nd ed.)
Principles of interactive computer graphics (2nd ed.)
A generalized control structure and its formal definition
Communications of the ACM
A critique of the foundations of Hoare style programming logics
Communications of the ACM
Communicating sequential processes
Communications of the ACM
Multiple exits from a loop using neither GO TO nor labels
Communications of the ACM
Multiple exits from a loop without the GOTO
Communications of the ACM
A Discipline of Programming
A generalization of Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Effect of Data Abstraction on Loop Programming Techniques
IEEE Transactions on Software Engineering
The flow of control notations pancode and boxcharts
ACM SIGPLAN Notices
Terminable statements and destructive computation
ACM SIGPLAN Notices
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
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.