Skip to main content
SpringerLink
Log in
Book cover

Theorem Proving in Higher Order Logics

11th International Conference, TPHOLs'98, Canberra, Australia, September 27 - October 1, 1998, Proceedings

  • Conference proceedings
  • © 1998

Overview

Editors:
  1. Jim Grundy
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Malcolm Newey
    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 1479)

Included in the following conference series:

Conference proceedings info: TPHOLs 1998.

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

Access this book

Log in via an institution
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 (28 papers)

  1. I/O automata and beyond: Temporal logic and abstraction in Isabelle

    • Olaf Müller
    Pages 331-348

  2. Object-oriented verification based on record subtyping in Higher-Order Logic

    • Wolfgang Naraschewski, Markus Wenzel
    Pages 349-366

  3. On the effectiveness of theorem proving guided discovery of formal assertions for a register allocator in a high-level synthesis system

    • Naren Narasimhan, Ranga Vemuri
    Pages 367-386

  4. Co-inductive axiomatization of a synchronous language

    • David Nowak, Jean -René Beauvais, Jean -Pierre Talpin
    Pages 387-399

  5. Formal specification and theorem proving breakthroughs in geometric modeling

    • FranÇois Puitg, Jean -FranÇois Dufourd
    Pages 401-422

  6. A tool for data refinement

    • Rimvydas RukÅ¡Ä—nas, Joakim von Wright
    Pages 423-441

  7. Mechanizing relevant logics with HOL

    • Hajime Sawamura, Daisaku Asanuma
    Pages 443-460

  8. Case studies in meta-level theorem proving

    • Friedrich W. von Henke, Stephan Pfab, Holger Pfeifer, Harald Rue\
    Pages 461-478

  9. Formalization of graph search algorithms and its applications

    • Mitsuharu Yamamoto, Koichi Takahashi, Masami Hagiya, Shin-ya Nishizaki, Tetsuo Tamai
    Pages 479-496

  10. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Theorem Proving in Higher Order Logics

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation