Weakest liberal precondition

From Wikipedia, the free encyclopedia

You have new messages (last change).

A weakest liberal precondition (wlp) is an extension of the concept of weakest precondition by E. W. Dijkstra for proofs about computer programs.

[edit] References

Marcello M. Bonsangue and Joost N. Kok, The weakest precondition calculus: Recursion and duality, Formal Aspects of Computing, 6(6):788–800, November 1994. DOI 10.1007/BF01213603.

This computer science-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "http://en.wikipedia.org../../../w/e/a/Weakest_liberal_precondition.html"

Categories: Computer science stubs | Formal methods | Logic in computer science | Theoretical computer science

Views

interaction

Search