Notes on Coalgebras, Cofibrations and Concurrency. - Alexander Kurz 001; Dirk Pattinson (CMCS, 2000)

Modal Logic for Rewriting Theories. - Dirk Pattinson (WRLA, 2000)

Semantical Principles in the Modal Logic of Coalgebras. - Dirk Pattinson (STACS, 2001)

Modal Languages for Coalgebras in a Topological Setting. - Dirk Pattinson (CMCS, 2001)

Making Components Move: A Separation of Concerns Approach. - Dirk Pattinson; Martin Wirsing (FMCO, 2002)

Translating Logics for Coalgebras. - Dirk Pattinson (WADT, 2002)

Definability, Canonical Models, and Compactness for Finitary Coalgebraic Modal Logic. - Alexander Kurz 001; Dirk Pattinson (CMCS, 2002)

Computable Functions on Final Coalgebras. - Dirk Pattinson (CMCS, 2003)

Coalgebraic modal logic: soundness, completeness and decidability of local consequence. - Dirk Pattinson (Theor. Comput. Sci., 2003)

Modular Construction of Modal Logics. - Corina Cîrstea; Dirk Pattinson (CONCUR, 2004)

A Domain Theoretic Account of Euler's Method for Solving Initial Value Problems. - Abbas Edalat; Dirk Pattinson (PARA, 2004)

Algebraic Semantics for Coalgebraic Logics. - Clemens Kupke; Alexander Kurz 001; Dirk Pattinson (CMCS, 2004)

Expressive Logics for Coalgebras via Terminal Sequence Induction. - Dirk Pattinson (Notre Dame J. Formal Log., 2004)

Ultrafilter Extensions for Coalgebras. - Clemens Kupke; Alexander Kurz 001; Dirk Pattinson (CALCO, 2005)

Domain-Theoretic Formulation of Linear Boundary Value Problems. - Dirk Pattinson (CiE, 2005)

A Complete Temporal and Spatial Logic for Distributed Systems. - Dirk Pattinson; Bernhard Reus (FroCoS, 2005)

Inverse and Implicit Functions in Domain Theory. - Abbas Edalat; Dirk Pattinson (LICS, 2005)

Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields. - Abbas Edalat; Dirk Pattinson (MFPS, 2005)

Coalgebraic modal logic of finite rank. - Alexander Kurz 001; Dirk Pattinson (Math. Struct. Comput. Sci., 2005)

A coordination approach to mobile components. - Dirk Pattinson; Martin Wirsing (Theor. Comput. Sci., 2005)

Continuous Functions on Final Coalgebras. - Neil Ghani; Peter G. Hancock; Dirk Pattinson (CMCS, 2006)

Modular Algorithms for Heterogeneous Modal Logics. - Lutz Schröder; Dirk Pattinson (ICALP, 2007)

CoLoSS: The Coalgebraic Logic Satisfiability Solver. - Georgel Calin; Robert S. R. Myers; Dirk Pattinson; Lutz Schröder (M4M, 2007)

Denotational semantics of hybrid automata. - Abbas Edalat; Dirk Pattinson (J. Log. Algebraic Methods Program., 2007)

A Domain-Theoretic Account of Picard's Theorem. - Abbas Edalat; Dirk Pattinson (LMS J. Comput. Math., 2007)

Modular construction of complete coalgebraic logics. - Corina Cîrstea; Dirk Pattinson (Theor. Comput. Sci., 2007)

Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics. - Dirk Pattinson; Lutz Schröder (FoSSaCS, 2008)

Shallow Models for Non-iterative Modal Logics. - Lutz Schröder; Dirk Pattinson (KI, 2008)

How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics. - Lutz Schröder; Dirk Pattinson (KR, 2008)

The craft of model making: PSPACE bounds for non-iterative modal logics - Lutz Schröder; Dirk Pattinson (CoRR, 2008)

Admissibility of Cut in Coalgebraic Logics. - Dirk Pattinson; Lutz Schröder (CMCS, 2008)

Editorial: Math. Log. Quart. 1/2008. - Josef Berger; Dirk Pattinson; Peter Schuster 001; Júlia Zappe (Math. Log. Q., 2008)

EXPTIME Tableaux for the Coalgebraic µ-Calculus. - Corina Cîrstea; Clemens Kupke; Dirk Pattinson (CSL, 2009)

Coalgebraic Hybrid Logic. - Robert S. R. Myers; Dirk Pattinson; Lutz Schröder (FoSSaCS, 2009)

Nominals for Everyone. - Lutz Schröder; Dirk Pattinson; Clemens Kupke (IJCAI, 2009)

Strong Completeness of Coalgebraic Modal Logics. - Lutz Schröder; Dirk Pattinson (STACS, 2009)

Representations of Stream Processors Using Nested Fixed Points - Neil Ghani; Peter G. Hancock; Dirk Pattinson (Log. Methods Comput. Sci., 2009)

PSPACE bounds for rank-1 modal logics. - Lutz Schröder; Dirk Pattinson (ACM Trans. Comput. Log., 2009)

On Modal Logics of Linear Inequalities. - Clemens Kupke; Dirk Pattinson (Advances in Modal Logic, 2010)

Global Caching for Coalgebraic Description Logics. - Rajeev Goré; Clemens Kupke; Dirk Pattinson; Lutz Schröder (IJCAR, 2010)

Optimal Tableaux for Conditional Logics with Cautious Monotonicity. - Lutz Schröder; Dirk Pattinson; Daniel Hausmann 001 (ECAI, 2010)

Coalgebraic Correspondence Theory. - Lutz Schröder; Dirk Pattinson (FoSSaCS, 2010)

Named Models in Coalgebraic Hybrid Logic. - Lutz Schröder; Dirk Pattinson (STACS, 2010)

Optimal Tableau Algorithms for Coalgebraic Logics. - Rajeev Goré; Clemens Kupke; Dirk Pattinson (TACAS, 2010)

Cut elimination in coalgebraic logics. - Dirk Pattinson; Lutz Schröder (Inf. Comput., 2010)

Hybrid logic with the difference modality for generalisations of graphs. - Robert S. R. Myers; Dirk Pattinson (J. Appl. Log., 2010)

Rank-1 Modal Logics are Coalgebraic. - Lutz Schröder; Dirk Pattinson (J. Log. Comput., 2010)

On the Fusion of Coalgebraic Logics. - Fredrik Dahlqvist; Dirk Pattinson (CALCO, 2011)

Description Logics and Fuzzy Probability. - Lutz Schröder; Dirk Pattinson (IJCAI, 2011)

Cut Elimination for Shallow Modal Logics. - Björn Lellmann; Dirk Pattinson (TABLEAUX, 2011)

Coalgebraic Predicate Logic: Equipollence Results and Proof Theory. - Tadeusz Litak; Dirk Pattinson; Katsuhiko Sano (TbiLLC, 2011)

Modal Logics are Coalgebraic. - Corina Cîrstea; Alexander Kurz 001; Dirk Pattinson; Lutz Schröder; Yde Venema (Comput. J., 2011)

Generic Modal Cut Elimination Applied to Conditional Logics - Dirk Pattinson; Lutz Schröder (Log. Methods Comput. Sci., 2011)

EXPTIME Tableaux for the Coalgebraic mu-Calculus - Corina Cîrstea; Clemens Kupke; Dirk Pattinson (Log. Methods Comput. Sci., 2011)

Towards Effects in Mathematical Operational Semantics. - Faris Abou-Saleh; Dirk Pattinson (MFPS, 2011)

Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra. - Lutz Schröder; Dirk Pattinson (Math. Struct. Comput. Sci., 2011)

Coalgebraic semantics of modal logics: An overview. - Clemens Kupke; Dirk Pattinson (Theor. Comput. Sci., 2011)

Coalgebraic Predicate Logic. - Tadeusz Litak; Dirk Pattinson; Katsuhiko Sano; Lutz Schröder (ICALP (2), 2012)

Sequent Systems for Lewis' Conditional Logics. - Björn Lellmann; Dirk Pattinson (JELIA, 2012)

Solving Graded/Probabilistic Modal Logic via Linear Inequalities (System Description). - William Snell; Dirk Pattinson; Florian Widmann (LPAR, 2012)

Comodels and Effects in Mathematical Operational Semantics. - Faris Abou-Saleh; Dirk Pattinson (FoSSaCS, 2013)

Some Sahlqvist Completeness Results for Coalgebraic Logics. - Fredrik Dahlqvist; Dirk Pattinson (FoSSaCS, 2013)

Constructing Cut Free Sequent Systems with Context Restrictions Based on Classical or Intuitionistic Logic. - Björn Lellmann; Dirk Pattinson (ICLA, 2013)

Syntactic Labelled Tableaux for Lukasiewicz Fuzzy ALC. - Agnieszka Kulacka; Dirk Pattinson; Lutz Schröder (IJCAI, 2013)

The Logic of Exact Covers: Completeness and Uniform Interpolation. - Dirk Pattinson (LICS, 2013)

Correspondence between Modal Hilbert Axioms and Sequent Rules with an Application to S5. - Björn Lellmann; Dirk Pattinson (TABLEAUX, 2013)

A computational model for multi-variable differential calculus. - Abbas Edalat; André Lieutier; Dirk Pattinson (Inf. Comput., 2013)

Cool - A Generic Reasoner for Coalgebraic Hybrid Logics (System Description). - Daniel Gorín; Dirk Pattinson; Lutz Schröder; Florian Widmann; Thorsten Wißmann (IJCAR, 2014)

Coalgebraic Weak Bisimulation from Recursive Equations over Monads. - Sergey Goncharov 001; Dirk Pattinson (ICALP (2), 2014)

Vote Counting as Mathematical Proof. - Dirk Pattinson; Carsten Schürmann 001 (Australasian Conference on Artificial Intelligence, 2015)

Simplified Coalgebraic Trace Equivalence. - Alexander Kurz 001; Stefan Milius; Dirk Pattinson; Lutz Schröder (Software, Services, and Systems, 2015)

Generic Trace Semantics and Graded Monads. - Stefan Milius; Dirk Pattinson; Lutz Schröder (CALCO, 2015)

Reasoning with Global Assumptions in Arithmetic Modal Logics. - Clemens Kupke; Dirk Pattinson; Lutz Schröder (FCT, 2015)

Sound and Complete Equational Reasoning over Comodels. - Dirk Pattinson; Lutz Schröder (MFPS, 2015)

From the Editors. - Dirk Pattinson; Lutz Schröder (J. Comput. Syst. Sci., 2015)

A New Foundation for Finitary Corecursion - The Locally Finite Fixpoint and Its Properties. - Stefan Milius; Dirk Pattinson; Thorsten Wißmann (FoSSaCS, 2016)

Program Equivalence is Coinductive. - Dirk Pattinson; Lutz Schröder (LICS, 2016)

A New Foundation for Finitary Corecursion. - Stefan Milius; Dirk Pattinson; Thorsten Wißmann (CoRR, 2016)

Formally verified invariants of vote counting schemes. - Florrie Verity; Dirk Pattinson (ACSW, 2017)

Uniform Interpolation in Coalgebraic Modal Logic. - Fatemeh Seifan; Lutz Schröder; Dirk Pattinson (CALCO, 2017)

Schulze Voting as Evidence Carrying Computation. - Dirk Pattinson; Mukesh Tiwari (ITP, 2017)

A Formally Verified Single Transferable Voting Scheme with Fractional Values. - Milad K. Ghale; Rajeev Goré; Dirk Pattinson (E-VOTE-ID, 2017)

No More Excuses: Automated Synthesis of Practical and Verifiable Vote-Counting Programs for Complex Voting Schemes. - Lyria Bennett Moses; Rajeev Goré; Ron Levy; Dirk Pattinson; Mukesh Tiwari (E-VOTE-ID, 2017)

Model Theory and Proof Theory of CPL. - Tadeusz Litak; Dirk Pattinson; Katsuhiko Sano; Lutz Schröder (CoRR, 2017)

A Van Benthem/Rosen theorem for coalgebraic predicate logic. - Lutz Schröder; Dirk Pattinson; Tadeusz Litak (J. Log. Comput., 2017)

A Resolution-Based Calculus for Preferential Logics. - Cláudia Nalon; Dirk Pattinson (IJCAR, 2018)

A van Benthem Theorem for Fuzzy Modal Logic. - Paul Wild; Lutz Schröder; Dirk Pattinson; Barbara König 001 (LICS, 2018)

Modular Formalisation and Verification of STV Algorithms. - Milad K. Ghale; Rajeev Goré; Dirk Pattinson; Mukesh Tiwari (E-Vote-ID, 2018)

Verified Certificate Checking for Counting Votes. - Milad K. Ghale; Dirk Pattinson; Ramana Kumar; Michael Norrish (VSTTE, 2018)

A van Benthem Theorem for Quantitative Probabilistic Modal Logic. - Paul Wild; Lutz Schröder; Dirk Pattinson; Barbara König 001 (CoRR, 2018)

Model Theory and Proof Theory of Coalgebraic Predicate Logic. - Tadeusz Litak; Dirk Pattinson; Katsuhiko Sano; Lutz Schröder (Log. Methods Comput. Sci., 2018)

Modular synthesis of verified verifiers of computation with STV algorithms. - Milad K. Ghale; Dirk Pattinson; Michael Norrish (FormaliSE@ICSE, 2019)

A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic. - Paul Wild; Lutz Schröder; Dirk Pattinson; Barbara König 001 (IJCAI, 2019)

Verifiable Homomorphic Tallying for the Schulze Vote Counting Scheme. - Thomas Haines; Dirk Pattinson; Mukesh Tiwari (VSTTE, 2019)

Hennessy-Milner Properties for (Modal) Bi-intuitionistic Logic. - Jim de Groot; Dirk Pattinson (WoLLIC, 2019)

Preface for the special issue of Proof, Structure, and Computation 2014. - Dirk Pattinson; Peter Schuster 001; Ana Sokolova (J. Log. Comput., 2019)

Modal Intuitionistic Logics as Dialgebraic Logics. - Jim de Groot; Dirk Pattinson (LICS, 2020)

Domain Theoretic Second-Order Euler's Method for Solving Initial Value Problems. - Abbas Edalat; Amin Farjudian; Mina Mohammadian; Dirk Pattinson (MFPS, 2020)

A new foundation for finitary corecursion and iterative algebras. - Stefan Milius; Dirk Pattinson; Thorsten Wißmann (Inf. Comput., 2020)

The Alternating-Time μ-Calculus with Disjunctive Explicit Strategies. - Merlin Göttlinger; Lutz Schröder; Dirk Pattinson (CSL, 2021)

Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication. - Jim de Groot; Tadeusz Litak; Dirk Pattinson (LICS, 2021)

Constructive Domains with Classical Witnesses. - Dirk Pattinson; Mina Mohammadian (Log. Methods Comput. Sci., 2021)

Hennessy-Milner properties via topological compactness. - Jim de Groot; Dirk Pattinson (Inf. Comput., 2022)

Modal meet-implication logic. - Jim de Groot; Dirk Pattinson (Log. Methods Comput. Sci., 2022)

Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics. - Clemens Kupke; Dirk Pattinson; Lutz Schröder (ACM Trans. Comput. Log., 2022)

Benchmark data for COOL 2.2. - Oliver Görlitz; Daniel Hausmann 001; Merlin Humml; Dirk Pattinson; Simon Prucker; Lutz Schröder (Zenodo, 2022)

COOL 2 - A Generic Reasoner for Modal Fixpoint Logics (System Description). - Oliver Görlitz; Daniel Hausmann 001; Merlin Humml; Dirk Pattinson; Simon Prucker; Lutz Schröder (CADE, 2023)

Resolution Calculi for Non-normal Modal Logics. - Dirk Pattinson; Nicola Olivetti; Cláudia Nalon (TABLEAUX, 2023)

COOL 2 - A Generic Reasoner for Modal Fixpoint Logics. - Oliver Görlitz; Daniel Hausmann 001; Merlin Humml; Dirk Pattinson; Simon Prucker; Lutz Schröder (CoRR, 2023)

Benchmarking scripts for COOL 2.3. - Oliver Görlitz; Daniel Hausmann 001; Merlin Humml; Dirk Pattinson; Simon Prucker; Lutz Schröder (Zenodo, 2023)

Benchmarking scripts for COOL 2.3. - Oliver Görlitz; Daniel Hausmann 001; Merlin Humml; Dirk Pattinson; Simon Prucker; Lutz Schröder (Zenodo, 2023)

Benchmarking scripts for COOL 2.4. - Oliver Görlitz; Daniel Hausmann 001; Merlin Humml; Dirk Pattinson; Simon Prucker; Lutz Schröder (Zenodo, 2023)

Non-iterative Modal Resolution Calculi. - Dirk Pattinson; Cláudia Nalon (IJCAR (2), 2024)

From Modal Sequent Calculi to Modal Resolution. - Dirk Pattinson; Cláudia Nalon; Sourabh Peruri (CADE, 2025)

A Coinductive Representation of Computable Functions. - Alvin Tang; Dirk Pattinson (CALCO, 2025)