Putting time into proof outlines
A logic for reasoning about timing properties of concurrent programs is presented. The logic is based on proof outlines and can handle maximal parallelism as well as resourceconstrained execution environments. The correctness proof for a mutual exclusion protocol that uses execution timings in a subtle way illustrates the logic in action.
Key wordsconcurrent program verification timing properties safety properties real-time programming real-time actions proof outlines
Unable to display preview. Download preview PDF.
- [Dijkstra 75]Dijkstra, E.W. Guarded commands, nondeterminacy and formal derivation of programs. CACM 18, 8 (Aug. 1975), 453–457.Google Scholar
- [Gries-Levin 80]
- [Haase 81]Haase, V. Real-time Behavior of Programs. IEEE Transactions on Software Engineering SE-7, 5 (Sept. 1981), 494–501.Google Scholar
- [Hoare 69]Hoare, C.A.R. An axiomatic basis for computer programming. CACM 12, 10 (Oct. 1969), 576–580.Google Scholar
- [Hooman 91]Hooman, J. Specification and Compositional Verification of Real-time Systems. Ph.D. Thesis, Technische Universiteit Eindhoven. May 1991.Google Scholar
- [Lamport 87]
- [Owicki-Gries 76]
- [Owicki-Lamport 82]
- [Schneider 92]Schneider, F.B. On concurrent programming. In preparation.Google Scholar
- [Shaw 89]