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

Front Cover
David Basin, Burkhart Wolff
Springer Science & Business Media, Aug 21, 2003 - Philosophy - 366 pages
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.
 

What people are saying - Write a review

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

Contents

Interactive Proofs within Set Theory
1
Formal Specification and Verification of ARM6
25
A Programming Logic for Java Bytecode Programs
41
Verified Bytecode Subroutines
55
Complete Integer Decision Procedures as Derived Rules
71
Changing Data Representation within the Coq System
87
Applications of Polytypism in Theorem Proving
103
A Coverage Checking Algorithm for LF
120
Program Extraction from Large Proof Developments
205
First Order Logic with Domain Conditions
221
Extending HigherOrder Unification to Support Proof Irrelevance
238
Inductive Invariants for Nested Recursion
253
Implementing Modules in the Coq System
270
MetaPRL A Modular Logical Environment
287
Knuths Algorithm for Prime Numbers
304
Formalizing Hilberts Grundlagen in IsabelleIsar
319

Automatic Generation of Generalization Lemmas for Proving Properties of TailRecursive Definitions
136
Embedding of Systems of Affine Recurrence Equations in Coq
155
Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover
171
Combining Testing and Proving in Dependent Type Theory
188
An Abstract
204
Using Coq to Verify Java Card Applet Isolation Properties
335
Verifying SecondLevel Security Protocols
352
Author Index
367
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information