Interactive Theorem Proving

5th International Conference, ITP 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings

  • Gerwin Klein
  • Ruben Gamboa
Conference proceedings ITP 2014

DOI: 10.1007/978-3-319-08970-6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8558)

Table of contents (37 papers)

  1. Front Matter
  2. Invited Papers

    1. Are We There Yet? 20 Years of Industrial Theorem Proving with SPARK
      Roderick Chapman, Florian Schanda
      Pages 17-26
  3. Regular Papers

    1. Towards a Formally Verified Proof Assistant
      Abhishek Anand, Vincent Rahli
      Pages 27-44
    2. Implicational Rewriting Tactics in HOL
      Vincent Aravantinos, Sofiène Tahar
      Pages 45-60
    3. A Heuristic Prover for Real Inequalities
      Jeremy Avigad, Robert Y. Lewis, Cody Roux
      Pages 61-76
    4. A Formal Library for Elliptic Curves in the Coq Proof Assistant
      Evmorfia-Iro Bartzia, Pierre-Yves Strub
      Pages 77-92
    5. Truly Modular (Co)datatypes for Isabelle/HOL
      Jasmin Christian Blanchette, Johannes Hölzl, Andreas Lochbihler, Lorenz Panny, Andrei Popescu, Dmitriy Traytel
      Pages 93-110
    6. Cardinals in Isabelle/HOL
      Jasmin Christian Blanchette, Andrei Popescu, Dmitriy Traytel
      Pages 111-127
    7. Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code
      Sandrine Blazy, Vincent Laporte, David Pichardie
      Pages 128-143
    8. Showing Invariance Compositionally for a Process Algebra for Network Protocols
      Timothy Bourke, Robert J. van Glabbeek, Peter Höfner
      Pages 144-159
    9. A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3)
      Frédéric Chyzak, Assia Mahboubi, Thomas Sibut-Pinote, Enrico Tassi
      Pages 160-176
    10. A Coq Formalization of Finitely Presented Modules
      Cyril Cohen, Anders Mörtberg
      Pages 193-208
    11. Formalized, Effective Domain Theory in Coq
      Robert Dockins
      Pages 209-225
    12. Completeness and Decidability Results for CTL in Coq
      Christian Doczkal, Gert Smolka
      Pages 226-241
    13. A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction
      Kento Emoto, Frédéric Loulergue, Julien Tesson
      Pages 258-274
    14. Experience Implementing a Performant Category-Theory Library in Coq
      Jason Gross, Adam Chlipala, David I. Spivak
      Pages 275-291
    15. A New and Formalized Proof of Abstract Completion
      Nao Hirokawa, Aart Middeldorp, Christian Sternagel
      Pages 292-307

About these proceedings

Introduction

This book constitutes the proceedings of the 5th International Conference on Interactive Theorem Proving, ITP 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, in Vienna, Austria, in July 2014. The 35 papers presented in this volume were carefully reviewed and selected from 59 submissions. The topics range from theoretical foundations to implementation aspects and applications in program verification, security and formalization of mathematics.

Keywords

embedded systems formal methods functional languages network protocols program verification real-time systems rewriting theorem proving and SAT solving turing machine virtual machines

Editors and affiliations

  • Gerwin Klein
    • 1
  • Ruben Gamboa
    • 2
  1. 1.NICTASydneyAustralia
  2. 2.University of WyomingLaramieUSA

Bibliographic information

  • Copyright Information Springer International Publishing Switzerland 2014
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-08969-0
  • Online ISBN 978-3-319-08970-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349