Certified Programs and Proofs

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

Häftad, Engelska, 2012

719 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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. They deal with those topics in computer science and mathematics in which certification via formal techniques is crucial.

Produktinformation

Utgivningsdatum2012-11-01
Mått155 x 235 x 18 mm
Vikt482 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor305
Upplaga2012
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783642353079

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programvaruutveckling inom Data och it
Programmeringsböcker inom Data och it
Artificiell intelligens inom Data och it

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.