Theorem Proving in Higher Order Logics: 17th International Conference, TPHOLS 2004, Park City, Utah, USA, September 14-17, 2004, Proceedings (Lecture Notes in Computer Science)

THis book constitutes the refereed proceedings of the 17th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2004, held in Park City, Utah, USA in September 2004. The 21 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 42 submissions. Among the topics addressed are theorem proving, verification, inductive types, automated deduction, mechanized proofs, mathematical logic, proof theory, type systems, computability, program verification, ACL, Cop, Isabelle/HOL, recursive functions, integration theory, machine code safety certification, and abstraction. This Volume Constitutes The Proceedings Of The 17th International Conference On Theorem Proving In Higher Order Logics (tphols 2004) Held September 14–17, 2004 In Park City, Utah, Usa. Tphols Covers All Aspects Of Theorem Proving In Higher-order Logics As Well As Related Topics In Theorem Proving And Veri?cation. There Were 42 Papers Submitted To Tphols 2004 In The Full Research Ca- Gory, Each Of Which Was Refereed By At Least 3 Reviewers Selected By The Program Committee. Of These Submissions, 21 Were Accepted For Presentation At The C- Ference And Publication In This Volume. In Keeping With Longstanding Tradition, Tphols 2004 Also O?ered A Venue For The Presentation Of Work In Progress, Where Researchers Invited Discussion By Means Of A Brief Introductory Talk And Then Discussed Their Work At A Poster Session. A Supplementary Proceedings C- Taining Papers About In-progress Work Was Published As A 2004 Technical Report Of The School Of Computing At The University Of Utah. The Organizers Are Grateful To Al Davis, Thomas Hales, And Ken Mcmillan For Agreeing To Give Invited Talks At Tphols 2004. The Tphols Conference Traditionally Changes Continents Each Year In Order To Maximize The Chances That Researchers From Around The World Can Attend. Error Analysis Of Digital Filters Using Theorem Proving -- Verifying Uniqueness In A Logical Framework -- A Program Logic For Resource Verification -- Proof Reuse With Extended Inductive Types -- Hierarchical Reflection -- Correct Embedded Computing Futures -- Higher Order Rippling In Isaplanner -- A Mechanical Proof Of The Cook-levin Theorem -- Formalizing The Proof Of The Kepler Conjecture -- Interfacing Hoare Logic And Type Systems For Foundational Proof-carrying Code -- Extensible Hierarchical Tactic Construction In A Logical Framework -- Theorem Reuse By Proof Term Transformation -- Proving Compatibility Using Refinement -- Java Program Verification Via A Jvm Deep Embedding In Acl2 -- Reasoning About Cbv Functional Programs In Isabelle/hol -- Proof Pearl: From Concrete To Functional Unparsing -- A Decision Procedure For Geometry In Coq -- Recursive Function Definition For Types With Binders -- Abstractions For Fault-tolerant Distributed System Verification -- Formalizing Integration Theory With An Application To Probabilistic Algorithms -- Formalizing Java Dynamic Loading In Hol -- Certifying Machine Code Safety: Shallow Versus Deep Embedding -- Term Algebras With Length Function And Bounded Quantifier Alternation. Konrad Slind, Annette Bunker, Ganesh Gopalakrishnan (eds.). Includes Bibliographical References And Index. Also Issued Online. Table of Contents......Page 8 Error Analysis of Digital Filters Using Theorem Proving......Page 10 Verifying Uniqueness in a Logical Framework......Page 27 A Program Logic for Resource Verification......Page 43 Proof Reuse with Extended Inductive Types......Page 59 Hierarchical Reflection......Page 75 Correct Embedded Computing Futures......Page 91 Higher Order Rippling in ISAPLANNER......Page 92 A Mechanical Proof of the Cook-Levin Theorem......Page 108 Formalizing the Proof of the Kepler Conjecture......Page 126 Interfacing Hoare Logic and Type Systems for Foundational Proof-Carrying Code......Page 127 Extensible Hierarchical Tactic Construction in a Logical Framework......Page 145 Theorem Reuse by Proof Term Transformation......Page 161 Proving Compatibility Using Refinement......Page 177 Java Program Verification via a JVM Deep Embedding in ACL2......Page 193 Reasoning About CBV Functional Programs in Isabelle/HOL......Page 210 Proof Pearl: From Concrete to Functional Unparsing......Page 226 A Decision Procedure for Geometry in Coq......Page 234 Recursive Function Definition for Types with Binders......Page 250 Abstractions for Fault-Tolerant Distributed System Verification......Page 266 Formalizing Integration Theory with an Application to Probabilistic Algorithms......Page 280 Formalizing Java Dynamic Loading in HOL......Page 296 Certifying Machine Code Safety: Shallow Versus Deep Embedding......Page 314 Term Algebras with Length Function and Bounded Quantifier Alternation......Page 330 Author Index......Page 346 This volume constitutes the proceedings of the 17th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2004) held September 14{u2013}17, 2004 in Park City, Utah, USA. TPHOLs covers all aspects of theorem proving in higher-order logics as well as related topics in theorem proving and veri?cation. There were 42 papers submitted to TPHOLs 2004 in the full research ca- gory, each of which was refereed by at least 3 reviewers selected by the program committee. Of these submissions, 21 were accepted for presentation at the c- ference and publication in this volume. In keeping with longstanding tradition, TPHOLs 2004 also o?ered a venue for the presentation of work in progress, where researchers invited discussion by means of a brief introductory talk and then discussed their work at a poster session. A supplementary proceedings c- taining papers about in-progress work was published as a 2004 technical report of the School of Computing at the University of Utah. The organizers are grateful to Al Davis, Thomas Hales, and Ken McMillan for agreeing to give invited talks at TPHOLs 2004. The TPHOLs conference traditionally changes continents each year in order to maximize the chances that researchers from around the world can attend Signal processing through digital techniques has become increasingly attractive with the rapid technological advancement in digital integrated circuits, devices, and systems.