Add to ORKGPredicate 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
This technical report contains detailed definitions, auxiliary lemmas, main theorems, and proofs rel...
General correctness, which subsumes partial and total correctness, is defined for both weakest prec...
AbstractCompositionality is of great practical importance when building systems from individual comp...
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 ...
In this paper we propose a calculus for reasoning about concurrent programs inspired by the wp calcu...
AbstractIn this paper we propose a calculus for reasoning about concurrent programs inspired by the ...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
AbstractThe behavior of a program can be modeled by describing how it transforms input states to out...
In expounding the notions of pre- and postconditions, of termination and nontermination, of correctn...
AbstractThe complete lattice of monotonic predicate transformers is interpreted as a command languag...
Predicate transformers are formalized in higher order logic. This gives a basis for mechanized reaso...
AbstractData refinement is the systematic substitution of one data type for another in a program. Us...
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...
This technical report contains detailed definitions, auxiliary lemmas, main theorems, and proofs rel...
General correctness, which subsumes partial and total correctness, is defined for both weakest prec...
AbstractCompositionality is of great practical importance when building systems from individual comp...
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 ...
In this paper we propose a calculus for reasoning about concurrent programs inspired by the wp calcu...
AbstractIn this paper we propose a calculus for reasoning about concurrent programs inspired by the ...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
AbstractThe behavior of a program can be modeled by describing how it transforms input states to out...
In expounding the notions of pre- and postconditions, of termination and nontermination, of correctn...
AbstractThe complete lattice of monotonic predicate transformers is interpreted as a command languag...
Predicate transformers are formalized in higher order logic. This gives a basis for mechanized reaso...
AbstractData refinement is the systematic substitution of one data type for another in a program. Us...
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...
This technical report contains detailed definitions, auxiliary lemmas, main theorems, and proofs rel...
General correctness, which subsumes partial and total correctness, is defined for both weakest prec...
AbstractCompositionality is of great practical importance when building systems from individual comp...