Skip to main content
SpringerLink
Log in

Theorem Proving in Higher Order Logics

21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008, Proceedings

  • Conference proceedings
  • © 2008

Access provided by Autonomous University of Puebla

Download book PDF

Overview

Editors:
  1. Otmane Ait Mohamed

    1. Department of Electrical and Computer Engineering, Concordia University, Montreal, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. César Muñoz

    1. National Institute of Aerospace, Hampton, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Sofiène Tahar

    1. Dept. of Electrical & Computer Engineering, Concordia University, Montreal, Canada

    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 5170)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: TPHOLs 2008.

Buy print copy

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

About this book

This book constitutes the refereed proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2008, held in Montreal, Canada, in August 2008. The 17 revised full papers presented together with 1 proof pearl (concise and elegant presentations of interesting examples), 5 tool presentations, and 2 invited papers were carefully reviewed and selected from 40 submissions. The papers cover all aspects of theorem proving in higher order logics as well as related topics in theorem proving and verification such as formal semantics of specification, modeling, and programming languages, specification and verification of hardware and software, formalisation of mathematical theories, advances in theorem prover technology, as well as industrial application of theorem provers.

Keywords

Table of contents (25 papers)

  1. Front Matter

    Download chapter PDF

  3. Tutorials

    1. A Short Presentation of Coq

      • Yves Bertot
      Pages 12-16
      Download chapter PDF

    2. An ACL2 Tutorial

      • Matt Kaufmann, J Strother Moore
      Pages 17-21
      Download chapter PDF

    3. A Brief Overview of PVS

      • Sam Owre, Natarajan Shankar
      Pages 22-27
      Download chapter PDF

    4. A Brief Overview of HOL4

      • Konrad Slind, Michael Norrish
      Pages 28-32
      Download chapter PDF

    5. The Isabelle Framework

      • Makarius Wenzel, Lawrence C. Paulson, Tobias Nipkow
      Pages 33-38
      Download chapter PDF

  4. Regular Papers

    1. A Compiled Implementation of Normalization by Evaluation

      • Klaus Aehlig, Florian Haftmann, Tobias Nipkow
      Pages 39-54
      Download chapter PDF

    2. LCF-Style Propositional Simplification with BDDs and SAT Solvers

      • Hasan Amjad
      Pages 55-70
      Download chapter PDF

    3. Nominal Inversion Principles

      • Stefan Berghofer, Christian Urban
      Pages 71-85
      Download chapter PDF

    4. Canonical Big Operators

      • Yves Bertot, Georges Gonthier, Sidi Ould Biha, Ioana Pasca
      Pages 86-101
      Download chapter PDF

    5. A Type of Partial Recursive Functions

      • Ana Bove, Venanzio Capretta
      Pages 102-117
      Download chapter PDF

    6. Formal Reasoning About Causality Analysis

      • Jens Brandt, Klaus Schneider
      Pages 118-133
      Download chapter PDF

    7. Imperative Functional Programming with Isabelle/HOL

      • Lukas Bulwahn, Alexander Krauss, Florian Haftmann, Levent Erkök, John Matthews
      Pages 134-149
      Download chapter PDF

    8. HOL-Boogie — An Interactive Prover for the Boogie Program-Verifier

      • Sascha Böhme, K. Rustan M. Leino, Burkhart Wolff
      Pages 150-166
      Download chapter PDF

    9. Secure Microkernels, State Monads and Scalable Refinement

      • David Cock, Gerwin Klein, Thomas Sewell
      Pages 167-182
      Download chapter PDF

    10. Certifying a Termination Criterion Based on Graphs, without Graphs

      • Pierre Courtieu, Julien Forest, Xavier Urbain
      Pages 183-198
      Download chapter PDF

    11. Lightweight Separation

      • Holger Gast
      Pages 199-214
      Download chapter PDF

    12. Real Number Calculations and Theorem Proving

      • David R Lester
      Pages 215-229
      Download chapter PDF
Back to top

Other volumes

  1. Theorem Proving in Higher Order Logics

Editors and Affiliations

  • Department of Electrical and Computer Engineering, Concordia University, Montreal, Canada

    Otmane Ait Mohamed

  • National Institute of Aerospace, Hampton, USA

    César Muñoz

  • Dept. of Electrical & Computer Engineering, Concordia University, Montreal, Canada

    Sofiène Tahar

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation