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

Front Cover
Richard J. Boulton, Paul B. Jackson
Springer Science & Business Media, Aug 22, 2001 - Computers - 402 pages
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

JavaCard Program Verification
1
View from the Fringe of the Fringe Joint with CHARME 2001
4
Using Decision Procedures with a HigherOrder Logic
5
Integrating Maple and PVS
27
An Irrational Construction of R from Z
43
HELM and the Semantic MathWeb
59
Calculational Reasoning Revisited An IsabelleIsar Experience
75
Mechanical Proofs about a Nonrepudiation Protocol
91
Abstraction and Refinement in Higher Order Logic
201
A Framework for the Formalisation of Pi Calculus Type Systems in IsabelleHOL
217
Representing Hierarchical Automata in Interactive Theorem Provers
233
Refinement Calculus for Logic Programming in IsabelleHOL
249
Predicate Subtyping with Predicate Sets
265
A Structural Embedding of Ocsid in PVS
281
A Certified PolynomialBased Decision Procedure for Propositional Logic
297
Finite Set Theory in ACL2
313

Proving Hybrid Protocols Correct
105
Nested General Recursion and Partiality in Type Theory
121
A HigherOrder Calculus for Categories
136
Certifying the Fast Fourier Transform with Coq
154
A Generic Library for FloatingPoint Numbers and Its Application to Exact Computing
169
A Case Study for Rippling in a Higher Order Domain
185
The HOLNuPRL Proof Translator A Practical Approach to Formal Interoperability
329
Formalizing Convex Hull Algorithms
346
Experiments with Finite Tree Automata in Coq
362
Mizar Light for HOL Light
378
Author Index
394
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information