AbstractWe present a purely syntactical but nevertheless handy definition of Dijkstra's predicate transformer wp in weak second-order logic. This formalization allows us to prove a normal form theorem of wp, from which interesting properties can be inferred. In particular, it turns out that wp(P,·) is a homomorphism on the class of formulae in the formalism considered
We develop the semantics of a language with arbitrary atomic statements, unbounded nondeterminacy, a...
International audienceWe consider non-interpreted functional programs: the result of the execution o...
Predicate transformer semantics (PTS) has proved to be very fruitful, in particular for program deri...
AbstractWe present a purely syntactical but nevertheless handy definition of Dijkstra's predicate tr...
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...
Abstract. The Dijkstra monad has been introduced recently for cap-turing weakest precondition comput...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
The Dijkstra and Hoare monads have been introduced recently for capturing weak-est precondition comp...
This paper presents a semantical analysis of the Weak Kleene Logics K3W and PWK from the tradition o...
It is important to define and relate different semantic methods. In particular it is interesting to...
We discuss relationships among the existence property, the disjunction property, and their weak vari...
Abstract. We provide a syntax and a derivation system for a formal language of mathematics called We...
In this paper, we study the expressive power of firstorder disjunctive logic programming (DLP) and n...
We present a class of first-order modal logics, called transformational logics, which are designed f...
We develop the semantics of a language with arbitrary atomic statements, unbounded nondeterminacy, a...
International audienceWe consider non-interpreted functional programs: the result of the execution o...
Predicate transformer semantics (PTS) has proved to be very fruitful, in particular for program deri...
AbstractWe present a purely syntactical but nevertheless handy definition of Dijkstra's predicate tr...
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...
Abstract. The Dijkstra monad has been introduced recently for cap-turing weakest precondition comput...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
The Dijkstra and Hoare monads have been introduced recently for capturing weak-est precondition comp...
This paper presents a semantical analysis of the Weak Kleene Logics K3W and PWK from the tradition o...
It is important to define and relate different semantic methods. In particular it is interesting to...
We discuss relationships among the existence property, the disjunction property, and their weak vari...
Abstract. We provide a syntax and a derivation system for a formal language of mathematics called We...
In this paper, we study the expressive power of firstorder disjunctive logic programming (DLP) and n...
We present a class of first-order modal logics, called transformational logics, which are designed f...
We develop the semantics of a language with arbitrary atomic statements, unbounded nondeterminacy, a...
International audienceWe consider non-interpreted functional programs: the result of the execution o...
Predicate transformer semantics (PTS) has proved to be very fruitful, in particular for program deri...
DOI
Add to ORKG