Proving Monitors.

Saved in:
Bibliographic Details
Title: Proving Monitors.
Authors: Howard, John H.1, Gaines, R. S.
Source: Communications of the ACM. May76, Vol. 19 Issue 5, p273-279. 7p.
Subjects: Object monitors (Computer software), Computer engineering, Production scheduling, Computer monitors, Computer terminals, Information display systems
Abstract: 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 wailing, upper bounds on queue lengths, and historical behavior. [ABSTRACT FROM AUTHOR]
Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract: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 wailing, upper bounds on queue lengths, and historical behavior. [ABSTRACT FROM AUTHOR]
ISSN:00010782
DOI:10.1145/360051.360079