Certified Programs and Proofs

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

AvChris Hawblitzel,Dale Miller

Häftad, Engelska, 2012

Del i serien Lecture Notes in Computer Science

566 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2012-11-01
Mått:155 x 235 x 18 mm
Vikt:482 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:305
Upplaga:2012
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783642353079

Utforska kategorier

Innehållsförteckning

Scalable Formal Machine Models.- Mechanized Semantics for Compiler Verification.- Automation in Computer-Aided Cryptography: Proofs, Attacksand Designs.- Program Certification by Higher-Order Model Checking.- A Formally-Verified Alias Analysis.- Mechanized Verification of Computing Dominators for FormalizingCompilers.- On the Correctness of an Optimising Assembler for the Intel MCS-51Microprocessor.- An Executable Semantics for CompCert C.- Producing Certified Functional Code from Inductive Specifications.- The New Quickcheck for Isabelle: Random, Exhaustive and SymbolicTesting 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 EmbeddedPrograms.- Coherent and Strongly Discrete Rings in Type Theory.- Improving Real Analysis in Coq: A User-Friendly Approach to Integralsand Derivatives.