Modelling the algebra of weakest preconditions

Simple item page
dc.contributor.advisorBrink, Chrisen_ZA
dc.contributor.authorRewitzky, Ingrid Moiraen_ZA
dc.date.accessioned2017-01-26T11:33:17Z
dc.date.available2017-01-26T11:33:17Z
dc.date.issued1991en_ZA
dc.date.updated2016-11-22T10:40:57Z
dc.description.abstractIn 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.en_ZA
dc.identifier.apacitationRewitzky, I. M. (1991). <i>Modelling the algebra of weakest preconditions</i>. (Thesis). University of Cape Town ,Faculty of Science ,Department of Mathematics and Applied Mathematics. Retrieved from http://hdl.handle.net/11427/23363en_ZA
dc.identifier.chicagocitationRewitzky, Ingrid Moira. <i>"Modelling the algebra of weakest preconditions."</i> Thesis., University of Cape Town ,Faculty of Science ,Department of Mathematics and Applied Mathematics, 1991. http://hdl.handle.net/11427/23363en_ZA
dc.identifier.citationRewitzky, I. 1991. Modelling the algebra of weakest preconditions. University of Cape Town.en_ZA
dc.identifier.ris TY - Thesis / Dissertation AU - Rewitzky, Ingrid Moira AB - 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. DA - 1991 DB - OpenUCT DP - University of Cape Town LK - https://open.uct.ac.za PB - University of Cape Town PY - 1991 T1 - Modelling the algebra of weakest preconditions TI - Modelling the algebra of weakest preconditions UR - http://hdl.handle.net/11427/23363 ER - en_ZA
dc.identifier.urihttp://hdl.handle.net/11427/23363
dc.identifier.vancouvercitationRewitzky IM. Modelling the algebra of weakest preconditions. [Thesis]. University of Cape Town ,Faculty of Science ,Department of Mathematics and Applied Mathematics, 1991 [cited yyyy month dd]. Available from: http://hdl.handle.net/11427/23363en_ZA
dc.language.isoengen_ZA
dc.publisher.departmentDepartment of Mathematics and Applied Mathematicsen_ZA
dc.publisher.facultyFaculty of Scienceen_ZA
dc.publisher.institutionUniversity of Cape Town
dc.subject.otherMathematicsen_ZA
dc.titleModelling the algebra of weakest preconditionsen_ZA
dc.typeMaster Thesis
dc.type.qualificationlevelMasters
dc.type.qualificationnameMScen_ZA
uct.type.publicationResearchen_ZA
uct.type.resourceThesisen_ZA
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Rewitzky_Modelling_algebra_1991.pdf
Size:
3.12 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.72 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Masters