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)

Related topics

Related topics

41 relations
Abstract interpretationAbstract syntaxAlgorithmAutomated reasoning

Broader (1)

Formal methods

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
A Symbolic Neural Network Representation and its Application to Understanding, Verifying, and Patching Networks
Analysis and manipulation of trained neural networks is a challenging and important problem. We propose a symbolic representation… 
2015
2015
Extending ALCQIO with Trees
We study the description logic ALCQIO, which extends the standard description logic ALC with nominals, inverses and counting… 
2012
2012
Substation power transformer risk management: Reflecting On reliability centered maintenance and monitoring
The main objective of this article is to propose a methodology for prioritizing actions in predictive maintenance substation… 
2011
2011
Efficient Directionless Weakest Preconditions
Verification condition (VC) generation is a fundamental part of many program analysis and applications, including proving program… 
2010
2010
Development and Implementation of a Prototype for Co-phase Traction Power Supply System
Poor power quality of single-phase electric railway systems with industrial three-phase power supply will result in extra line… 
2006
2006
Verification of control systems using Circus
The design of control systems is usually based on diagrammatic definitions of control laws. The independent use of Z and CSP to… 
1998
1998
Fusion and simultaneous execution in the refinement calculus
Abstract. In the refinement calculus, program statements are modelled as predicate transformers. A product operator for predicate… 
1994
1994
On the Expressivity of a Weakest Precondition Calculus for a Simple Data-Parallel Programming Language
We present a weakest preconditions calculus a la Dijkstra for a small common kernel of existing data-parallel languages. We use… 
1992
1992
An object-oriented refinement calculus with modular reasoning
In this thesis, the refinement calculus is extended to support a variety of object-oriented programming styles. The late binding… 
Review
1978
Review
1978
Computer programming methodology
This book deals with the philosophy of programming and the proper approach to the construction of high quality systems, within… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)