Certified Programs and Proofs: Third International Conference, CPP 2013, Melbourne, VIC, Australia, December 11-13,2013, Proceedin by Georges GonthierCertified Programs and Proofs: Third International Conference, CPP 2013, Melbourne, VIC, Australia, December 11-13,2013, Proceedin by Georges Gonthier

Certified Programs and Proofs: Third International Conference, CPP 2013, Melbourne, VIC, Australia…

byGeorges GonthierEditorMichael Norrish

Paperback | November 18, 2013

Pricing and Purchase Info

$106.28 online 
$124.50 list price save 14%
Earn 531 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the refereed proceedings of the Third International Conference on Certified Programs and Proofs, CPP 2013, colocated with APLAS 2013 held in Melbourne, Australia, in December 2013. The 18 revised regular papers presented together with 1 invited lecture were carefully reviewed and selected from 39 submissions. The papers are organized in topical sections on code verification, elegant proofs, proof libraries, certified transformations and security.
Title:Certified Programs and Proofs: Third International Conference, CPP 2013, Melbourne, VIC, Australia…Format:PaperbackDimensions:309 pages, 23.5 × 15.5 × 0.02 inPublished:November 18, 2013Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3319035444

ISBN - 13:9783319035444

Look for similar items by category:

Reviews

Table of Contents

Invited Lectures.- ?n(Sn) in Homotopy Type Theory.- Session 1: Code Verification.- Mostly Sound Type System Improves a Foundational Program Verifier.- Computational Verification of Network Programs in Coq.- Aliasing Restrictions of C11 Formalized in Coq.- Session 2: Elegant Proofs.- Proof Pearl: A Verified Bignum Implementation in x86-64 Machine Code.- A Constructive Theory of Regular Languages in Coq.- Certified Parsing of Regular Languages.- Session 3: Proof Libraries.- Nonfree Datatypes in Isabelle/HOL: Animating a Many-Sorted Metatheory.- Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOL.- Refinements for Free!.- Session 4: Mathematics.- A Formal Proof of Borodin-Trakhtenbrot's Gap Theorem.- Certified Kruskal's Tree Theorem.- Extracting Proofs from Tabled Proof Search.- Session 5: Certified Transformations.- Formalizing the SAFECode Type System.- Certifiably Sound Parallelizing Transformations.- Programming Type-Safe Transformations Using Higher-Order Abstract Syntax.- Session 6: Security.- Formalizing Probabilistic Noninterference.- Machine Assisted Proof of ARMv7 Instruction Level Isolation Properties.- A Formal Model and Correctness Proof for an Access Control Policy Framework.