Interactive Theorem Proving

4th International Conference, ITP 2013, Rennes, France, July 22-26, 2013. Proceedings

ISBN: 978-3-642-39633-5 (Print) 978-3-642-39634-2 (Online)

Table of contents (38 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-1

      Applying Formal Methods in the Large

    2. No Access

      Book Chapter

      Pages 2-16

      Automating Theorem Proving with SMT

    3. No Access

      Book Chapter

      Pages 17-17

      Certifying Voting Protocols

  3. Invited Tutorials

    1. No Access

      Book Chapter

      Pages 18-18

      Counterexample Generation Meets Interactive Theorem Proving: Current Results and Future Opportunities

    2. No Access

      Book Chapter

      Pages 19-34

      Canonical Structures for the Working Coq User

  4. Regular Papers

    1. No Access

      Book Chapter

      Pages 35-50

      MaSh: Machine Learning for Sledgehammer

    2. No Access

      Book Chapter

      Pages 51-66

      Scalable LCF-Style Proof Translation

    3. No Access

      Book Chapter

      Pages 67-83

      Lightweight Proof by Reflection Using a Posteriori Simulation of Effectful Computation

    4. No Access

      Book Chapter

      Pages 84-99

      Automatic Data Refinement

    5. No Access

      Book Chapter

      Pages 100-115

      Data Refinement in Isabelle/HOL

    6. No Access

      Book Chapter

      Pages 116-132

      Light-Weight Containers for Isabelle: Efficient, Extensible, Nestable

    7. No Access

      Book Chapter

      Pages 133-146

      Ordinals in HOL: Transfinite Arithmetic up to (and Beyond) ω 1

    8. No Access

      Book Chapter

      Pages 147-162

      Mechanising Turing Machines and Computability Theory in Isabelle/HOL

    9. No Access

      Book Chapter

      Pages 163-179

      A Machine-Checked Proof of the Odd Order Theorem

    10. No Access

      Book Chapter

      Pages 180-196

      Kleene Algebra with Tests and Coq Tools for while Programs

    11. No Access

      Book Chapter

      Pages 197-212

      Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL

    12. No Access

      Book Chapter

      Pages 213-228

      Pragmatic Quotient Types in Coq

    13. No Access

      Book Chapter

      Pages 229-244

      Mechanical Verification of SAT Refutations with Extended Resolution

    14. No Access

      Book Chapter

      Pages 245-260

      Formalizing Bounded Increase

    15. No Access

      Book Chapter

      Pages 261-278

      Formal Program Optimization in Nuprl Using Computational Equivalence and Partial Types

previous Page of 2