The use of weakest-precondition predicate tranformers in the derivation of sequential, process-control software is discussed. Only one extension to Dijkstra's calculus for deriving ordinary sequential programs was found to be necessary: function-valued auxiliary variables. These auxiliary variables are needed for reasoning about states of a physical process that exist during program transitions
Programming is divided into three major categories with increasing complexity of reasoning in progra...
We define interacting sequential programs, motivated originally by constructivist considerations. We...
We define interacting sequential programs, motivated originally by constructivist considerations. We...
The use of predicate transformers to model the action of sequential programs has allowed the constru...
AbstractThe two large classes of sequential control are those in which certain combinations of state...
AbstractDijkstra and Scholten (1990) present an axiomatic semantics for Dijkstra's guarded command l...
A complete set of algebraic laws is given for E. W. Dijkstra's nondeterministic sequential programmi...
A major application of computers has been to control physical processes in which the computer is emb...
A complete set of algebraic laws is given for Dijkstra's nondeterministic sequential programming lan...
Real-time control programs are often used in contexts where (conceptually) they run forever. Repetit...
Predicate transformers that map the postcondition and all intermediate conditions of a command to a ...
Most programming languages in use today have some way to express concurrent execution of proce...
Of all hard- and software developed for industrial control purposes, the majority is devoted to sequ...
Once strictly the province of assembly-language programmers, real-time computing has developed into ...
In this paper we present a syntactical approach for deriving real-time programs from a formal speci...
Programming is divided into three major categories with increasing complexity of reasoning in progra...
We define interacting sequential programs, motivated originally by constructivist considerations. We...
We define interacting sequential programs, motivated originally by constructivist considerations. We...
The use of predicate transformers to model the action of sequential programs has allowed the constru...
AbstractThe two large classes of sequential control are those in which certain combinations of state...
AbstractDijkstra and Scholten (1990) present an axiomatic semantics for Dijkstra's guarded command l...
A complete set of algebraic laws is given for E. W. Dijkstra's nondeterministic sequential programmi...
A major application of computers has been to control physical processes in which the computer is emb...
A complete set of algebraic laws is given for Dijkstra's nondeterministic sequential programming lan...
Real-time control programs are often used in contexts where (conceptually) they run forever. Repetit...
Predicate transformers that map the postcondition and all intermediate conditions of a command to a ...
Most programming languages in use today have some way to express concurrent execution of proce...
Of all hard- and software developed for industrial control purposes, the majority is devoted to sequ...
Once strictly the province of assembly-language programmers, real-time computing has developed into ...
In this paper we present a syntactical approach for deriving real-time programs from a formal speci...
Programming is divided into three major categories with increasing complexity of reasoning in progra...
We define interacting sequential programs, motivated originally by constructivist considerations. We...
We define interacting sequential programs, motivated originally by constructivist considerations. We...