Advertisement

Theorem Proving in Higher Order Logics

20th International Conference, TPHOLs 2007, Kaiserslautern, Germany, September 10-13, 2007. Proceedings

  • Editors
  • Klaus Schneider
  • Jens Brandt
Conference proceedings TPHOLs 2007

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

Table of contents

  1. Front Matter
    PDF
  2. On the Utility of Formal Methods in the Development and Certification of Software
    Constance L. Heitmeyer
    Pages 1-2
  3. Formal Techniques in Software Engineering: Correct Software and Safe Systems
    Peter Liggesmeyer
    Pages 3-4
  4. Separation Logic for Small-Step cminor
    Andrew W. Appel, Sandrine Blazy
    Pages 5-21
  5. Formalising Java’s Data Race Free Guarantee
    David Aspinall, Jaroslav Ševčík
    Pages 22-37
  6. Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL
    Lukas Bulwahn, Alexander Krauss, Tobias Nipkow
    Pages 38-53
  7. Formalising Generalised Substitutions
    Jeremy E. Dawson
    Pages 54-69
  8. Extracting Purely Functional Contents from Logical Inductive Types
    David Delahaye, Catherine Dubois, Jean-Frédéric Étienne
    Pages 70-85
  9. A Modular Formalisation of Finite Group Theory
    Georges Gonthier, Assia Mahboubi, Laurence Rideau, Enrico Tassi, Laurent Théry
    Pages 86-101
  10. Verifying Nonlinear Real Formulas Via Sums of Squares
    John Harrison
    Pages 102-118
  11. Verification of Expectation Properties for Discrete Random Variables in HOL
    Osman Hasan, Sofiène Tahar
    Pages 119-134
  12. A Formally Verified Prover for the \(\mathcal{ALC\,}\) Description Logic
    José-Antonio Alonso, Joaquín Borrego-Díaz, María-José Hidalgo, Francisco-Jesus Martín-Mateos, José-Luis Ruiz-Reina
    Pages 135-150
  13. Proof Pearl: The Termination Analysis of Terminator
    Joe Hurd
    Pages 151-156
  14. Improving the Usability of HOL Through Controlled Automation Tactics
    Eunsuk Kang, Mark D. Aagaard
    Pages 157-172
  15. Verified Decision Procedures on Context-Free Grammars
    Yasuhiko Minamide
    Pages 173-188
  16. Using XCAP to Certify Realistic Systems Code: Machine Context Management
    Zhaozhong Ni, Dachuan Yu, Zhong Shao
    Pages 189-206
  17. Proof Pearl: De Bruijn Terms Really Do Work
    Michael Norrish, René Vestergaard
    Pages 207-222
  18. Proof Pearl: Looping Around the Orbit
    Steven Obua
    Pages 223-231
  19. Source-Level Proof Reconstruction for Interactive Theorem Proving
    Lawrence C. Paulson, Kong Woei Susanto
    Pages 232-245
  20. Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF
    Brigitte Pientka
    Pages 246-261
  21. Automatically Translating Type and Function Definitions from HOL to ACL2
    James Reynolds
    Pages 262-277
  22. Operational Reasoning for Concurrent Caml Programs and Weak Memory Models
    Tom Ridge
    Pages 278-293
  23. Proof Pearl: Wellfounded Induction on the Ordinals Up to ε0
    Matt Kaufmann, Konrad Slind
    Pages 294-301
  24. A Monad-Based Modeling and Verification Toolbox with Application to Security Protocols
    Christoph Sprenger, David Basin
    Pages 302-318
  25. Primality Proving with Elliptic Curves
    Laurent Théry, Guillaume Hanrot
    Pages 319-333
  26. HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism
    Norbert Völker
    Pages 334-351
  27. Building Formal Method Tools in the Isabelle/Isar Framework
    Makarius Wenzel, Burkhart Wolff
    Pages 352-367
  28. Simple Types in Type Theory: Deep and Shallow Encodings
    François Garillot, Benjamin Werner
    Pages 368-382
  29. Mizar’s Soft Type System
    Freek Wiedijk
    Pages 383-399
  30. Back Matter
    PDF

About these proceedings

Keywords

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

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-74591-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 2007
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-74590-7
  • Online ISBN 978-3-540-74591-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site