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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

Analysis and manipulation of trained neural networks is a challenging and important problem. We propose a symbolic representation…

2015

We study the description logic ALCQIO, which extends the standard description logic ALC with nominals, inverses and counting…

2012

The main objective of this article is to propose a methodology for prioritizing actions in predictive maintenance substation…

2010

Poor power quality of single-phase electric railway systems with industrial three-phase power supply will result in extra line…

2009

An extension to action systems is presented facilitating the modeling of continuous behavior in the discrete domain. The original…

2006

The design of control systems is usually based on diagrammatic definitions of control laws. The independent use of Z and CSP to…

1998

Abstract. In the refinement calculus, program statements are modelled as predicate transformers. A product operator for predicate…

1995

We apply Dijkstra's semantics for programming languages to formalization of reasoning about action and change. The basic idea is…

1994

We present a weakest preconditions calculus a la Dijkstra for a small common kernel of existing data-parallel languages. We use…

1983

SummaryA proof rule for the procedure call is derived for procedures with value, result and value-result parameters. It is…