The following pages link to Isabelle/HOL (Q14275):
Displaying 50 items.
- A Coq library for verification of concurrent programs (Q2871836) (← links)
- Specifying properties of concurrent computations in CLF (Q2871839) (← links)
- Formalising in nominal Isabelle Crary's completeness proof for equivalence checking (Q2871867) (← links)
- Two-level hybrid: a system for reasoning using higher-order abstract syntax (Q2871875) (← links)
- Behavioral interface specification languages (Q2875082) (← links)
- Towards a Formally Verified Proof Assistant (Q2879241) (← links)
- A Heuristic Prover for Real Inequalities (Q2879243) (← links)
- Truly Modular (Co)datatypes for Isabelle/HOL (Q2879246) (← links)
- Cardinals in Isabelle/HOL (Q2879247) (← links)
- Showing Invariance Compositionally for a Process Algebra for Network Protocols (Q2879249) (← links)
- A New and Formalized Proof of Abstract Completion (Q2879259) (← links)
- Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm (Q2879261) (← links)
- Recursive Functions on Lazy Lists via Domains and Topologies (Q2879262) (← links)
- Unified Decision Procedures for Regular Expression Equivalence (Q2879269) (← links)
- Collaborative Interactive Theorem Proving with Clide (Q2879270) (← links)
- Asynchronous User Interaction and Tool Integration in Isabelle/PIDE (Q2879273) (← links)
- Rough Diamond: An Extension of Equivalence-Based Rewriting (Q2879275) (← links)
- Circular Coinduction: A Proof Theoretical Foundation (Q2888482) (← links)
- Towards Logical Frameworks in the Heterogeneous Tool Set Hets (Q2890328) (← links)
- Teaching Semantics with a Proof Assistant: No More LSD Trip Proofs (Q2891399) (← links)
- GMeta: A Generic Formal Metatheory Framework for First-Order Representations (Q2892744) (← links)
- Java and the Java Memory Model — A Unified, Machine-Checked Formalisation (Q2892748) (← links)
- Verifying pCTL Model Checking (Q2894281) (← links)
- Challenges and Experiences in Managing Large-Scale Proofs (Q2907311) (← links)
- Formalizing Frankl’s Conjecture: FC-Families (Q2907327) (← links)
- Automated Analysis of Regular Algebra (Q2908498) (← links)
- Dependently Typed Programming Based on Automated Theorem Proving (Q2908568) (← links)
- A compiled implementation of normalisation by evaluation (Q2913943) (← 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)
- Applying Data Refinement for Monadic Programs to Hopcroft’s Algorithm (Q2914741) (← links)
- Priority Inheritance Protocol Proved Correct (Q2914744) (← links)
- Certification of Nontermination Proofs (Q2914748) (← links)
- Charge! (Q2914751) (← links)
- Mechanised Separation Algebra (Q2914753) (← links)
- More SPASS with Isabelle (Q2914754) (← 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)
- Unifying Lazy and Strict Computations (Q2915133) (← links)
- Automated Reasoning in Higher-Order Regular Algebra (Q2915136) (← links)
- Concrete Semantics (Q2926333) (← links)
- Experience report (Q2936807) (← links)
- Büchi Automata Optimisations Formalised in Isabelle/HOL (Q2937399) (← links)
- Nonfree Datatypes in Isabelle/HOL (Q2938043) (← links)
- Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOL (Q2938044) (← links)
- Refinements for Free! (Q2938045) (← links)
- Certified Kruskal’s Tree Theorem (Q2938047) (← links)
- A Formal Model and Correctness Proof for an Access Control Policy Framework (Q2938056) (← links)
