Tobias Nipkow

From MaRDI portal
Person:670700

Available identifiers

zbMath Open nipkow.tobiasDBLPn/TobiasNipkowWikidataQ18217799 ScholiaQ18217799MaRDI QIDQ670700

List of research outcomes





PublicationDate of PublicationType
Real-time double-ended queue verified (proof pearl)2024-11-26Paper
Gale-Shapley verified2024-09-27Paper
Formal verification of algorithm \(\mathcal{W}\): the monomorphic case2024-07-05Paper
Winskel is (almost) right. Towards a mechanized semantics textbook2024-07-05Paper
Verification of NP-Hardness Reduction Functions for Exact Lattice Problems2024-04-26Paper
I/O automata in Isabelle/HOL2023-12-08Paper
https://portal.mardi4nfdi.de/entity/Q60606762023-11-03Paper
A verified implementation of \(\mathrm{B}^+\)-trees in Isabelle/HOL2023-07-28Paper
Ordered rewriting and confluence2023-04-28Paper
Higher-order unification, polymorphism, and subsorts2023-03-09Paper
https://portal.mardi4nfdi.de/entity/Q58754322023-02-03Paper
Verified Textbook Algorithms2022-12-22Paper
A formalization and proof checker for Isabelle's metalogic2022-12-19Paper
Verified Root-Balanced Trees2022-12-09Paper
Modular higher-order E-unification2022-12-09Paper
Combining matching algorithms: The regular case2022-12-09Paper
Verified Approximation Algorithms2022-11-09Paper
Verification of Closest Pair of Points Algorithms2022-11-09Paper
https://portal.mardi4nfdi.de/entity/Q50941212022-08-02Paper
Trustworthy Graph Algorithms (Invited Talk)2022-07-21Paper
A verified decision procedure for orders in Isabelle/HOL2022-06-22Paper
Isabelle's metalogic: formalization and proof checker2021-12-01Paper
Verified analysis of random binary tree structures2020-11-02Paper
From LCF to Isabelle/HOL2019-12-18Paper
Formal verification of language-based concurrent noninterference2019-09-18Paper
Hoare logics for time bounds. A study in meta theory2019-09-16Paper
A verified compiler from Isabelle/HOL to CakeML2019-09-13Paper
Amortized complexity verified2019-03-20Paper
More Church-Rosser proofs (in Isabelle/HOL)2019-01-15Paper
Verified memoization and dynamic programming2018-10-04Paper
Verified analysis of random binary tree structures2018-10-04Paper
Verified Analysis of List Update Algorithms.2018-04-19Paper
Verified decision procedures for MSO on words based on derivatives of regular expressions2017-10-23Paper
Automatic Functional Correctness Proofs for Functional Search Trees2016-10-27Paper
A Verified Compiler for Probability Density Functions2016-04-26Paper
Mining the Archive of Formal Proofs2015-11-20Paper
Amortized Complexity Verified2015-09-14Paper
Verified decision procedures for MSO on words based on derivatives of regular expressions2015-03-30Paper
Formalizing Probabilistic Noninterference2015-01-13Paper
Concrete Semantics2014-10-23Paper
Unified Decision Procedures for Regular Expression Equivalence2014-09-08Paper
A Brief Survey of Verified Decision Procedures for Equivalence of Regular Expressions2013-10-04Paper
Noninterfering Schedulers2013-09-13Paper
Data Refinement in Isabelle/HOL2013-08-07Paper
Proof Pearl: regular expression equivalence and relation algebra2013-08-01Paper
Proving Concurrent Noninterference2013-04-19Paper
A compiled implementation of normalisation by evaluation2012-09-21Paper
Abstract Interpretation of Annotated Commands2012-09-20Paper
Verifying pCTL Model Checking2012-06-29Paper
Teaching Semantics with a Proof Assistant: No More LSD Trip Proofs2012-06-15Paper
Proof Pearl: The Marriage Theorem2011-11-22Paper
Automatic Proof and Disproof in Isabelle/HOL2011-10-07Paper
Verified Efficient Enumeration of Plane Graphs Modulo Isomorphism2011-08-17Paper
Linear quantifier elimination2010-10-08Paper
Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder2010-09-14Paper
Sledgehammer: Judgement Day2010-09-14Paper
Code Generation via Higher-Order Rewrite Systems2010-05-04Paper
Automated Deduction – CADE-192010-04-20Paper
Flyspeck II: The basic linear programs2010-03-19Paper
Nominal verification of algorithm \(W\)2010-02-05Paper
Social choice theory in HOL. Arrow and Gibbard-Satterthwaite2010-01-25Paper
Flyspeck I: Tame Graphs2009-03-12Paper
The Isabelle Framework2008-12-04Paper
A Compiled Implementation of Normalization by Evaluation2008-12-04Paper
Linear Quantifier Elimination2008-11-27Paper
Verifying a Hotel Key Card System2008-09-11Paper
Proof synthesis and reflection for linear arithmetic2008-09-10Paper
Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL2008-09-02Paper
Verifying and Reflecting Quantifier Elimination for Presburger Arithmetic2008-05-27Paper
Jinja: towards a comprehensive formal semantics for a Java-like language2008-01-14Paper
Theorem Proving in Higher Order Logics2006-07-06Paper
Programming Languages and Systems2005-09-13Paper
Theorem Proving in Higher Order Logics2005-08-18Paper
Proving pointer programs in higher-order logic2005-08-05Paper
https://portal.mardi4nfdi.de/entity/Q46734172005-04-29Paper
https://portal.mardi4nfdi.de/entity/Q48231412004-10-26Paper
https://portal.mardi4nfdi.de/entity/Q48088242004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47363872004-08-09Paper
https://portal.mardi4nfdi.de/entity/Q44704942004-07-01Paper
https://portal.mardi4nfdi.de/entity/Q44354742003-11-12Paper
https://portal.mardi4nfdi.de/entity/Q44118182003-07-10Paper
https://portal.mardi4nfdi.de/entity/Q44843322003-06-12Paper
Verified bytecode verifiers.2003-05-25Paper
\(\mu\)Java: Embedding a programming language in a theorem prover2002-10-23Paper
Isabelle/HOL. A proof assistant for higher-order logic2002-06-12Paper
Verified lightweight bytecode verification2002-05-01Paper
https://portal.mardi4nfdi.de/entity/Q27694402002-02-05Paper
https://portal.mardi4nfdi.de/entity/Q27540302001-11-11Paper
More Church-Rosser proofs (in Isabelle/HOL)2001-02-18Paper
https://portal.mardi4nfdi.de/entity/Q45247932001-01-15Paper
Type inference verified: Algorithm \(\mathcal W\) in Isabelle/H0L2000-09-11Paper
https://portal.mardi4nfdi.de/entity/Q42469521999-12-13Paper
Term Rewriting and All That1999-12-13Paper
HOLCF = HOL + LCF1999-11-29Paper
https://portal.mardi4nfdi.de/entity/Q42647191999-10-07Paper
Winskel is (almost) right: Towards a mechanized semantics textbook1999-01-03Paper
Higher-order rewrite systems and their confluence1998-08-13Paper
Type Reconstruction for Type Classes1995-10-09Paper
Reduction and unification in lambda calculi with a general notion of subtype1994-12-21Paper
https://portal.mardi4nfdi.de/entity/Q42814811994-03-10Paper
Combining matching algorithms: The regular case1992-06-28Paper
Unification in primal algebras, their powers and their varieties1990-01-01Paper
Equational reasoning in Isabelle1989-01-01Paper
Boolean unification - the story so far1989-01-01Paper
Term rewriting and beyond -- theorem proving in Isabelle1989-01-01Paper
Unification in Boolean rings1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38169651988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37890631988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47257241987-01-01Paper
Non-deterministic data types: Models and implementations1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37860221986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39563811982-01-01Paper

Research outcomes over time

This page was built for person: Tobias Nipkow