The use of predicate transformers to model the action of sequential programs has allowed the construction of a refinement calculus for expressing the formal verification of the top-down development of sequential programs. It is shown that predicate transformers may also be used to model real-time processes. The notions of precondition and postcondition in the sequential refinement calculus are replaced by the notions of assumption and effect. In this way the formal development of real-time processes may also be expressed within the refinement calculus. Notations are developed for the specification and implementation of real-time processes within the framework of the refinement calculus. Several case-studies are presented to demonstrate the ...
The refinement calculus is a well-established theory for formal development of imperative program co...
We define a language and a predicative semantics to model concurrent real-time programs. We consider...
High-level language program compilation strategies can be proven correct by modelling the process as...
A specification and top-level refinement of a simple mine pump control system, as well as a proof of...
AbstractThe real-time refinement calculus is a formal method for the systematic derivation of real-t...
The real-time refinement calculus is a formal method for the systematic derivation of real-time prog...
The real-time refinement calculus is an extension of the standard refinement calculus in which progr...
AbstractA refinement calculus for the development of real-time systems is presented. The calculus is...
The refinement calculus is a well-established theory for deriving program code from specifications. ...
AbstractA theory of timewise refinement is presented. This allows the translation of specifications ...
This paper presents an assume-guarantee specification theory for modular synthesis and verification ...
In this paper we consider the relationship between refinement-oriented specification and specificati...
The use of weakest-precondition predicate tranformers in the derivation of sequential, process-cont...
A theory of timewise refinement is presented. This allows the translation of specifications and proo...
A real-time program can be developed by refining a specification into program code. Verification of ...
The refinement calculus is a well-established theory for formal development of imperative program co...
We define a language and a predicative semantics to model concurrent real-time programs. We consider...
High-level language program compilation strategies can be proven correct by modelling the process as...
A specification and top-level refinement of a simple mine pump control system, as well as a proof of...
AbstractThe real-time refinement calculus is a formal method for the systematic derivation of real-t...
The real-time refinement calculus is a formal method for the systematic derivation of real-time prog...
The real-time refinement calculus is an extension of the standard refinement calculus in which progr...
AbstractA refinement calculus for the development of real-time systems is presented. The calculus is...
The refinement calculus is a well-established theory for deriving program code from specifications. ...
AbstractA theory of timewise refinement is presented. This allows the translation of specifications ...
This paper presents an assume-guarantee specification theory for modular synthesis and verification ...
In this paper we consider the relationship between refinement-oriented specification and specificati...
The use of weakest-precondition predicate tranformers in the derivation of sequential, process-cont...
A theory of timewise refinement is presented. This allows the translation of specifications and proo...
A real-time program can be developed by refining a specification into program code. Verification of ...
The refinement calculus is a well-established theory for formal development of imperative program co...
We define a language and a predicative semantics to model concurrent real-time programs. We consider...
High-level language program compilation strategies can be proven correct by modelling the process as...