Add to ORKGDijkstra's weakest precondition semantics, as presented in textbook form by Gries, may be viewed as an equational algebra. The problem then is to find a reasonable (set-theoric) model of this algebra. This paper provides one
AbstractSet constraints are relations between sets of ground terms over a given alphabet. They give ...
Abstract. We devise a generic framework where a weakest precondi-tion semantics, in the form of inde...
Abstract. We introduce a new kind of models for constructive set theories based on categories of pre...
In expounding the notions of pre- and postconditions, of termination and nontermination, of correctn...
AbstractDijkstra and Scholten (1990) present an axiomatic semantics for Dijkstra's guarded command l...
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...
The lack of a method for developing programs from Z specifications is a difficulty widely recognised...
The lack of a method for developing programs from Z specifications is a widely recognized difficulty...
In proof theory, a standard method for showing the correctness of a program w.r.t. given pre- and po...
In proof theory, a standard method for showing the correctness of a program w.r.t. given pre- and po...
Abstract. The Dijkstra monad has been introduced recently for cap-turing weakest precondition comput...
I am indebted to Prof. Edsgar Dijkstra for introducing me to weakest preconditions, Prof. J Moore fo...
AbstractWe present a purely syntactical definition of E.W. Dijkstra's predicate transformer wp for n...
Part 2: Regular ContributionsInternational audienceThe Dijkstra monad has been introduced recently f...
AbstractSet constraints are relations between sets of ground terms over a given alphabet. They give ...
Abstract. We devise a generic framework where a weakest precondi-tion semantics, in the form of inde...
Abstract. We introduce a new kind of models for constructive set theories based on categories of pre...
In expounding the notions of pre- and postconditions, of termination and nontermination, of correctn...
AbstractDijkstra and Scholten (1990) present an axiomatic semantics for Dijkstra's guarded command l...
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...
The lack of a method for developing programs from Z specifications is a difficulty widely recognised...
The lack of a method for developing programs from Z specifications is a widely recognized difficulty...
In proof theory, a standard method for showing the correctness of a program w.r.t. given pre- and po...
In proof theory, a standard method for showing the correctness of a program w.r.t. given pre- and po...
Abstract. The Dijkstra monad has been introduced recently for cap-turing weakest precondition comput...
I am indebted to Prof. Edsgar Dijkstra for introducing me to weakest preconditions, Prof. J Moore fo...
AbstractWe present a purely syntactical definition of E.W. Dijkstra's predicate transformer wp for n...
Part 2: Regular ContributionsInternational audienceThe Dijkstra monad has been introduced recently f...
AbstractSet constraints are relations between sets of ground terms over a given alphabet. They give ...
Abstract. We devise a generic framework where a weakest precondi-tion semantics, in the form of inde...
Abstract. We introduce a new kind of models for constructive set theories based on categories of pre...