Certified Programs and Proofs

Second International Conference, CPP 2012, Kyoto, Japan, December 13-15, 2012. Proceedings

Editors:

ISBN: 978-3-642-35307-9 (Print) 978-3-642-35308-6 (Online)

Table of contents (22 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-3

    Scalable Formal Machine Models

  3. No Access

    Book Chapter

    Pages 4-6

    Mechanized Semantics for Compiler Verification

  4. No Access

    Book Chapter

    Pages 7-8

    Automation in Computer-Aided Cryptography: Proofs, Attacks and Designs

  5. No Access

    Book Chapter

    Pages 9-10

    Program Certification by Higher-Order Model Checking

  6. No Access

    Book Chapter

    Pages 11-26

    A Formally-Verified Alias Analysis

  7. No Access

    Book Chapter

    Pages 27-42

    Mechanized Verification of Computing Dominators for Formalizing Compilers

  8. No Access

    Book Chapter

    Pages 43-59

    On the Correctness of an Optimising Assembler for the Intel MCS-51 Microprocessor

  9. No Access

    Book Chapter

    Pages 60-75

    An Executable Semantics for CompCert C

  10. No Access

    Book Chapter

    Pages 76-91

    Producing Certified Functional Code from Inductive Specifications

  11. No Access

    Book Chapter

    Pages 92-108

    The New Quickcheck for Isabelle

  12. No Access

    Book Chapter

    Pages 109-125

    Proving Concurrent Noninterference

  13. No Access

    Book Chapter

    Pages 126-142

    Noninterference for Operating System Kernels

  14. No Access

    Book Chapter

    Pages 143-159

    Compositional Verification of a Baby Virtual Memory Manager

  15. No Access

    Book Chapter

    Pages 160-172

    Shall We Juggle, Coinductively?

  16. No Access

    Book Chapter

    Pages 173-187

    Proof Pearl: Abella Formalization of λ-Calculus Cube Property

  17. No Access

    Book Chapter

    Pages 188-207

    A String of Pearls: Proofs of Fermat’s Little Theorem

  18. No Access

    Book Chapter

    Pages 208-223

    Compact Proof Certificates for Linear Logic

  19. No Access

    Book Chapter

    Pages 224-239

    Constructive Completeness for Modal Logic with Transitive Closure

  20. No Access

    Book Chapter

    Pages 240-255

    Rating Disambiguation Errors

  21. No Access

    Book Chapter

    Pages 256-272

    A Formal Proof of Square Root and Division Elimination in Embedded Programs

previous Page of 2