We define a predicate transformer, in terms of which finite disjunctions of leads-to properties can be rewritten as single leads-to properties. Although disjunctions of leads-to properties do not typically arise naturally in progress specifications, an example shows how they may be introduced through the use of nested implications of leads-to properties; such implications allow subtle dependencies between a program's progress and that of its environment to be conveniently specified. After introducing the predicate transformer, which is called the "but-not-yet" operator, we show how to define a single leads-to property equivalent to a given disjunction of two leads-to properties. An alternative definition of the but-not-y...
Predicate transformers that map the postcondition and all intermediate conditions of a command to a ...
We study relations between predicate transformers and multifunctions in a topological setting based ...
AbstractThis paper presents a treatment of pre- and post-conditions, and predicate transformers, in ...
The behavior of a program can be modeled by describing how it transforms input states to output stat...
AbstractIn Keimel et al. (2009) [5] we have systematically derived a predicate transformer semantics...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
AbstractWe present a purely syntactical definition of E.W. Dijkstra's predicate transformer wp for n...
Reasoning about programs that use effects can be much harder than reasoning about their pure counter...
Predicate transformers are formalized in higher order logic. This gives a basis for mechanized reaso...
The standard Galois connection between the relational and predicate-transformer models of sequential...
General correctness, which subsumes partial and total correctness, is defined for both weakest prec...
The standard Galois connection [6, 3] between the relational [4] and predicate-transformer [1] model...
In some otherwise attractive formalisms, it can be difficult or even impossible to specify progress ...
AbstractThe behavior of a program can be modeled by describing how it transforms input states to out...
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 ...
We study relations between predicate transformers and multifunctions in a topological setting based ...
AbstractThis paper presents a treatment of pre- and post-conditions, and predicate transformers, in ...
The behavior of a program can be modeled by describing how it transforms input states to output stat...
AbstractIn Keimel et al. (2009) [5] we have systematically derived a predicate transformer semantics...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
AbstractWe present a purely syntactical definition of E.W. Dijkstra's predicate transformer wp for n...
Reasoning about programs that use effects can be much harder than reasoning about their pure counter...
Predicate transformers are formalized in higher order logic. This gives a basis for mechanized reaso...
The standard Galois connection between the relational and predicate-transformer models of sequential...
General correctness, which subsumes partial and total correctness, is defined for both weakest prec...
The standard Galois connection [6, 3] between the relational [4] and predicate-transformer [1] model...
In some otherwise attractive formalisms, it can be difficult or even impossible to specify progress ...
AbstractThe behavior of a program can be modeled by describing how it transforms input states to out...
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 ...
We study relations between predicate transformers and multifunctions in a topological setting based ...
AbstractThis paper presents a treatment of pre- and post-conditions, and predicate transformers, in ...