Formalization of Properties of Functional Programs
Journal of the ACM (JACM)
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Fixpoint approach to the theory of computation
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
A view of program verification
Proceedings of the international conference on Reliable software
| Hi-index | 0.00 |
In this paper, formal semantics of program constructs are defined by predicate transformer introduced by Dijkstra [3,4]. A predicate transformer is a mapping which transforms a set of states after the execution of a program to the set of all possible states before the execution of the same program. Thus, the concept of determinism no longer has its significance in this semantic context. Rather, the focus is on the nature of the computation, and hence the concept of iteration, and not how the program iterates, becomes a dominant concern here.