Theorem Proving in Higher Order Logics

1. Front Matter

   Pages I-X

   PDF

2. Invited Talks

   1. JavaCard Program Verification

      • Bart Jacobs

      Pages 1-3

      PDF

   2. View from the Fringe of the Fringe

      • Steven D. Johnson

      Pages 4-4

      PDF

   3. Using Decision Procedures with a Higher-Order Logic

      • Natarajan Shankar

      Pages 5-26

      PDF

3. Regular Contributions

   1. Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS

      • Andrew Adams, Martin Dunstan, Hanne Gottliebsen, Tom Kelsey, Ursula Martin, Sam Owre

      Pages 27-42

      PDF

   2. An Irrational Construction of ℝ from ℤ

      • Rob D. Arthan

      Pages 43-58

      PDF

   3. HELM and the Semantic Math-Web

      • Andrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Irene Schena

      Pages 59-74

      PDF

   4. Calculational Reasoning Revisited An Isabelle/Isar Experience

      • Gertrud Bauer, Markus Wenzel

      Pages 75-90

      PDF

   5. Mechanical Proofs about a Non-repudiation Protocol

      • Giampaolo Bella, Lawrence C. Paulson

      Pages 91-104

      PDF

   6. Proving Hybrid Protocols Correct

      • Mark Bickford, Christoph Kreitz, Robbert van Renesse, Xiaoming Liu

      Pages 105-120

      PDF

   7. Nested General Recursion and Partiality in Type Theory

      • Ana Bove, Venanzio Capretta

      Pages 121-125

      PDF

   8. A Higher-Order Calculus for Categories

      • Mario Cáccamo, Glynn Winskel

      Pages 136-153

      PDF

   9. Certifying the Fast Fourier Transform with Coq

      • Venanzio Capretta

      Pages 154-168

      PDF

   10. A Generic Library for Floating-Point Numbers and Its Application to Exact Computing

       • Marc Daumas, Laurence Rideau, Laurent Théry

       Pages 169-184

       PDF

   11. Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain

       • Louise A. Dennis, Alan Smaill

       Pages 185-200

       PDF

   12. Abstraction and Refinement in Higher Order Logic

       • Matt Fairtlough, Michael Mendler, Xiaochun Cheng

       Pages 201-216

       PDF

   13. A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL

       • Simon J. Gay

       Pages 217-232

       PDF

   14. Representing Hierarchical Automata in Interactive Theorem Provers

       • Steffen Helke, Florian Kammüller

       Pages 233-248

       PDF

   15. Refinement Calculus for Logic Programming in Isabelle/HOL

       • David Hemer, Ian Hayes, Paul Strooper

       Pages 249-260

       PDF

   16. Predicate Subtyping with Predicate Sets

       • Joe Hurd

       Pages 265-280

       PDF

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.

• Coq
• Isabelle
• Theorem priving
• formal verification
• hardware verification
• logic design
• mathematical logic
• model checking
• pi calculus
• proof theory
• proving
• theorem provers
• theorem proving
• type theory
• verification

• Department of Computing Science, University of Glasgow, Glasgow, Scotland, UK

  Richard J. Boulton

• Division of Informatics, University of Edinburgh, Edinburgh, Scotland, UK

  Paul B. Jackson

Policies and ethics