Cantitate/Preț
Produs

Certified Programs and Proofs: Second International Conference, CPP 2012, Kyoto, Japan, December 13-15, 2012, Proceedings: Lecture Notes in Computer Science, cartea 7679

Editat de Chris Hawblitzel, Dale Miller
en Limba Engleză Paperback – noi 2012
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33340 lei

Preț vechi: 41675 lei
-20% Nou

Puncte Express: 500

Preț estimativ în valută:
6381 6637$ 5347£

Carte tipărită la comandă

Livrare economică 13-27 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642353079
ISBN-10: 364235307X
Pagini: 316
Ilustrații: X, 305 p. 64 illus.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.45 kg
Ediția:2012
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.

Textul de pe ultima copertă

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.

Caracteristici

Up-to-date results Fast-track conference proceedings State-of-the-art research