ITP 2015
30 papers
- A Concrete Memory Model for CompCert
- A Consistent Foundation for Isabelle/HOL
- A Formalized Hierarchy of Probabilistic System Types - Proof Pearl
- A Linear First-Order Functional Intermediate Language for Verified Compilers
- A Mechanized Theory of Regular Trees in Dependent Type Theory
- A Verified Enclosure for the Lorenz Attractor (Rough Diamond)
- Affine Arithmetic and Applications to Real-Number Proving
- Amortized Complexity Verified
- Asynchronous Processing of Coq Documents: From the Kernel up to the User Interface
- Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions
- Deriving Comparators and Show Functions in Isabelle/HOL
- Formalising Knot Theory in Isabelle/HOL
- Formalization of Error-Correcting Codes: From Hamming to Modern Coding Theory
- Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker
- Foundational Property-Based Testing
- HOCore in Coq
- Improved Tool Support for Machine-Code Decompilation in HOL4
- Learning to Parse on Aligned Corpora (Rough Diamond)
- Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation
- Mechanisation of AKS Algorithm: Part 1 - The Main Theorem
- ModuRes: A Coq Library for Modular Reasoning About Concurrent Higher-Order Imperative Programming Languages
- Pattern Matches in HOL: - A New Representation and Improved Code Generation
- Proof-Producing Reflection for HOL - With an Application to Model Polymorphism
- ROSCoq: Robots Powered by Constructive Reals
- Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra
- Refinement to Imperative/HOL
- Stream Fusion for Isabelle's Code Generator - Rough Diamond
- Transfinite Constructions in Classical Type Theory
- Validating Dominator Trees for a Fast, Verified Dominance Test
- Verified Over-Approximation of the Diameter of Propositionally Factored Transition Systems