Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Modelling the algebra of weakest preconditions
In expounding the notions of pre- and postconditions, of termination and nontermination, of correctness and of predicate transformers I found that the same trivalent distinction played a major role in all contexts. Namely: Initialisation properties: An execution of a program always, sometimes or nev...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
Department of Mathematics and Applied Mathematics
2017
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867613244803252225 |
|---|---|
| access_status_str | Open Access |
| author | Rewitzky, Ingrid Moira |
| author2 | Brink, Chris |
| author_browse | Brink, Chris Rewitzky, Ingrid Moira |
| author_facet | Brink, Chris Rewitzky, Ingrid Moira |
| author_sort | Rewitzky, Ingrid Moira |
| collection | Thesis |
| description | In expounding the notions of pre- and postconditions, of termination and nontermination, of correctness and of predicate transformers I found that the same trivalent distinction played a major role in all contexts. Namely: Initialisation properties: An execution of a program always, sometimes or never starts from an initial state. Termination/nontermination properties: If it starts, the execution always, sometimes or never terminates. Clean-/messy termination properties: A terminating execution always, sometimes or never terminates cleanly. Final state properties: All, some or no final states of α from s have a given property. |
| format | Thesis |
| id | oai:open.uct.ac.za:11427/23363 |
| institution | University of Cape Town (South Africa) |
| language | eng |
| last_indexed | 2026-06-10T12:33:04.194Z |
| license_str | Not specified — see source repository |
| provenance_str_mv | Harvested via OAI-PMH from UCTD — University of Cape Town Open Access Repository |
| publishDate | 2017 |
| publishDateRange | 2017 |
| publishDateSort | 2017 |
| publisher | Department of Mathematics and Applied Mathematics |
| publisherStr | Department of Mathematics and Applied Mathematics |
| record_format | dspace |
| source_str | UCTD — University of Cape Town Open Access Repository |
| spelling | oai:open.uct.ac.za:11427/23363 Modelling the algebra of weakest preconditions Rewitzky, Ingrid Moira Brink, Chris Mathematics In expounding the notions of pre- and postconditions, of termination and nontermination, of correctness and of predicate transformers I found that the same trivalent distinction played a major role in all contexts. Namely: Initialisation properties: An execution of a program always, sometimes or never starts from an initial state. Termination/nontermination properties: If it starts, the execution always, sometimes or never terminates. Clean-/messy termination properties: A terminating execution always, sometimes or never terminates cleanly. Final state properties: All, some or no final states of α from s have a given property. 2017-01-26T11:33:17Z 2017-01-26T11:33:17Z 1991 2016-11-22T10:40:57Z Master Thesis Masters MSc http://hdl.handle.net/11427/23363 eng application/pdf Department of Mathematics and Applied Mathematics Faculty of Science University of Cape Town |
| spellingShingle | Mathematics Rewitzky, Ingrid Moira Modelling the algebra of weakest preconditions |
| thesis_degree_str | Master's |
| title | Modelling the algebra of weakest preconditions |
| title_full | Modelling the algebra of weakest preconditions |
| title_fullStr | Modelling the algebra of weakest preconditions |
| title_full_unstemmed | Modelling the algebra of weakest preconditions |
| title_short | Modelling the algebra of weakest preconditions |
| title_sort | modelling the algebra of weakest preconditions |
| topic | Mathematics |
| url | http://hdl.handle.net/11427/23363 |
| work_keys_str_mv | AT rewitzkyingridmoira modellingthealgebraofweakestpreconditions |