UVicSpace

Classified models for software engineering

Show simple item record

dc.contributor.author Stuart, Gordon F.
dc.date.accessioned 2005-09-30T23:55:00Z
dc.date.available 2005-09-30T23:55:00Z
dc.date.copyright 1991 en
dc.date.issued 2005-09-30T23:55:00Z
dc.identifier.uri http://hdl.handle.net/1828/39
dc.description.abstract In 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.extent 277832 bytes
dc.format.extent 832518 bytes
dc.format.extent 928455 bytes
dc.format.extent 758389 bytes
dc.format.extent 472750 bytes
dc.format.extent 334212 bytes
dc.format.extent 388286 bytes
dc.format.extent 656434 bytes
dc.format.extent 170772 bytes
dc.format.extent 750651 bytes
dc.format.extent 201649 bytes
dc.format.mimetype application/pdf
dc.format.mimetype application/pdf
dc.format.mimetype application/pdf
dc.format.mimetype application/pdf
dc.format.mimetype application/pdf
dc.format.mimetype application/pdf
dc.format.mimetype application/pdf
dc.format.mimetype application/pdf
dc.format.mimetype application/pdf
dc.format.mimetype application/pdf
dc.format.mimetype application/pdf
dc.language English eng
dc.language.iso en en
dc.rights Available for World Wide Web en
dc.subject Abstract data types en
dc.subject Proof theory en
dc.subject Software engineering en
dc.subject Specification language en
dc.subject ADT en
dc.title Classified models for software engineering en
dc.type Thesis en
dc.contributor.supervisor Wadge, William W.
dc.degree.department Dept. of Computer Science en
dc.degree.level Doctor of Philosophy Ph.D. en


Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record

Search UVicSpace


Browse

My Account

Statistics

Help