Modelling the algebra of weakest preconditions

dc.contributor.author	Brink, C
dc.contributor.author	Rewitzky, I
dc.contributor.editor	Linck, M.H.
dc.date.accessioned	2018-09-12T12:03:20Z
dc.date.available	2018-09-12T12:03:20Z
dc.date.issued	1991
dc.identifier.citation	Brink, C & Rewitsky, I (1991) Modelling the algebra of weakest preconditions. Proceedings of the 6th Southern African Computer Symposium, De Overberger Hotel, Caledon, 2-3 July 1991	en
dc.identifier.uri	http://hdl.handle.net/10500/24836
dc.description.abstract	Dijkstra's weakest precondition semantics, as presented in textbook form by Gries, may be viewed as an equational algebra. The problem then is to find a reasonable (set-theoric) model of this algebra. This paper provides one.	en
dc.language.iso	en	en
dc.subject	Guarded commands	en
dc.subject	Invariants	en
dc.subject	Predicate transformers	en
dc.subject	Weakest preconditions	en
dc.title	Modelling the algebra of weakest preconditions	en