Theorem Proving in Higher Order Logics

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

  • David Basin
  • Burkhart Wolff
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2758)

Table of contents

  1. Front Matter
  2. Invited Talk I

    1. Jean-Raymond Abrial, Dominique Cansell
      Pages 1-24
  3. Hardware and Assembler Languages

    1. Claire L. Quigley
      Pages 41-54
    2. Gerwin Klein, Martin Wildmoser
      Pages 55-70
  4. Proof Automation I

  5. Proof Automation II

    1. Carsten Schürmann, Frank Pfenning
      Pages 120-135
  6. Tool Combination

    1. David Cachera, David Pichardie
      Pages 155-170
    2. Peter Dybjer, Qiao Haiyan, Makoto Takeyama
      Pages 188-203
  7. Invited Talk II

  8. Logic Extensions

    1. Luís Cruz-Filipe, Bas Spitters
      Pages 205-220
    2. Freek Wiedijk, Jan Zwanenburg
      Pages 221-237
  9. Advances in Theorem Prover Technology

    1. Sava Krstić, John Matthews
      Pages 253-269
    2. Jacek Chrząszcz
      Pages 270-286
    3. Jason Hickey, Aleksey Nogin, Robert L. Constable, Brian E. Aydemir, Eli Barzilay, Yegor Bryukhov et al.
      Pages 287-303

About these proceedings

Introduction

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.

Keywords

Automat Coq Isabelle automation logic proving theorem proving

Editors and affiliations

  • David Basin
    • 1
  • Burkhart Wolff
    • 2
  1. 1.Information Security Group, Dep. of Computer ScienceETH ZurichSwitzerland
  2. 2.Computer Science Dept.Saarland UniversitySaarbrückenGermany

Bibliographic information

  • DOI https://doi.org/10.1007/b11935
  • Copyright Information Springer-Verlag Berlin Heidelberg 2003
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-40664-8
  • Online ISBN 978-3-540-45130-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349