Certified Programs and Proofs
Second International Conference, CPP 2012, Kyoto, Japan, December 13-15, 2012, Proceedings
Published on 1. November 2012
Book
Paperback/Softback
X, 305 pages
978-3-642-35307-9 (ISBN)
Description
This book constitutes the refereed proceedings of the Second International Conference on Certified Programs and Proofs, CPP 2012, held in Kyoto, Japan, in December 2012.
The 18 revised regular papers presented were carefully reviewed and selected from 37 submissions. They deal with those topics in computer science and mathematics in which certification via formal techniques is crucial.
More details
Series
Edition
2012 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
64 s/w Abbildungen
X, 305 p. 64 illus.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 18 mm
Weight
482 gr
ISBN-13
978-3-642-35307-9 (9783642353079)
DOI
10.1007/978-3-642-35308-6
Schweitzer Classification
Other editions
Additional editions
Chris Hawblitzel | Dale Miller
Certified Programs and Proofs
Second International Conference, CPP 2012, Kyoto, Japan, December 13-15, 2012, Proceedings
E-Book
11/2012
Springer
€53.49
Available for download
Content
Scalable Formal Machine Models.- Mechanized Semantics for Compiler Verification.- Automation in Computer-Aided Cryptography: Proofs, Attacks
and Designs.- Program Certification by Higher-Order Model Checking.- A Formally-Verified Alias Analysis.- Mechanized Verification of Computing Dominators for Formalizing
Compilers.- On the Correctness of an Optimising Assembler for the Intel MCS-51
Microprocessor.- An Executable Semantics for CompCert C.- Producing Certified Functional Code from Inductive Specifications.- The New Quickcheck for Isabelle: Random, Exhaustive and Symbolic
Testing under One Roof.- Proving Concurrent Noninterference.- Noninterference for Operating System Kernels.- Compositional Verification of a Baby Virtual Memory Manager.- Shall We Juggle, Coinductively?.- Proof Pearl: Abella Formalization of ?-Calculus Cube Property.- A String of Pearls: Proofs of Fermat's Little Theorem.- Compact Proof Certificates for Linear Logic.- Constructive Completeness for Modal Logic with Transitive Closure.- Rating Disambiguation Errors.- A Formal Proof of Square Root and Division Elimination in Embedded
Programs.- Coherent and Strongly Discrete Rings in Type Theory.- Improving Real Analysis in Coq: A User-Friendly Approach to Integrals
and Derivatives.