{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/69596"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/69596","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Executing Quantifiers in FASE Specifications","abstract":"FASE is a system for writing and testing data type specifications based upon a method known as final algebra specification. FASE specifications are highly abstract, yet to a great extent executable. The difficulty with executing FASE specifications arises from the inclusion of unrestricted quantification over infinite domains in the FASE specification language. Quantifiers not only provide an extremely powerful language constuct, but due to the highly abstract nature of the FASE specification method, some specifications cannot be written without the use of quantifiers. This dissertation describes a method for executing FASE specifications, which in many instances is capable of handling unrestricted quantification.","abstract_html":"FASE is a system for writing and testing data type specifications based upon a method known as final algebra specification. FASE specifications are highly abstract, yet to a great extent executable. The difficulty with executing FASE specifications arises from the inclusion of unrestricted quantification over infinite domains in the FASE specification language. Quantifiers not only provide an extremely powerful language constuct, but due to the highly abstract nature of the FASE specification method, some specifications cannot be written without the use of quantifiers. This dissertation describes a method for executing FASE specifications, which in many instances is capable of handling unrestricted quantification.","abstract_has_math":false,"creators":["Jefferson, Stanley Ted"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Kamin, Samuel N."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-15T19:26:05Z","date_published":"2014-12-15T19:26:05Z","updated_at":"2026-07-22T22:26:01Z","subjects":["Computer Science"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8823155"],"render_values":[{"text":"(UMI)AAI8823155","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/69596","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kamin, Samuel N."]},{"key":"dc:creator","label":"Author","values":["Jefferson, Stanley Ted"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-15T19:26:05Z","10000-01-01","1988"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/69596","(UMI)AAI8823155"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["FASE is a system for writing and testing data type specifications based upon a method known as final algebra specification. FASE specifications are highly abstract, yet to a great extent executable. The difficulty with executing FASE specifications arises from the inclusion of unrestricted quantification over infinite domains in the FASE specification language. Quantifiers not only provide an extremely powerful language constuct, but due to the highly abstract nature of the FASE specification method, some specifications cannot be written without the use of quantifiers. This dissertation describes a method for executing FASE specifications, which in many instances is capable of handling unrestricted quantification.","Made available in DSpace on 2014-12-15T19:26:05Z (GMT). No. of bitstreams: 1 8823155.pdf: 6019763 bytes, checksum: 42081cff250e0bbea7fcb983c707b4de (MD5) Previous issue date: 1988","Embargo set by: Seth Robbins for item 69762 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","176 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988."]},{"key":"dc:title","label":"Title","values":["Executing Quantifiers in FASE Specifications"]}]}],"canonical_facts":{"dc:contributor":["Kamin, Samuel N."],"dc:creator":["Jefferson, Stanley Ted"],"dc:date":["2014-12-15T19:26:05Z","10000-01-01","1988"],"dc:description":["FASE is a system for writing and testing data type specifications based upon a method known as final algebra specification. FASE specifications are highly abstract, yet to a great extent executable. The difficulty with executing FASE specifications arises from the inclusion of unrestricted quantification over infinite domains in the FASE specification language. Quantifiers not only provide an extremely powerful language constuct, but due to the highly abstract nature of the FASE specification method, some specifications cannot be written without the use of quantifiers. This dissertation describes a method for executing FASE specifications, which in many instances is capable of handling unrestricted quantification.","Made available in DSpace on 2014-12-15T19:26:05Z (GMT). No. of bitstreams: 1 8823155.pdf: 6019763 bytes, checksum: 42081cff250e0bbea7fcb983c707b4de (MD5) Previous issue date: 1988","Embargo set by: Seth Robbins for item 69762 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","176 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988."],"dc:identifier":["http://hdl.handle.net/2142/69596","(UMI)AAI8823155"],"dc:subject":["Computer Science"],"dc:title":["Executing Quantifiers in FASE Specifications"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:01Z"}