Reasoning about real-time programs using idle-invariant assertions

Authors:
I. Hayes
Affiliations:
-
Venue:
APSEC '00 Proceedings of the Seventh Asia-Pacific Software Engineering Conference
Year:
2000

Citing 0
Cited 2

Procedures and parameters in the real-time program refinement calculus

Science of Computer Programming
Invariants and well-foundedness in program algebra

ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a set of laws for reasoning about real-time programs using assertions (preconditions and postconditions) in the style of Hoare. In the real-time context assertions may refer to the current time and to the value of external inputs, which are not under the direct control of the program and hence not guaranteed to be stable with respect to the passage of time (even if the program does not modify any of the variables under its control). Hence in order to reason about real-time programs, we make use of idle-invariant assertions: assertions that are invariant to just the passage of time.