The following pages link to Interactive Theorem Proving (Q2829237):
Displayed 50 items.
- Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm (Q2879261) (← links)
- Recursive Functions on Lazy Lists via Domains and Topologies (Q2879262) (← links)
- Formal Verification of Optical Quantum Flip Gate (Q2879263) (← links)
- Compositional Computational Reflection (Q2879264) (← links)
- An Isabelle Proof Method Language (Q2879265) (← links)
- Proof Pearl: Proving a Simple Von Neumann Machine Turing Complete (Q2879266) (← links)
- The Reflective Milawa Theorem Prover Is Sound (Q2879267) (← links)
- Balancing Lists: A Proof Pearl (Q2879268) (← links)
- Unified Decision Procedures for Regular Expression Equivalence (Q2879269) (← links)
- Collaborative Interactive Theorem Proving with Clide (Q2879270) (← links)
- On the Formalization of Z-Transform in HOL (Q2879271) (← links)
- Universe Polymorphism in Coq (Q2879272) (← links)
- Asynchronous User Interaction and Tool Integration in Isabelle/PIDE (Q2879273) (← links)
- HOL Constant Definition Done Right (Q2879274) (← links)
- Rough Diamond: An Extension of Equivalence-Based Rewriting (Q2879275) (← links)
- Mechanical Certification of Loop Pipelining Transformations: A Preview (Q2879278) (← links)
- MetiTarski: Past and Future (Q2914728) (← links)
- Computer-Aided Cryptographic Proofs (Q2914729) (← links)
- A Differential Operator Approach to Equational Differential Invariants (Q2914730) (← links)
- Abella: A Tutorial (Q2914731) (← links)
- A Cantor Trio: Denumerability, the Reals, and the Real Algebraic Numbers (Q2914732) (← links)
- Construction of Real Algebraic Numbers in Coq (Q2914733) (← links)
- A Refinement-Based Approach to Computational Algebra in Coq (Q2914734) (← links)
- Bridging the Gap: Automatic Verified Abstraction of C (Q2914735) (← links)
- Abstract Interpretation of Annotated Commands (Q2914736) (← links)
- Verifying and Generating WP Transformers for Procedures on Complex Data (Q2914738) (← links)
- Bag Equivalence via a Proof-Relevant Membership Relation (Q2914739) (← links)
- Applying Data Refinement for Monadic Programs to Hopcroft’s Algorithm (Q2914741) (← links)
- Synthesis of Distributed Mobile Programs Using Monadic Types in Coq (Q2914742) (← links)
- Towards Provably Robust Watermarking (Q2914743) (← links)
- Priority Inheritance Protocol Proved Correct (Q2914744) (← links)
- Formalization of Shannon’s Theorems in SSReflect-Coq (Q2914745) (← links)
- Stop When You Are Almost-Full (Q2914747) (← links)
- Certification of Nontermination Proofs (Q2914748) (← links)
- A Compact Proof of Decidability for Regular Expression Equivalence (Q2914749) (← links)
- Using Locales to Define a Rely-Guarantee Temporal Logic (Q2914750) (← links)
- Charge! (Q2914751) (← links)
- Mechanised Separation Algebra (Q2914753) (← links)
- More SPASS with Isabelle (Q2914754) (← links)
- A Language of Patterns for Subterm Selection (Q2914755) (← links)
- Numerical Analysis of Ordinary Differential Equations in Isabelle/HOL (Q2914756) (← links)
- Proof Pearl: A Probabilistic Proof for the Girth-Chromatic Number Theorem (Q2914757) (← links)
- Standalone Tactics Using OpenTheory (Q2914758) (← links)
- Verified Over-Approximation of the Diameter of Propositionally Factored Transition Systems (Q2945619) (← links)
- Formalization of Error-Correcting Codes: From Hamming to Modern Coding Theory (Q2945620) (← links)
- ROSCoq: Robots Powered by Constructive Reals (Q2945622) (← links)
- Asynchronous Processing of Coq Documents: From the Kernel up to the User Interface (Q2945623) (← links)
- A Concrete Memory Model for CompCert (Q2945624) (← links)
- Validating Dominator Trees for a Fast, Verified Dominance Test (Q2945625) (← links)
- Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra (Q2945626) (← links)