An axiomatic basis for computer programming
Communications of the ACM
Report on the algorithmic language ALGOL 60
Communications of the ACM
A Formal Specification and Validation of a Critical System in Presence of Byzantine Errors
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
A generalized approach to interpretation machines
ACM SIGPLAN Notices
An observationally complete program logic for imperative higher-order functions
Theoretical Computer Science
Hi-index | 0.01 |
So-called “guarded commands” are introduced as a building block for alternative and repetitive constructs that allow non-deterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniquely determined by the initial state. For the formal derivation of programs expressed in terms of these constructs, a calculus will be shown.