A method for making aspects of a computational model explicit in the formulas of a programming logic is given. The method is based on a new notion of environment—an environment augments the stale transitions defined by a program’s atomic actions rather than being interleaved with them. Two simple semantic principles are presented for extending a programming logic in order to reason about executions feasible in various environments. The approach is illustrated by (i) discussing a new way to reason in TLA and Hoare-style programming logics about real-time and by (ii) deriving TLA and the first Hoare-style proof rules for reasoning about schedulers.
CITATION STYLE
Fix, L., & Schneider, F. B. (1994). Reasoning about programs by exploiting the environment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 820 LNCS, pp. 328–339). Springer Verlag. https://doi.org/10.1007/3-540-58201-0_79
Mendeley helps you to discover research relevant for your work.