Theorem Proving in Higher Order Logics

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

  • Otmane Ait Mohamed
  • César Muñoz
  • Sofiène Tahar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5170)

Table of contents

  1. Front Matter
  2. Invited Papers

  3. Tutorials

    1. Yves Bertot
      Pages 12-16
    2. Matt Kaufmann, J Strother Moore
      Pages 17-21
    3. Sam Owre, Natarajan Shankar
      Pages 22-27
    4. Konrad Slind, Michael Norrish
      Pages 28-32
    5. Makarius Wenzel, Lawrence C. Paulson, Tobias Nipkow
      Pages 33-38
  4. Regular Papers

    1. Klaus Aehlig, Florian Haftmann, Tobias Nipkow
      Pages 39-54
    2. Stefan Berghofer, Christian Urban
      Pages 71-85
    3. Yves Bertot, Georges Gonthier, Sidi Ould Biha, Ioana Pasca
      Pages 86-101
    4. Ana Bove, Venanzio Capretta
      Pages 102-117
    5. Jens Brandt, Klaus Schneider
      Pages 118-133
    6. Lukas Bulwahn, Alexander Krauss, Florian Haftmann, Levent Erkök, John Matthews
      Pages 134-149
    7. Sascha Böhme, K. Rustan M. Leino, Burkhart Wolff
      Pages 150-166
    8. David Cock, Gerwin Klein, Thomas Sewell
      Pages 167-182
    9. Pierre Courtieu, Julien Forest, Xavier Urbain
      Pages 183-198
    10. Holger Gast
      Pages 199-214
    11. David R Lester
      Pages 215-229

About these proceedings

Introduction

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

D programming language modeling programming programming language proving semantics theorem proving verification

Editors and affiliations

  • Otmane Ait Mohamed
    • 1
  • César Muñoz
    • 2
  • Sofiène Tahar
    • 3
  1. 1.Department of Electrical and Computer EngineeringConcordia UniversityMontrealCanada
  2. 2.National Institute of AerospaceHamptonUSA
  3. 3.Dept. of Electrical & Computer EngineeringConcordia UniversityMontrealCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-71067-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-71065-3
  • Online ISBN 978-3-540-71067-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349