Theorem Proving in Higher Order Logics: 16th International Conference, TPHOLs 2003, Rome, Italy, September 8-12, 2003. Proceedings

Jean-Raymond Abrial, Dominique Cansell (auth.), David Basin, Burkhart Wolff (eds.)9783540406648, 3540406646

This volume constitutes the proceedings of the16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2003) held September 8–12, 2003 in Rome, Italy. TPHOLs covers all aspects of theorem proving in higher order logics as well as related topics in theorem proving and veri?cation. TPHOLs 2003 was co-located with TABLEAUX, the International Con- rence on Automated Reasoning with Analytic Tableaux and Related Methods, and with Calculemus, the Symposium on the Integration of Symbolic Compu- tion and Mechanized Reasoning. There were 50 papers submitted to TPHOLs in the full research category, each of which was refereed by at least 3 reviewers, selected by the program c- mittee.Ofthesesubmissions,21wereacceptedforpresentationattheconference and publication in this volume. In keeping with tradition, TPHOLs 2003 also o?ered a venue for the presentation of work in progress, where researchers – vite 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 computer science department at the Universit¨ at Freiburg. The organizers are grateful to Jean-Raymond Abrial, Patrick Lincoln, and Dale Miller for agreeing to give invited talks at TPHOLs 2003. The TPHOLs conference traditionally changes continent each year in order to maximize the chances that researchers from around the world can attend.

---

Table of contents :
Front Matter….Pages –
Click’n Prove: Interactive Proofs within Set Theory….Pages 1-24
Formal Specification and Verification of ARM6….Pages 25-40
A Programming Logic for Java Bytecode Programs….Pages 41-54
Verified Bytecode Subroutines….Pages 55-70
Complete Integer Decision Procedures as Derived Rules in HOL….Pages 71-86
Changing Data Representation within the Coq System….Pages 87-102
Applications of Polytypism in Theorem Proving….Pages 103-119
A Coverage Checking Algorithm for LF….Pages 120-135
Automatic Generation of Generalization Lemmas for Proving Properties of Tail-Recursive Definitions….Pages 136-154
Embedding of Systems of Affine Recurrence Equations in Coq….Pages 155-170
Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover….Pages 171-187
Combining Testing and Proving in Dependent Type Theory….Pages 188-203
Reasoning about Proof Search Specifications: An Abstract….Pages 204-204
Program Extraction from Large Proof Developments….Pages 205-220
First Order Logic with Domain Conditions….Pages 221-237
Extending Higher-Order Unification to Support Proof Irrelevance….Pages 238-252
Inductive Invariants for Nested Recursion….Pages 253-269
Implementing Modules in the Coq System….Pages 270-286
MetaPRL – A Modular Logical Environment….Pages 287-303
Proving Pearl: Knuth’s Algorithm for Prime Numbers….Pages 304-318
Formalizing Hilbert’s Grundlagen in Isabelle/Isar….Pages 319-334
Using Coq to Verify Java Card TM Applet Isolation Properties….Pages 335-351
Verifying Second-Level Security Protocols….Pages 352-366
Back Matter….Pages –