dc.contributor.author |
McIver, AK
|
|
dc.contributor.author |
Morgan, C
|
|
dc.contributor.author |
Sanders, JW
|
|
dc.date.accessioned |
2018-06-06T10:03:32Z |
|
dc.date.available |
2018-06-06T10:03:32Z |
|
dc.date.issued |
1997 |
|
dc.identifier.citation |
McIver AK, Morgan C & Sanders JW (1997) Application-oriented program semantics. South African Computer Journal, Number 19, 1997 |
en |
dc.identifier.issn |
2313-7835 |
|
dc.identifier.uri |
http://hdl.handle.net/10500/24258 |
|
dc.description.abstract |
This paper abridges lecture notes from WOFACS 96. It provides semantic models for a variety of programming and development formalisms, showing how different models for the same formalism are related by Galois connections. The formalisms are: the language of guarded commands and its refinement calculus; communicating sequential processes; and probabilistic imperative code. The semantic models include: binary relations; predicate transformers; traces; failures; and distributions. In each case, denotations of code are characterised, in the more general specification space, by the healthiness conditions they satisfy. Models are evaulated for their elegance, expressive power and calculational facility.
Expanded notes containing proofs, an extra chapter on data refinement and exercises for each chapter, are available from the authors. |
en |
dc.language.iso |
en |
en |
dc.publisher |
South African Computer Society (SAICSIT) |
en |
dc.subject |
Semantics |
en |
dc.subject |
Formal methods |
en |
dc.subject |
Refinement |
en |
dc.subject |
Data refinement |
en |
dc.subject |
Process algebra |
en |
dc.subject |
Probability |
en |
dc.subject |
Galois connection |
en |
dc.subject |
Binary relations |
en |
dc.subject |
Predicate transformers |
en |
dc.title |
Application-oriented program semantics |
en |
dc.type |
Article |
en |