Skip to search formSkip to main contentSkip to account menu

Predicate transformer semantics

Known as: Weakest liberal precondition, Weakest precondition, WLP 
Predicate transformer semantics have been introduced by Dijkstra in his seminal paper "Guarded commands, nondeterminacy and formal derivation of… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Analysis and manipulation of trained neural networks is a challenging and important problem. We propose a symbolic representation… 
2002
2002
Circus is a combination of Z and CSP; its chief distinguishing feature is the inclusion of the ideas of the refinement calculus… 
2001
2001
The B notation [1] was developed by Jean-Raymond Abrial. It supports a large segment of the development life cycle, from… 
2000
2000
In this paper we show how the Cryptographic Protocol Analysis Language Evaluation System (CPALES) was used in the analysis of the… 
1998
1998
In this thesis we propose the use of Dijkstra’s concept of a predicate transformer [Dij75] for the determination of database… 
1998
1998
There are basically two approaches to the veriication of reactive systems, the algorithmic approach on one hand and the deductive… 
1997
1997
GOODS to appear on the stage.- Balloon types: Controlling sharing of state in data types.- Static integrity constraint management… 
1993
1993
We present a procedure for deriving the weakest precondition for a database update and an integrity constraint. We show how to… 
Review
1988
Review
1988
Modal logic becomes action logic by adding programs as in propositional dynamic logic or the μ– calculus. Modal languages can be… 
1980
1980
An important and neglected program property is that the program executes cleanly, that is, without execution errors such as…