Publication date
January 1992
DOIAbstract
Predicate transformers that map the postcondition and all intermediate conditions of a command to a precondition are introduced. They can be used to specify certain progress properties of sequential programs
Predicate transformers that map the postcondition and all intermediate conditions of a command to a precondition are introduced. They can be used to specify certain progress properties of sequential programs
In expounding the notions of pre- and postconditions, of termination and nontermination, of correctn...
In proof theory, a standard method for showing the correctness of a program w.r.t. given pre- and po...
Abstract In proof theory, a standard method for showing the correct-ness of a program w.r.t. given p...
Predicate transformers that map the postcondition and all intermediate conditions of a command to a ...
Predicate transformers that map the postcondition and all intermediate conditions of a command to a ...
AbstractWe present a purely syntactical definition of E.W. Dijkstra's predicate transformer wp for n...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
The use of weakest-precondition predicate tranformers in the derivation of sequential, process-cont...
In some otherwise attractive formalisms, it can be difficult or even impossible to specify progress...
. We claim that a continuation style semantics of a programming language can provide a starting poin...
The use of predicate transformers to model the action of sequential programs has allowed the constru...
The behavior of a program can be modeled by describing how it transforms input states to output stat...
AbstractDijkstra and Scholten (1990) present an axiomatic semantics for Dijkstra's guarded command l...
General correctness, which subsumes partial and total correctness, is defined for both weakest prec...
Abstract. In proof theory, a standard method for showing the correct-ness of a program w.r.t. given ...
In expounding the notions of pre- and postconditions, of termination and nontermination, of correctn...
In proof theory, a standard method for showing the correctness of a program w.r.t. given pre- and po...
Abstract In proof theory, a standard method for showing the correct-ness of a program w.r.t. given p...
Predicate transformers that map the postcondition and all intermediate conditions of a command to a ...
Predicate transformers that map the postcondition and all intermediate conditions of a command to a ...
AbstractWe present a purely syntactical definition of E.W. Dijkstra's predicate transformer wp for n...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
The use of weakest-precondition predicate tranformers in the derivation of sequential, process-cont...
In some otherwise attractive formalisms, it can be difficult or even impossible to specify progress...
. We claim that a continuation style semantics of a programming language can provide a starting poin...
The use of predicate transformers to model the action of sequential programs has allowed the constru...
The behavior of a program can be modeled by describing how it transforms input states to output stat...
AbstractDijkstra and Scholten (1990) present an axiomatic semantics for Dijkstra's guarded command l...
General correctness, which subsumes partial and total correctness, is defined for both weakest prec...
Abstract. In proof theory, a standard method for showing the correct-ness of a program w.r.t. given ...
In expounding the notions of pre- and postconditions, of termination and nontermination, of correctn...
In proof theory, a standard method for showing the correctness of a program w.r.t. given pre- and po...
Abstract In proof theory, a standard method for showing the correct-ness of a program w.r.t. given p...
Add to ORKG