Classified models for software engineering

Simple item page
dc.contributor.authorStuart, Gordon F.
dc.contributor.supervisorWadge, William W.
dc.date.accessioned2005-09-30T23:55:00Z
dc.date.available2005-09-30T23:55:00Z
dc.date.copyright1991en
dc.date.issued2005-09-30T23:55:00Z
dc.degree.departmentDept. of Computer Scienceen
dc.degree.levelDoctor of Philosophy Ph.D.en
dc.description.abstractIn this dissertation it is shown that abstract data types (ADTs) can be specified by the Classified Model (CM) specification language - a first-order Horn language with equality and sort "classification" assertations. It is shown how these sort assertations generalize the traditional syntactic signatures of ADT specifications, resulting in all of the specification capability of traditional equational specifications, but with the improved expressibility of the Horn-with-equality language and additional theorem proving applications such as program synthesis. This work extends corresponding results from Many Sorted Algebra (MSA), Order Sorted Algebra (OSA) and Order Sorted Model (OSM) specification techniques by promoting their syntactic signatures to assertions in the Classified Model Specification language, yet retaining sorted quantification. It is shown how this solves MSA problems such as error values, polymorphism and subtypes in a way different from the OSA and OSM solutions. However, the CM technique retains the MSA and order sorted approach to parameterization. The CS generalization also suggests the use of CM specifications to axiomatize modules as a generalization of variables within Hoare Logic, with application to a restricted, but safe, use of procedures as state changing operations and functions as value returning operations of a module. CM proof theory and semantics are developed, including theorems for soundness, completeness and the existence of a free model.en
dc.format.extent277832 bytes
dc.format.extent832518 bytes
dc.format.extent928455 bytes
dc.format.extent758389 bytes
dc.format.extent472750 bytes
dc.format.extent334212 bytes
dc.format.extent388286 bytes
dc.format.extent656434 bytes
dc.format.extent170772 bytes
dc.format.extent750651 bytes
dc.format.extent201649 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1828/39
dc.languageEnglisheng
dc.language.isoenen
dc.rightsAvailable for World Wide Weben
dc.subjectAbstract data typesen
dc.subjectProof theoryen
dc.subjectSoftware engineeringen
dc.subjectSpecification languageen
dc.subjectADTen
dc.titleClassified models for software engineeringen
dc.typeThesisen

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
GordonStuartThesis.pdf
Size:
5.53 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.18 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Electronic Theses and Dissertations (ETD)
Theses (Computer Science)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.