CPP 2012
22 papers
- A Formal Proof of Square Root and Division Elimination in Embedded Programs
- A Formally-Verified Alias Analysis
- A String of Pearls: Proofs of Fermat's Little Theorem
- An Executable Semantics for CompCert C
- Automation in Computer-Aided Cryptography: Proofs, Attacks and Designs
- Coherent and Strongly Discrete Rings in Type Theory
- Compact Proof Certificates for Linear Logic
- Compositional Verification of a Baby Virtual Memory Manager
- Constructive Completeness for Modal Logic with Transitive Closure
- Improving Real Analysis in Coq: A User-Friendly Approach to Integrals and Derivatives
- Mechanized Semantics for Compiler Verification
- Mechanized Verification of Computing Dominators for Formalizing Compilers
- Noninterference for Operating System Kernels
- On the Correctness of an Optimising Assembler for the Intel MCS-51 Microprocessor
- Producing Certified Functional Code from Inductive Specifications
- Program Certification by Higher-Order Model Checking
- Proof Pearl: Abella Formalization of λ-Calculus Cube Property
- Proving Concurrent Noninterference
- Rating Disambiguation Errors
- Scalable Formal Machine Models
- Shall We Juggle, Coinductively?
- The New Quickcheck for Isabelle - Random, Exhaustive and Symbolic Testing under One Roof