Table of contents

  1. Wolfgang Naraschewski, Markus Wenzel
    Pages 349-366
  2. David Nowak, Jean -René Beauvais, Jean -Pierre Talpin
    Pages 387-399
  3. FranÇois Puitg, Jean -FranÇois Dufourd
    Pages 401-422
  4. Rimvydas Rukšėnas, Joakim von Wright
    Pages 423-441
  5. Hajime Sawamura, Daisaku Asanuma
    Pages 443-460
  6. Friedrich W. von Henke, Stephan Pfab, Holger Pfeifer, Harald Rue\
    Pages 461-478
  7. Mitsuharu Yamamoto, Koichi Takahashi, Masami Hagiya, Shin-ya Nishizaki, Tetsuo Tamai
    Pages 479-496
  8. Back Matter

About these proceedings


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.


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

Bibliographic information

Industry Sectors
IT & Software