Table of contents

  1. Front Matter
  2. Tobias Nipkow
    Pages 1-15
  3. Joakim von Wright
    Pages 17-32
  4. Marco Benini, Sara Kalvala, Dirk Nowotka
    Pages 33-48
  5. Karthikeyan Bhargavan, Carl A. Gunter, Elsa L. Gunter, Michael Jackson, Davor Obradovic, Pamela Zave
    Pages 49-66
  6. Richard Boulton, Konrad Slind, Alan Bundy, Mike Gordon
    Pages 87-104
  7. David Griffioen, Marieke Huisman
    Pages 123-142
  8. John Harrison
    Pages 153-170
  9. John Harrison
    Pages 171-188
  10. Douglas J. Howe
    Pages 207-224
  11. Paul B. Jackson
    Pages 225-244
  12. Anna Mikhajlova, Joakim von Wright
    Pages 295-314

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics, TPHOLs '98, held in Canberra, Australia, in September/October 1998.
The 26 revised full papers presented were carefully reviewed and selected from a total of 52 submissions. Also included are two invited papers. The papers address all current aspects of theorem proving in higher order logics and formal verification and program analysis. Besides the HOL system, the theorem provers Coq, Isabelle, LAMBDA, LEGO, NuPrl, and PVS are discussed.

Keywords

Annotation Coq Isabelle Variable algorithm algorithms automata formal specification formal verification logic modeling proving search algorithm theorem proving verification

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0055125
  • Copyright Information Springer-Verlag 1998
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-64987-8
  • Online ISBN 978-3-540-49801-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book