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 tim
This thesis develops a new method for proving properties of concurrent programs and gives formal de...
AbstractWe extend the specification language of temporal logic, the corresponding verification frame...
A logic for reasoning about timing properties of concurrent programs is presented. The logic is ba...
SRI International A liveness property asserts that program execution eventually reaches some desirab...
AbstractIt is common for a real-time system to contain a nonterminating process monitoring an input ...
Program verification increases the degree of confidence that a program will perform correctly. Manua...
. We extend the specification language of temporal logic, the corresponding verification framework, ...
It is common for a real-time system to contain a nonterminating process monitoring an input and cont...
We present a new temporal logic for the specification and verification of real-time systems. This lo...
AbstractThe paper presents a relatively complete proof system for proving the validity of temporal p...
Real-time control programs are often used in contexts where (conceptually) they run forever. Repetit...
We here present an approach to reasoning about actor programs on the basis of temporal logic. Tempor...
We present an algorithm that generates invariants for real-time models. The algorithm, further, prun...
. The most natural, compositional, way of modeling real-time systems uses a dense domain for time. T...
The development of a product typically starts with the specification of the user’s requirements and ...
This thesis develops a new method for proving properties of concurrent programs and gives formal de...
AbstractWe extend the specification language of temporal logic, the corresponding verification frame...
A logic for reasoning about timing properties of concurrent programs is presented. The logic is ba...
SRI International A liveness property asserts that program execution eventually reaches some desirab...
AbstractIt is common for a real-time system to contain a nonterminating process monitoring an input ...
Program verification increases the degree of confidence that a program will perform correctly. Manua...
. We extend the specification language of temporal logic, the corresponding verification framework, ...
It is common for a real-time system to contain a nonterminating process monitoring an input and cont...
We present a new temporal logic for the specification and verification of real-time systems. This lo...
AbstractThe paper presents a relatively complete proof system for proving the validity of temporal p...
Real-time control programs are often used in contexts where (conceptually) they run forever. Repetit...
We here present an approach to reasoning about actor programs on the basis of temporal logic. Tempor...
We present an algorithm that generates invariants for real-time models. The algorithm, further, prun...
. The most natural, compositional, way of modeling real-time systems uses a dense domain for time. T...
The development of a product typically starts with the specification of the user’s requirements and ...
This thesis develops a new method for proving properties of concurrent programs and gives formal de...
AbstractWe extend the specification language of temporal logic, the corresponding verification frame...
A logic for reasoning about timing properties of concurrent programs is presented. The logic is ba...