default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCPP 2012: Kyoto, Japan
- Chris Hawblitzel, Dale Miller
:
Certified Programs and Proofs - Second International Conference, CPP 2012, Kyoto, Japan, December 13-15, 2012. Proceedings. Lecture Notes in Computer Science 7679, Springer 2012, ISBN 978-3-642-35307-9 - Greg Morrisett:
Scalable Formal Machine Models. 1-3 - Xavier Leroy:
Mechanized Semantics for Compiler Verification. 4-6 - Gilles Barthe, Benjamin Grégoire, César Kunz, Yassine Lakhnech, Santiago Zanella-Béguelin:
Automation in Computer-Aided Cryptography: Proofs, Attacks and Designs. 7-8 - Naoki Kobayashi:
Program Certification by Higher-Order Model Checking. 9-10 - Valentin Robert, Xavier Leroy:
A Formally-Verified Alias Analysis. 11-26 - Jianzhou Zhao, Steve Zdancewic:
Mechanized Verification of Computing Dominators for Formalizing Compilers. 27-42 - Dominic P. Mulligan, Claudio Sacerdoti Coen:
On the Correctness of an Optimising Assembler for the Intel MCS-51 Microprocessor. 43-59 - Brian Campbell:
An Executable Semantics for CompCert C. 60-75 - Pierre-Nicolas Tollitte, David Delahaye, Catherine Dubois:
Producing Certified Functional Code from Inductive Specifications. 76-91 - Lukas Bulwahn:
The New Quickcheck for Isabelle - Random, Exhaustive and Symbolic Testing under One Roof. 92-108 - Andrei Popescu, Johannes Hölzl, Tobias Nipkow:
Proving Concurrent Noninterference. 109-125 - Toby C. Murray, Daniel Matichuk, Matthew Brassil, Peter Gammie, Gerwin Klein:
Noninterference for Operating System Kernels. 126-142 - Alexander Vaynberg, Zhong Shao:
Compositional Verification of a Baby Virtual Memory Manager. 143-159 - Keisuke Nakano:
Shall We Juggle, Coinductively? 160-172 - Beniamino Accattoli:
Proof Pearl: Abella Formalization of λ-Calculus Cube Property. 173-187 - Hing-Lun Chan, Michael Norrish:
A String of Pearls: Proofs of Fermat's Little Theorem. 188-207 - Kaustuv Chaudhuri:
Compact Proof Certificates for Linear Logic. 208-223 - Christian Doczkal, Gert Smolka:
Constructive Completeness for Modal Logic with Transitive Closure. 224-239 - Andrea Asperti, Wilmer Ricciotti:
Rating Disambiguation Errors. 240-255 - Pierre Neron:
A Formal Proof of Square Root and Division Elimination in Embedded Programs. 256-272 - Thierry Coquand, Anders Mörtberg, Vincent Siles:
Coherent and Strongly Discrete Rings in Type Theory. 273-288 - Sylvie Boldo, Catherine Lelay, Guillaume Melquiond:
Improving Real Analysis in Coq: A User-Friendly Approach to Integrals and Derivatives. 289-304
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-13 20:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
