Theorem Proving in Higher Order Logics: 14th International Conference, TPHOLs 2001 Edinburgh, Scotland, UK, September 3–6, 2001 Proceedings

Bart Jacobs (auth.), Richard J. Boulton, Paul B. Jackson (eds.)354042525X, 9783540425250

This volume constitutes the proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2001) held 3–6 September 2001 in Edinburgh, Scotland. TPHOLs covers all aspects of theorem proving in higher order logics, as well as related topics in theorem proving and veri?cation. TPHOLs 2001 was collocated with the 11th Advanced Research Working Conference on Correct Hardware Design and Veri?cation Methods (CHARME 2001). This was held 4–7 September 2001 in nearby Livingston, Scotland at the Institute for System Level Integration, and a joint half-day session of talks was arranged for the 5th September in Edinburgh. An excursion to Traquair House and a banquet in the Playfair Library of Old College, University of Edinburgh were also jointly organized. The proceedings of CHARME 2001 have been p- lished as volume 2144 of Springer-Verlag’s Lecture Notes in Computer Science series, with Tiziana Margaria and Tom Melham as editors. Each of the 47 papers submitted in the full research category was refereed by at least 3 reviewers who were selected by the Program Committee. Of these submissions, 23 were accepted for presentation at the conference and publication in this volume. In keeping with tradition, TPHOLs 2001 also o?ered a venue for the presentation of work in progress, where researchers invite discussion by means of a brief preliminary talk and then discuss their work at a poster session. A supplementary proceedings containing associated papers for work in progress was published by the Division of Informatics at the University of Edinburgh.

---

Table of contents :
JavaCard Program Verification….Pages 1-3
View from the Fringe of the Fringe….Pages 4-4
Using Decision Procedures with a Higher-Order Logic….Pages 5-26
Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS….Pages 27-42
An Irrational Construction of ℝ from ℤ….Pages 43-58
HELM and the Semantic Math-Web….Pages 59-74
Calculational Reasoning Revisited An Isabelle/Isar Experience….Pages 75-90
Mechanical Proofs about a Non-repudiation Protocol….Pages 91-104
Proving Hybrid Protocols Correct….Pages 105-120
Nested General Recursion and Partiality in Type Theory….Pages 121-125
A Higher-Order Calculus for Categories….Pages 136-153
Certifying the Fast Fourier Transform with Coq….Pages 154-168
A Generic Library for Floating-Point Numbers and Its Application to Exact Computing….Pages 169-184
Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain….Pages 185-200
Abstraction and Refinement in Higher Order Logic….Pages 201-216
A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL….Pages 217-232
Representing Hierarchical Automata in Interactive Theorem Provers….Pages 233-248
Refinement Calculus for Logic Programming in Isabelle/HOL….Pages 249-260
Predicate Subtyping with Predicate Sets….Pages 265-280
A Structural Embedding of Ocsid in PVS….Pages 281-296
A Certified Polynomial-Based Decision Procedure for Propositional Logic….Pages 297-312
Finite Set Theory in ACL2….Pages 313-328
The HOL/NuPRL Proof Translator….Pages 329-345
Formalizing Convex Hull Algorithms….Pages 346-361
Experiments with Finite Tree Automata in Coq….Pages 362-377
Mizar Light for HOL Light….Pages 378-393