Interactive Theorem Proving

First International Conference, ITP 2010, Edinburgh, UK, July 11-14, 2010. Proceedings

  • Matt Kaufmann
  • Lawrence C. Paulson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6172)

Table of contents

  1. Front Matter
  2. Invited Talks

  3. Proof Pearls

  4. Regular Papers

    1. Michaël Armand, Benjamin Grégoire, Arnaud Spiwack, Laurent Théry
      Pages 83-98
    2. Serge Autexier, Dominik Dietrich
      Pages 99-114
    3. Gilles Barthe, Benjamin Grégoire, Santiago Zanella Béguelin
      Pages 115-130
    4. Sylvie Boldo, François Clément, Jean-Christophe Filliâtre, Micaela Mayero, Guillaume Melquiond, Pierre Weis
      Pages 147-162
    5. Thomas Braibant, Damien Pous
      Pages 163-178
    6. Sascha Böhme, Tjark Weber
      Pages 179-194
    7. Arthur Charguéraud
      Pages 195-210
    8. Jean-François Dufourd, Yves Bertot
      Pages 211-226
    9. Herman Geuvers, Adam Koprowski, Dan Synek, Eelis van der Weegen
      Pages 259-274

About these proceedings

Keywords

ARM processor compiler optimizations computational geometry consistency checking cryptographic proofs declarative proofs formal verification inductive proof interactive theorem proving kleene algebras proof theory proving rewriting sytems set theory verification

Editors and affiliations

  • Matt Kaufmann
    • 1
  • Lawrence C. Paulson
    • 2
  1. 1.Department of Computer SciencesUniversity of Texas, AustinAustinUSA
  2. 2.Computer LaboratoryUniversity of CambridgeCambridge,UK

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-14052-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 2010
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-14051-8
  • Online ISBN 978-3-642-14052-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book