The following pages link to Tobias Nipkow (Q670700):
Displayed 50 items.
- Amortized complexity verified (Q670702) (← links)
- Linear quantifier elimination (Q707743) (← links)
- Term rewriting and beyond -- theorem proving in Isabelle (Q909488) (← links)
- Proof synthesis and reflection for linear arithmetic (Q945055) (← links)
- Non-deterministic data types: Models and implementations (Q1058286) (← links)
- Unification in Boolean rings (Q1112626) (← links)
- Higher-order rewrite systems and their confluence (Q1127334) (← links)
- Combining matching algorithms: The regular case (Q1186723) (← links)
- Winskel is (almost) right: Towards a mechanized semantics textbook (Q1272764) (← links)
- Reduction and unification in lambda calculi with a general notion of subtype (Q1340967) (← links)
- More Church-Rosser proofs (in Isabelle/HOL) (Q1595924) (← links)
- Isabelle/HOL. A proof assistant for higher-order logic (Q1600086) (← links)
- Verified memoization and dynamic programming (Q1791205) (← links)
- Boolean unification - the story so far (Q1824411) (← links)
- Equational reasoning in Isabelle (Q1825045) (← links)
- Verified bytecode verifiers. (Q1874284) (← links)
- Type inference verified: Algorithm \(\mathcal W\) in Isabelle/H0L (Q1961917) (← links)
- Isabelle's metalogic: formalization and proof checker (Q2055847) (← links)
- A formalization and proof checker for Isabelle's metalogic (Q2108191) (← links)
- A verified decision procedure for orders in Isabelle/HOL (Q2147186) (← links)
- From LCF to Isabelle/HOL (Q2280211) (← links)
- A verified compiler from Isabelle/HOL to CakeML (Q2324018) (← links)
- Hoare logics for time bounds. A study in meta theory (Q2324211) (← links)
- Flyspeck II: The basic linear programs (Q2379683) (← links)
- Proof Pearl: regular expression equivalence and relation algebra (Q2392416) (← links)
- Proving pointer programs in higher-order logic (Q2486585) (← links)
- Social choice theory in HOL. Arrow and Gibbard-Satterthwaite (Q2655324) (← links)
- (Q2752051) (← links)
- (Q2754030) (← links)
- (Q2769440) (← links)
- A Verified Compiler for Probability Density Functions (Q2802431) (← links)
- Automatic Functional Correctness Proofs for Functional Search Trees (Q2829265) (← links)
- Noninterfering Schedulers (Q2848952) (← links)
- A Brief Survey of Verified Decision Procedures for Equivalence of Regular Expressions (Q2851929) (← links)
- Unified Decision Procedures for Regular Expression Equivalence (Q2879269) (← links)
- Teaching Semantics with a Proof Assistant: No More LSD Trip Proofs (Q2891399) (← links)
- Verifying pCTL Model Checking (Q2894281) (← links)
- A compiled implementation of normalisation by evaluation (Q2913943) (← links)
- Abstract Interpretation of Annotated Commands (Q2914736) (← links)
- Concrete Semantics (Q2926333) (← links)
- Formalizing Probabilistic Noninterference (Q2938053) (← links)
- Amortized Complexity Verified (Q2945642) (← links)
- Verified Efficient Enumeration of Plane Graphs Modulo Isomorphism (Q3088012) (← links)
- Proof Pearl: The Marriage Theorem (Q3100219) (← links)
- Automatic Proof and Disproof in Isabelle/HOL (Q3172879) (← links)
- (Q3400637) (← links)
- Mining the Archive of Formal Proofs (Q3453102) (← links)
- Unification in primal algebras, their powers and their varieties (Q3495674) (← links)
- Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL (Q3523164) (← links)
- Verifying a Hotel Key Card System (Q3525136) (← links)