Skip navigation
  • Home
  • Browse
    • Communities
      & Collections
    • Browse Items by:
    • Publication Date
    • Author
    • Title
    • Subject
    • Department
  • Sign on to:
    • My MacSphere
    • Receive email
      updates
    • Edit Profile


McMaster University Home Page
  1. MacSphere
  2. Open Access Dissertations and Theses Community
  3. Open Access Dissertations and Theses
Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/14018
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorNedialkov, Neden_US
dc.contributor.advisorWolfram Kahl, William Farmer, Spencer Smith, Emil Sekerinskien_US
dc.contributor.authorZheng, Bingzhouen_US
dc.contributor.authorZheng, Bingzhouen_US
dc.date.accessioned2014-06-18T17:06:02Z-
dc.date.available2014-06-18T17:06:02Z-
dc.date.created2014-02-08en_US
dc.date.issued2014-04en_US
dc.identifier.otheropendissertations/8849en_US
dc.identifier.other9872en_US
dc.identifier.other5088500en_US
dc.identifier.urihttp://hdl.handle.net/11375/14018-
dc.description.abstract<p>Interval arithmetic is used to enclose roundoff, truncation, and modeling errors in interval methods, thus obtaining numerical methods with automatic verification of the results. The Fundamental Theorem of Interval Arithmetic (FTIA) shows that, when evaluating an expression using interval arithmetic, the computed result contains the mathematically correct value of the expression.</p> <p>Decorations were introduced in the IEEE P1788 working group for standardizing interval arithmetic. Their role is to help track properties of interval evaluations. That is, we wish to say if a function is defined, undefined, or continuous in its inputs. Moreover, decorations act as local exception flags and do not lead to interruption of the computations. The FTIA plus the decoration system is expanded into the Fundamental Theorem of Decorated Interval Arithmetic (FTDIA).</p> <p>Several versions of this theorem are formulated and proved by J. Pryce. This thesis formalizes and proves the core of this theorem (version 3.0 of the IEEE-P1788 proposal) using the theorem prover Coq. Namely, we prove it for the common case where all the inputs to a function are non-empty intervals.</p> <p>There are two distinctive features of our formalization and proof. First, we define the semantics of an interval as a set of real numbers (including the empty set), and we do not impose any other restrictions on such a set, except that models of this interval can decide if the set is empty or not. For example, an interval need not be closed and bounded, as in traditional interval arithmetic. Second, our formalization and proof do not rely on specific interval operations: it works with any interval operation that satisfies the requirements for decorated interval library operations.</p> <p>As the FTDIA is central to the IEEE-P1788 proposal, the correctness of the FTDIA is crucial. Our mechanized proof can give the research community in interval computations much confidence in its correctness. The current version of the FTDIA (in P1788 version 8.0) is slightly different from the theorem proved here. Modifying our proof to reflect this is left as future work.</p>en_US
dc.subjectFTDIAen_US
dc.subjectIEEE-P1788en_US
dc.subjectFormal Verificationen_US
dc.subjectFomalized Mathematicsen_US
dc.subjectTheorem Proveren_US
dc.subjectCoqen_US
dc.subjectOther Computer Engineeringen_US
dc.subjectOther Computer Engineeringen_US
dc.titleFormal Proof of the Fundamental Theorem of Decorated Interval Arithmeticen_US
dc.typethesisen_US
dc.contributor.departmentComputing and Softwareen_US
dc.description.degreeDoctor of Philosophy (PhD)en_US
Appears in Collections:Open Access Dissertations and Theses

Files in This Item:
File Description SizeFormat 
FTDIA.zip
Open Access
141.43 kBUnknownView/Open
fulltext.pdf
Open Access
519.84 kBAdobe PDFView/Open
Show simple item record Statistics


Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.

Sherman Centre for Digital Scholarship     McMaster University Libraries
©2022 McMaster University, 1280 Main Street West, Hamilton, Ontario L8S 4L8 | 905-525-9140 | Contact Us | Terms of Use & Privacy Policy | Feedback

Report Accessibility Issue