AbstractWe present a purely syntactical definition of E.W. Dijkstra's predicate transformer wp for nondeterministic while-programs in infinitary logic. Then we show that it is sound with respect to a definition of weakest preconditions given in terms of denotational semantics
The behavior of a program can be modeled by describing how it transforms input states to output stat...
Predicate transformers that map the postcondition and all intermediate conditions of a command to a ...
Part 2: Regular ContributionsInternational audienceThe Dijkstra monad has been introduced recently f...
AbstractDijkstra and Scholten (1990) present an axiomatic semantics for Dijkstra's guarded command l...
It is important to define and relate different semantic methods. In particular it is interesting to...
AbstractWe present a purely syntactical but nevertheless handy definition of Dijkstra's predicate tr...
I am indebted to Prof. Edsgar Dijkstra for introducing me to weakest preconditions, Prof. J Moore fo...
AbstractIn Keimel et al. (2009) [5] we have systematically derived a predicate transformer semantics...
Abstract. The Dijkstra monad has been introduced recently for cap-turing weakest precondition comput...
Dijkstra's weakest pre-condition formalism for proving correctness of programs is modified and exten...
Abstract. In proof theory, a standard method for showing the correct-ness of a program w.r.t. given ...
Abstract In proof theory, a standard method for showing the correct-ness of a program w.r.t. given p...
In expounding the notions of pre- and postconditions, of termination and nontermination, of correctn...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
We develop the semantics of a language with arbitrary atomic statements, unbounded nondeterminacy, a...
The behavior of a program can be modeled by describing how it transforms input states to output stat...
Predicate transformers that map the postcondition and all intermediate conditions of a command to a ...
Part 2: Regular ContributionsInternational audienceThe Dijkstra monad has been introduced recently f...
AbstractDijkstra and Scholten (1990) present an axiomatic semantics for Dijkstra's guarded command l...
It is important to define and relate different semantic methods. In particular it is interesting to...
AbstractWe present a purely syntactical but nevertheless handy definition of Dijkstra's predicate tr...
I am indebted to Prof. Edsgar Dijkstra for introducing me to weakest preconditions, Prof. J Moore fo...
AbstractIn Keimel et al. (2009) [5] we have systematically derived a predicate transformer semantics...
Abstract. The Dijkstra monad has been introduced recently for cap-turing weakest precondition comput...
Dijkstra's weakest pre-condition formalism for proving correctness of programs is modified and exten...
Abstract. In proof theory, a standard method for showing the correct-ness of a program w.r.t. given ...
Abstract In proof theory, a standard method for showing the correct-ness of a program w.r.t. given p...
In expounding the notions of pre- and postconditions, of termination and nontermination, of correctn...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
We develop the semantics of a language with arbitrary atomic statements, unbounded nondeterminacy, a...
The behavior of a program can be modeled by describing how it transforms input states to output stat...
Predicate transformers that map the postcondition and all intermediate conditions of a command to a ...
Part 2: Regular ContributionsInternational audienceThe Dijkstra monad has been introduced recently f...
DOI
Add to ORKG