Dirk Pattinson

Orcid: 0000-0002-5832-6666

Affiliations:
  • Australian National University, Canberra, Australia
  • Imperial College London, UK


According to our database1, Dirk Pattinson authored at least 109 papers between 2000 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The Alternating-Time μ-Calculus With Disjunctive Explicit Strategies.
CoRR, 2023

COOL 2 - A Generic Reasoner for Modal Fixpoint Logics.
CoRR, 2023

Resolution Calculi for Non-normal Modal Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2023

COOL 2 - A Generic Reasoner for Modal Fixpoint Logics (System Description).
Proceedings of the Automated Deduction - CADE 29, 2023

2022
Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics.
ACM Trans. Comput. Log., 2022

Modal meet-implication logic.
Log. Methods Comput. Sci., 2022

Hennessy-Milner properties via topological compactness.
Inf. Comput., 2022

2021
Constructive Domains with Classical Witnesses.
Log. Methods Comput. Sci., 2021

Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

The Alternating-Time μ-Calculus with Disjunctive Explicit Strategies.
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020
A new foundation for finitary corecursion and iterative algebras.
Inf. Comput., 2020

Domain Theoretic Second-Order Euler's Method for Solving Initial Value Problems.
Proceedings of the 36th Conference on the Mathematical Foundations of Programming Semantics, 2020

Modal Intuitionistic Logics as Dialgebraic Logics.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

2019
Preface for the special issue of Proof, Structure, and Computation 2014.
J. Log. Comput., 2019

Hennessy-Milner Properties for (Modal) Bi-intuitionistic Logic.
Proceedings of the Logic, Language, Information, and Computation, 2019

Verifiable Homomorphic Tallying for the Schulze Vote Counting Scheme.
Proceedings of the Verified Software. Theories, Tools, and Experiments, 2019

A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Modular synthesis of verified verifiers of computation with STV algorithms.
Proceedings of the 7th International Workshop on Formal Methods in Software Engineering, 2019

2018
Model Theory and Proof Theory of Coalgebraic Predicate Logic.
Log. Methods Comput. Sci., 2018

A van Benthem Theorem for Quantitative Probabilistic Modal Logic.
CoRR, 2018

Verified Certificate Checking for Counting Votes.
Proceedings of the Verified Software. Theories, Tools, and Experiments, 2018

Modular Formalisation and Verification of STV Algorithms.
Proceedings of the Electronic Voting - Third International Joint Conference, 2018

A van Benthem Theorem for Fuzzy Modal Logic.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

A Resolution-Based Calculus for Preferential Logics.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017
A Van Benthem/Rosen theorem for coalgebraic predicate logic.
J. Log. Comput., 2017

Model Theory and Proof Theory of CPL.
CoRR, 2017

No More Excuses: Automated Synthesis of Practical and Verifiable Vote-Counting Programs for Complex Voting Schemes.
Proceedings of the Electronic Voting - Second International Joint Conference, 2017

A Formally Verified Single Transferable Voting Scheme with Fractional Values.
Proceedings of the Electronic Voting - Second International Joint Conference, 2017

Schulze Voting as Evidence Carrying Computation.
Proceedings of the Interactive Theorem Proving - 8th International Conference, 2017

Uniform Interpolation in Coalgebraic Modal Logic.
Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

Formally verified invariants of vote counting schemes.
Proceedings of the Australasian Computer Science Week Multiconference, 2017

2016
A New Foundation for Finitary Corecursion.
CoRR, 2016

Program Equivalence is Coinductive.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

A New Foundation for Finitary Corecursion - The Locally Finite Fixpoint and Its Properties.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015
From the Editors.
J. Comput. Syst. Sci., 2015

Sound and Complete Equational Reasoning over Comodels.
Proceedings of the 31st Conference on the Mathematical Foundations of Programming Semantics, 2015

Reasoning with Global Assumptions in Arithmetic Modal Logics.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

Generic Trace Semantics and Graded Monads.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

Simplified Coalgebraic Trace Equivalence.
Proceedings of the Software, 2015

Vote Counting as Mathematical Proof.
Proceedings of the AI 2015: Advances in Artificial Intelligence, 2015

2014
Coalgebraic Weak Bisimulation from Recursive Equations over Monads.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Cool - A Generic Reasoner for Coalgebraic Hybrid Logics (System Description).
Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013
A computational model for multi-variable differential calculus.
Inf. Comput., 2013

Correspondence between Modal Hilbert Axioms and Sequent Rules with an Application to S5.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2013

The Logic of Exact Covers: Completeness and Uniform Interpolation.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Syntactic Labelled Tableaux for Lukasiewicz Fuzzy ALC.
Proceedings of the IJCAI 2013, 2013

Constructing Cut Free Sequent Systems with Context Restrictions Based on Classical or Intuitionistic Logic.
Proceedings of the Logic and Its Applications, 5th Indian Conference, 2013

Some Sahlqvist Completeness Results for Coalgebraic Logics.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

Comodels and Effects in Mathematical Operational Semantics.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

2012
Solving Graded/Probabilistic Modal Logic via Linear Inequalities (System Description).
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2012

Sequent Systems for Lewis' Conditional Logics.
Proceedings of the Logics in Artificial Intelligence - 13th European Conference, 2012

Coalgebraic Predicate Logic.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Coalgebraic semantics of modal logics: An overview.
Theor. Comput. Sci., 2011

Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra.
Math. Struct. Comput. Sci., 2011

Towards Effects in Mathematical Operational Semantics.
Proceedings of the Twenty-seventh Conference on the Mathematical Foundations of Programming Semantics, 2011

EXPTIME Tableaux for the Coalgebraic mu-Calculus
Log. Methods Comput. Sci., 2011

Generic Modal Cut Elimination Applied to Conditional Logics
Log. Methods Comput. Sci., 2011

Modal Logics are Coalgebraic.
Comput. J., 2011

Coalgebraic Predicate Logic: Equipollence Results and Proof Theory.
Proceedings of the Logic, Language, and Computation, 2011

Cut Elimination for Shallow Modal Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2011

Description Logics and Fuzzy Probability.
Proceedings of the IJCAI 2011, 2011

On the Fusion of Coalgebraic Logics.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010
Rank-1 Modal Logics are Coalgebraic.
J. Log. Comput., 2010

Hybrid logic with the difference modality for generalisations of graphs.
J. Appl. Log., 2010

Cut elimination in coalgebraic logics.
Inf. Comput., 2010

Optimal Tableau Algorithms for Coalgebraic Logics.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

Named Models in Coalgebraic Hybrid Logic.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Coalgebraic Correspondence Theory.
Proceedings of the Foundations of Software Science and Computational Structures, 2010

Optimal Tableaux for Conditional Logics with Cautious Monotonicity.
Proceedings of the ECAI 2010, 2010

Global Caching for Coalgebraic Description Logics.
Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010

On Modal Logics of Linear Inequalities.
Proceedings of the Advances in Modal Logic 8, 2010

2009
PSPACE bounds for rank-1 modal logics.
ACM Trans. Comput. Log., 2009

Representations of Stream Processors Using Nested Fixed Points
Log. Methods Comput. Sci., 2009

Strong Completeness of Coalgebraic Modal Logics.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Nominals for Everyone.
Proceedings of the IJCAI 2009, 2009

Coalgebraic Hybrid Logic.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

EXPTIME Tableaux for the Coalgebraic <i>µ</i>-Calculus.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008
Editorial: Math. Log. Quart. 1/2008.
Math. Log. Q., 2008

Admissibility of Cut in Coalgebraic Logics.
Proceedings of the Ninth Workshop on Coalgebraic Methods in Computer Science, 2008

The craft of model making: PSPACE bounds for non-iterative modal logics
CoRR, 2008

How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, 2008

Shallow Models for Non-iterative Modal Logics.
Proceedings of the KI 2008: Advances in Artificial Intelligence, 2008

Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

2007
Modular construction of complete coalgebraic logics.
Theor. Comput. Sci., 2007

A Domain-Theoretic Account of Picard's Theorem.
LMS J. Comput. Math., 2007

Denotational semantics of hybrid automata.
J. Log. Algebraic Methods Program., 2007

CoLoSS: The Coalgebraic Logic Satisfiability Solver.
Proceedings of the 5th Workshop on Methods for Modalities, 2007

Modular Algorithms for Heterogeneous Modal Logics.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006
Continuous Functions on Final Coalgebras.
Proceedings of the Eighth Workshop on Coalgebraic Methods in Computer Science, 2006

2005
A coordination approach to mobile components.
Theor. Comput. Sci., 2005

Coalgebraic modal logic of finite rank.
Math. Struct. Comput. Sci., 2005

Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields.
Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics, 2005

Inverse and Implicit Functions in Domain Theory.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

A Complete Temporal and Spatial Logic for Distributed Systems.
Proceedings of the Frontiers of Combining Systems, 5th International Workshop, 2005

Domain-Theoretic Formulation of Linear Boundary Value Problems.
Proceedings of the New Computational Paradigms, 2005

Ultrafilter Extensions for Coalgebras.
Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

2004
Expressive Logics for Coalgebras via Terminal Sequence Induction.
Notre Dame J. Formal Log., 2004

Algebraic Semantics for Coalgebraic Logics.
Proceedings of the Workshop on Coalgebraic Methods in Computer Science, 2004

A Domain Theoretic Account of Euler's Method for Solving Initial Value Problems.
Proceedings of the Applied Parallel Computing, 2004

Modular Construction of Modal Logics.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
Coalgebraic modal logic: soundness, completeness and decidability of local consequence.
Theor. Comput. Sci., 2003

Computable Functions on Final Coalgebras.
Proceedings of the 6th International Workshop on Coalgebraic Methods in Computer Science, 2003

2002
Definability, Canonical Models, and Compactness for Finitary Coalgebraic Modal Logic.
Proceedings of the Coalgebraic Methods in Computer Science, 2002

Translating Logics for Coalgebras.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2002

Making Components Move: A Separation of Concerns Approach.
Proceedings of the Formal Methods for Components and Objects, 2002

2001
Modal Languages for Coalgebras in a Topological Setting.
Proceedings of the Coalgebraic Methods in Computer Science, 2001

Semantical Principles in the Modal Logic of Coalgebras.
Proceedings of the STACS 2001, 2001

2000
Modal Logic for Rewriting Theories.
Proceedings of the 3rd International Workshop on Rewriting Logic and its Applications, 2000

Notes on Coalgebras, Cofibrations and Concurrency.
Proceedings of the Coalgebraic Methods in Computer Science, 2000


  Loading...