Modelling the algebra of weakest preconditions

dc.contributor.author	Brink, C
dc.contributor.author	Rewitzky, I
dc.date.accessioned	2018-05-20T00:51:38Z
dc.date.available	2018-05-20T00:51:38Z
dc.date.issued	1992
dc.identifier.citation	Brink C & Rewitzky I (1992) Modelling the algebra of weakest preconditions. South African Computer Journal, Number 6, 1992	en
dc.identifier.issn	2313-7835
dc.identifier.uri	http://hdl.handle.net/10500/23956
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-theoretic ) model of this algebra. This paper provides one.	en
dc.language		en
dc.language.iso	en	en
dc.publisher	th African Institute of Computer Scientists and Information Technologists	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
dc.type	Article	en