ITP 2016
32 papers
- A Formal Proof of Cauchy's Residue Theorem
- A Framework for the Automatic Formal Verification of Refinement from Cogent to C
- AUTO2, A Saturation-Based Heuristic Prover for Higher-Order Logic
- Algebraic Numbers in Isabelle/HOL
- An Isabelle/HOL Formalisation of Green's Theorem
- Automatic Functional Correctness Proofs for Functional Search Trees
- Cardinalities of Finite Relations in Coq
- Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems
- CoSMed: A Confidentiality-Verified Social Media Platform
- CoqPIE: An IDE Aimed at Improving Proof Development Productivity - (Rough Diamond)
- Equational Reasoning with Applicative Functors
- Formalising Semantics for Expected Running Time of Probabilistic Programs
- Formalization of the Resolution Calculus for First-Order Logic
- Formalized Timed Automata
- Formalizing the Edmonds-Karp Algorithm
- Formally Verified Approximations of Definite Integrals
- From Types to Sets by Local Type Definitions in Higher-Order Logic
- HOL Zero's Solutions for Pollack-Inconsistency
- Hereditarily Finite Sets in Constructive Type Theory
- Infeasible Paths Elimination by Symbolic Execution Techniques - Proof of Correctness and Preservation of Paths
- Mechanical Verification of a Constructive Proof for FLP
- Modular Dependent Induction in Coq, Mendler-Style
- Mostly Automated Formal Verification of Loop Dependencies with Applications to Distributed Stencil Algorithms
- On the Formalization of Fourier Transform in Higher-order Logic
- POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl)
- Proof Pearl: Bounding Least Common Multiples with Triangles
- Proof of OS Scheduling Behavior in the Presence of Interrupt-Induced Concurrency
- The Flow of ODEs
- Two-Way Automata in Coq
- Verified Operational Transformation for Trees
- Visual Theorem Proving with the Incredible Proof Machine
- What's in a Theorem Name?