Proving monitors
John Harrison Howard · Communications of the ACM · 1976
Interesting scheduling and sequential properties of monitors can be proved by using state variables which record the monitors' history and by defining extended proof rules for their wait and signal operations. These two techniques are defined, discussed, and applied to examples to prove properties such as freedom from indefinitely repeated overtaking or unnecessary waiting, upper bounds on queue lengths, and historical behavior.
Cited by 89 works. doi:10.1145/360051.360079 Open-access PDF
Authors
References
- Formal Languages and Their Relation to Automata
- An axiomatic basis for computer programming
- Monitors
- Formal Languages and their Relation to Automata
- Proof of correctness of data representations
- Operating System Principles
- Hierarchical ordering of sequential processes
- A technique for software module specification with examples
- Program proving: Coroutines
- On attaining reliable software for a secure operating system