{"id":{"repo_id":"glasgow","oai_identifier":"oai:theses.gla.ac.uk:75641"},"canonical_url":"https://search.ndltd.org/etd/glasgow/oai:theses.gla.ac.uk:75641","repository":{"repo_id":"glasgow","name":"University of Glasgow","base_url":"https://theses.gla.ac.uk/cgi/oai2"},"display":{"title":"A precise semantics for ultraloose specifications","abstract":"All formal specifiers face the danger of overspecification: accidentally writing an overly restrictive specification. This problem is particularly acute for axiomatic specifications because it is so easy to write axioms which hold for some of the intended implementations but not for all of them (or, rather, it is so hard not to write overly strong axioms). One of the best developed ways of recovering some of those implementations which do not literally satisfy the specification is to apply a \"behavioural abstraction operator\" to a specification: adding in those implementations which have the same \"behaviour\" as an implementation which does satisfy the specification. In two recent papers Wirsing and Broy propose an alternative (and apparently simpler) approach which they call \"ultraloose specification.\" This approach is based on a particular style of writing axioms which avoids certain forms of overspecification. An important, unanswered question is \"How does the ultraloose approach re-late to the other solutions?\" The major achievement of this thesis is a proof that the ultraloose approach is semantically equivalent to the use of the \"behavioural abstraction operator.\" This result is rather surprising in the light of a result by Schoett which seems to say that such a result is impossible.","abstract_html":"All formal specifiers face the danger of overspecification: accidentally writing an overly restrictive specification. This problem is particularly acute for axiomatic specifications because it is so easy to write axioms which hold for some of the intended implementations but not for all of them (or, rather, it is so hard not to write overly strong axioms). One of the best developed ways of recovering some of those implementations which do not literally satisfy the specification is to apply a &quot;behavioural abstraction operator&quot; to a specification: adding in those implementations which have the same &quot;behaviour&quot; as an implementation which does satisfy the specification. In two recent papers Wirsing and Broy propose an alternative (and apparently simpler) approach which they call &quot;ultraloose specification.&quot; This approach is based on a particular style of writing axioms which avoids certain forms of overspecification. An important, unanswered question is &quot;How does the ultraloose approach re-late to the other solutions?&quot; The major achievement of this thesis is a proof that the ultraloose approach is semantically equivalent to the use of the &quot;behavioural abstraction operator.&quot; This result is rather surprising in the light of a result by Schoett which seems to say that such a result is impossible.","abstract_has_math":false,"creators":["Reid, Alastair D."],"institution":"University of Glasgow","degree_name":null,"degree_level":"MSc(R)","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1993,"date_issued":"1993","date_published":"1993","updated_at":"2026-11-19T08:30:34Z","subjects":["QA75 Electronic computers. Computer science"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/10.5525/gla.thesis.75641","outbound_label":"DOI","outbound_source":"dc:identifier.doi","record_url":"https://doi.org/10.5525/gla.thesis.75641","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier.doi","download_url":"https://theses.gla.ac.uk/75641/1/13833768.pdf","download_label":"Download PDF","download_source":"dc:identifier.uri","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://theses.gla.ac.uk/cgi/oai2?verb=GetRecord&metadataPrefix=uketd_dc&identifier=oai%3Atheses.gla.ac.uk%3A75641","prefix":"uketd_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Reid, Alastair D."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["1993"]},{"key":"dc:date.issued","label":"Date","values":["1993"]},{"key":"dc:publisher.commercial","label":"Dc Publisher Commercial","values":["ProQuest Dissertations & Theses,"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Department not provided."]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Glasgow"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://theses.gla.ac.uk/75641/"]},{"key":"dc:relation.isreferencedby.uri","label":"Dc Relation Isreferencedby URI","values":["https://gla.on.worldcat.org/oclc/181859241"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["MSc(R)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["QA75 Electronic computers. Computer science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.doi","label":"DOI","values":["10.5525/gla.thesis.75641"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://theses.gla.ac.uk/75641/1/13833768.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["All formal specifiers face the danger of overspecification: accidentally writing an overly restrictive specification. This problem is particularly acute for axiomatic specifications because it is so easy to write axioms which hold for some of the intended implementations but not for all of them (or, rather, it is so hard not to write overly strong axioms). One of the best developed ways of recovering some of those implementations which do not literally satisfy the specification is to apply a \"behavioural abstraction operator\" to a specification: adding in those implementations which have the same \"behaviour\" as an implementation which does satisfy the specification. In two recent papers Wirsing and Broy propose an alternative (and apparently simpler) approach which they call \"ultraloose specification.\" This approach is based on a particular style of writing axioms which avoids certain forms of overspecification. An important, unanswered question is \"How does the ultraloose approach re-late to the other solutions?\" The major achievement of this thesis is a proof that the ultraloose approach is semantically equivalent to the use of the \"behavioural abstraction operator.\" This result is rather surprising in the light of a result by Schoett which seems to say that such a result is impossible."]},{"key":"dc:format","label":"Dc Format","values":["pdf"]},{"key":"dcterms:accessrights","label":"Dcterms Accessrights","values":["public"]},{"key":"dc:title","label":"Title","values":["A precise semantics for ultraloose specifications"]}]}],"canonical_facts":{"dc:creator":["Reid, Alastair D."],"dc:date":["1993"],"dc:date.issued":["1993"],"dc:description.abstract":["All formal specifiers face the danger of overspecification: accidentally writing an overly restrictive specification. This problem is particularly acute for axiomatic specifications because it is so easy to write axioms which hold for some of the intended implementations but not for all of them (or, rather, it is so hard not to write overly strong axioms). One of the best developed ways of recovering some of those implementations which do not literally satisfy the specification is to apply a \"behavioural abstraction operator\" to a specification: adding in those implementations which have the same \"behaviour\" as an implementation which does satisfy the specification. In two recent papers Wirsing and Broy propose an alternative (and apparently simpler) approach which they call \"ultraloose specification.\" This approach is based on a particular style of writing axioms which avoids certain forms of overspecification. An important, unanswered question is \"How does the ultraloose approach re-late to the other solutions?\" The major achievement of this thesis is a proof that the ultraloose approach is semantically equivalent to the use of the \"behavioural abstraction operator.\" This result is rather surprising in the light of a result by Schoett which seems to say that such a result is impossible."],"dc:format":["pdf"],"dc:identifier.doi":["10.5525/gla.thesis.75641"],"dc:identifier.uri":["https://theses.gla.ac.uk/75641/1/13833768.pdf"],"dc:language":["en"],"dc:publisher.commercial":["ProQuest Dissertations & Theses,"],"dc:publisher.department":["Department not provided."],"dc:publisher.institution":["University of Glasgow"],"dc:relation.isreferencedby":["https://theses.gla.ac.uk/75641/"],"dc:relation.isreferencedby.uri":["https://gla.on.worldcat.org/oclc/181859241"],"dc:subject":["QA75 Electronic computers. Computer science"],"dcterms:accessrights":["public"],"dc:title":["A precise semantics for ultraloose specifications"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["MSc(R)"]},"updated_at":"2026-11-19T08:30:34Z"}