Skip to main content
SpringerLink
Log in
Book cover

Theorem Proving in Higher Order Logics

16th International Conference, TPHOLs 2003, Rom, Italy, September 8-12, 2003, Proceedings

  • Conference proceedings
  • © 2003

Overview

Editors:
  1. David Basin

    1. Information Security Group, Dep. of Computer Science, ETH Zurich, Switzerland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Burkhart Wolff

    1. Computer Science Dept., Saarland University, Saarbrücken, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2758)

Included in the following conference series:

Conference proceedings info: TPHOLs 2003.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (23 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talk I

    1. Click’n Prove: Interactive Proofs within Set Theory

      • Jean-Raymond Abrial, Dominique Cansell
      Pages 1-24

  3. Hardware and Assembler Languages

    1. Formal Specification and Verification of ARM6

      • Anthony Fox
      Pages 25-40

    2. A Programming Logic for Java Bytecode Programs

      • Claire L. Quigley
      Pages 41-54

    3. Verified Bytecode Subroutines

      • Gerwin Klein, Martin Wildmoser
      Pages 55-70

  4. Proof Automation I

    1. Complete Integer Decision Procedures as Derived Rules in HOL

      • Michael Norrish
      Pages 71-86

    2. Changing Data Representation within the Coq System

      • Nicolas Magaud
      Pages 87-102

    3. Applications of Polytypism in Theorem Proving

      • Konrad Slind, Joe Hurd
      Pages 103-119

  5. Proof Automation II

    1. A Coverage Checking Algorithm for LF

      • Carsten Schürmann, Frank Pfenning
      Pages 120-135

    2. Automatic Generation of Generalization Lemmas for Proving Properties of Tail-Recursive Definitions

      • Deepak Kapur, Nikita A. Sakhanenko
      Pages 136-154

  6. Tool Combination

    1. Embedding of Systems of Affine Recurrence Equations in Coq

      • David Cachera, David Pichardie
      Pages 155-170

    2. Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover

      • Hasan Amjad
      Pages 171-187

    3. Combining Testing and Proving in Dependent Type Theory

      • Peter Dybjer, Qiao Haiyan, Makoto Takeyama
      Pages 188-203

  7. Invited Talk II

    1. Reasoning about Proof Search Specifications: An Abstract

      • Dale Miller
      Pages 204-204

  8. Logic Extensions

    1. Program Extraction from Large Proof Developments

      • Luís Cruz-Filipe, Bas Spitters
      Pages 205-220

    2. First Order Logic with Domain Conditions

      • Freek Wiedijk, Jan Zwanenburg
      Pages 221-237

    3. Extending Higher-Order Unification to Support Proof Irrelevance

      • Jason Reed
      Pages 238-252

  9. Advances in Theorem Prover Technology

    1. Inductive Invariants for Nested Recursion

      • Sava Krstić, John Matthews
      Pages 253-269

    2. Implementing Modules in the Coq System

      • Jacek Chrząszcz
      Pages 270-286

    3. MetaPRL – A Modular Logical Environment

      • Jason Hickey, Aleksey Nogin, Robert L. Constable, Brian E. Aydemir, Eli Barzilay, Yegor Bryukhov et al.
      Pages 287-303
Back to top

Other volumes

  1. Theorem Proving in Higher Order Logics

Keywords

About this book

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.

Editors and Affiliations

  • Information Security Group, Dep. of Computer Science, ETH Zurich, Switzerland

    David Basin

  • Computer Science Dept., Saarland University, Saarbrücken, Germany

    Burkhart Wolff

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation