Predicate transformer semantics (PTS) has proved to be very fruitful, in particular for program derivation. It is well known, although not very well documented, that the version of PTS with universal conjunctivity for wlp and without the law of the excluded miracle is equivalent to some relation semantics (RS)
The invariant based programming is a technique of constructing correct programs by first identifying...
This stand-alone Python program is an implementation of the translation from First-Order Predicate L...
Reynolds\u27 abstraction theorem shows how a typing judgement in System F can be translated into a r...
Predicate transformer semantics (PTS) has proved to be very fruitful, in particular for program deri...
Reasoning about programs that use effects can be much harder than reasoning about their pure counter...
The behavior of a program can be modeled by describing how it transforms input states to output stat...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
The standard Galois connection [6, 3] between the relational [4] and predicate-transformer [1] model...
International audienceIn the refinement calculus, monotonic predicate transformers are used to model...
The standard Galois connection between the relational and predicate-transformer models of sequential...
Contains fulltext : 84487.pdf (author's version ) (Open Access)Joint International...
This paper describes how to verify a parser for regular expressions in a functional programming lang...
We manually created a semantic taxonomy called Phased Predicate Template Taxonomy (PPTT) that covers...
In the semantics of programming languages one can view programs as statetransformers, or as predicat...
Given a general definition of the procedure call based on the substitution rule for assignment, a g...
The invariant based programming is a technique of constructing correct programs by first identifying...
This stand-alone Python program is an implementation of the translation from First-Order Predicate L...
Reynolds\u27 abstraction theorem shows how a typing judgement in System F can be translated into a r...
Predicate transformer semantics (PTS) has proved to be very fruitful, in particular for program deri...
Reasoning about programs that use effects can be much harder than reasoning about their pure counter...
The behavior of a program can be modeled by describing how it transforms input states to output stat...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
The standard Galois connection [6, 3] between the relational [4] and predicate-transformer [1] model...
International audienceIn the refinement calculus, monotonic predicate transformers are used to model...
The standard Galois connection between the relational and predicate-transformer models of sequential...
Contains fulltext : 84487.pdf (author's version ) (Open Access)Joint International...
This paper describes how to verify a parser for regular expressions in a functional programming lang...
We manually created a semantic taxonomy called Phased Predicate Template Taxonomy (PPTT) that covers...
In the semantics of programming languages one can view programs as statetransformers, or as predicat...
Given a general definition of the procedure call based on the substitution rule for assignment, a g...
The invariant based programming is a technique of constructing correct programs by first identifying...
This stand-alone Python program is an implementation of the translation from First-Order Predicate L...
Reynolds\u27 abstraction theorem shows how a typing judgement in System F can be translated into a r...
DOI
Add to ORKG