{"id":{"repo_id":"cape-town","oai_identifier":"oai:open.uct.ac.za:11427/23363"},"canonical_url":"https://search.dev.ndltd.org/etd/cape-town/oai:open.uct.ac.za:11427/23363","repository":{"repo_id":"cape-town","name":"University of Cape Town","base_url":"https://open.uct.ac.za/oai/request"},"display":{"title":"Modelling the algebra of weakest preconditions","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Rewitzky, Ingrid Moira"],"institution":"Department of Mathematics and Applied Mathematics","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Brink, Chris"],"committee_chairs":[],"committee_members":[],"year":1991,"date_issued":"1991","date_published":"1991","updated_at":"2026-07-22T22:23:05Z","subjects":[],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11427/23363","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Brink, Chris"]},{"key":"dc:creator","label":"Author","values":["Rewitzky, Ingrid Moira"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2017-01-26T11:33:17Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2017-01-26T11:33:17Z"]},{"key":"dc:date.issued","label":"Date","values":["1991"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Department of Mathematics and Applied Mathematics"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Cape Town"]},{"key":"dc:type","label":"Dc Type","values":["Master Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["Masters"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["MSc"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11427/23363"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Modelling the algebra of weakest preconditions"]}]}],"canonical_facts":{"dc:contributor.advisor":["Brink, Chris"],"dc:creator":["Rewitzky, Ingrid Moira"],"dc:date.accessioned":["2017-01-26T11:33:17Z"],"dc:date.available":["2017-01-26T11:33:17Z"],"dc:date.issued":["1991"],"dc:description.abstract":["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."],"dc:identifier.uri":["http://hdl.handle.net/11427/23363"],"dc:language.iso":["eng"],"dc:publisher.department":["Department of Mathematics and Applied Mathematics"],"dc:publisher.institution":["University of Cape Town"],"dc:title":["Modelling the algebra of weakest preconditions"],"dc:type":["Master Thesis"],"dc:type.qualificationlevel":["Masters"],"dc:type.qualificationname":["MSc"]},"updated_at":"2026-07-22T22:23:05Z"}