Description |
1 online resource |
Series |
Lecture notes in computer science ; 7679 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 7679.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
Contents |
Scalable Formal Machine Models / Greg Morrisett -- Mechanized Semantics for Compiler Verification / Xavier Leroy -- Automation in Computer-Aided Cryptography: Proofs, Attacks and Designs / Gilles Barthe, Benjamin Grégoire, César Kunz, Yassine Lakhnech and Santiago Zanella Béguelin -- Program Certification by Higher-Order Model Checking / Naoki Kobayashi -- A Formally-Verified Alias Analysis / Valentin Robert and Xavier Leroy -- Mechanized Verification of Computing Dominators for Formalizing Compilers / Jianzhou Zhao and Steve Zdancewic -- On the Correctness of an Optimising Assembler for the Intel MCS-51 Microprocessor / Dominic P. Mulligan and Claudio Sacerdoti Coen -- An Executable Semantics for CompCert C / Brian Campbell -- Producing Certified Functional Code from Inductive Specifications / Pierre-Nicolas Tollitte, David Delahaye and Catherine Dubois -- The New Quickcheck for Isabelle: Random, Exhaustive and Symbolic Testing under One Roof / Lukas Bulwahn |
|
Proving Concurrent Noninterference / Andrei Popescu, Johannes Hölzl and Tobias Nipkow -- Noninterference for Operating System Kernels / Toby Murray, Daniel Matichuk, Matthew Brassil, Peter Gammie and Gerwin Klein -- Compositional Verification of a Baby Virtual Memory Manager / Alexander Vaynberg and Zhong Shao -- Shall We Juggle, Coinductively? / Keisuke Nakano -- Proof Pearl: Abella Formalization of [lambda]-Calculus Cube Property / Beniamino Accattoli -- A String of Pearls: Proofs of Fermat's Little Theorem / Hing-Lun Chan and Michael Norrish -- Compact Proof Certificates for Linear Logic / Kaustuv Chaudhuri -- Constructive Completeness for Modal Logic with Transitive Closure / Christian Doczkal and Gert Smolka -- Rating Disambiguation Errors / Andrea Asperti and Wilmer Ricciotti -- A Formal Proof of Square Root and Division Elimination in Embedded Programs / Pierre Neron -- Coherent and Strongly Discrete Rings in Type Theory / Thierry Coquand, Anders Mörtberg and Vincent Siles -- Improving Real Analysis in Coq: A User-Friendly Approach to Integrals and Derivatives / Sylvie Boldo, Catherine Lelay and Guillaume Melquiond |
Summary |
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 |
Analysis |
computerwetenschappen |
|
computer sciences |
|
programmeertalen |
|
programming languages |
|
algebra |
|
kunstmatige intelligentie |
|
artificial intelligence |
|
wiskunde |
|
mathematics |
|
logica |
|
logic |
|
software engineering |
|
Information and Communication Technology (General) |
|
Informatie- en communicatietechnologie (algemeen) |
Bibliography |
Includes bibliographical references and author index |
Notes |
English |
|
Print version record |
Subject |
Computer science -- Mathematics -- Congresses
|
|
Formal methods (Computer science) -- Congresses
|
|
Computer software -- Verification -- Congresses
|
|
Informatique.
|
|
Computer science -- Mathematics
|
|
Computer software -- Verification
|
|
Formal methods (Computer science)
|
Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
Form |
Electronic book
|
Author |
Hawblitzel, Chris
|
|
Miller, Dale (Dale A.)
|
ISBN |
9783642353086 |
|
3642353088 |
|
364235307X |
|
9783642353079 |
|