Teaching Projects Research PhD Topics Talks Publications Software Haskell

Books edited

[1] D. Pattinson and L. Schröder. Journal of Computer and System Sciences, 81(5), 2015. Special Issue on Coalgebraic Methods in Computer Science. [ bib ]
[2] Dirk Pattinson and Lutz Schröder, editors. Coalgebraic Methods in Computer Science, volume 7399 of Lecture Notes in Comp. Sci. Springer, 2012. [ bib ]
[3] M. Wirsing, D. Pattinson, and R. Hennicker, editors. Recent Trends in Algebraic Development Techniques, volume 2755 of Lecture Notes in Comp. Sci. Springer, 2003. [ bib | http ]
[4] J. Berger, D. Pattinson, P. Schuster, and J. Zappe (eds.). Mathematical Logic Quarterly, 54(1), 2008. Special Issue on Recent Trends in Constructive Mathematics. [ bib ]

Journal Articles

[1] Lutz Schröder, Dirk Pattinson, and Tadeusz Litak. A van benthem/rosen theorem for coalgebraic predicate logic. Journal of Logic and Computation, 2015. Advance Access Published July 6, 2015. [ bib | .pdf ]
[2] Abbas Edalat, André Lieutier, and Dirk Pattinson. A computational model for multi-variable differential calculus. Inf. Comput., 224:23-45, 2013. [ bib | .pdf ]
[3] Corina Cîrstea, Alexander Kurz, Dirk Pattinson, Lutz Schröder, and Yde Venema. Modal logics are coalgebraic. Comput. J., 54(1):31-41, 2011. [ bib | .pdf ]
[4] D. Pattinson and L. Schröder. Generic modal cut elimination applied to conditional logics. Logical Methods in Computer Science, 7(1), 2011. 25 pages. [ bib | .pdf ]
[5] C. Cirstea, C. Kupke, and D. Pattinson. EXPTIME tableaux for the coalgebraic μ-calculus. Logical Methods in Computer Science, 7(3), 2011. [ bib | .pdf ]
[6] L. Schröder and D. Pattinson. Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra. Mathematical Structures in Computer Science, 21, 2011. [ bib | .pdf ]
[7] C. Kupke and D. Pattinson. Coalgebraic semantics of modal logics: an overview. Theoretical Computer Science, 412(38):5070-5094, 2011. Special issue CMCS 2010. [ bib | .pdf ]
[8] D. Pattinson and L. Schröder. Cut elimination in coalgebraic logics. Information and Computation, 208:1447-1468, 2010. [ bib | .pdf ]
[9] R. Myers and D. Pattinson. Hybrid logic with the difference modality for generalisations of graphs. J. Applied Logic, 8(4):441-458, 2010. [ bib | .pdf ]
[10] L. Schröder and D. Pattinson. Rank-1 logics are coalgebraic. Journal of Logic and Computation, 20(5):1113-1147, 2010. [ bib | .pdf ]
[11] P. Hancock, D. Pattinson, and N. Ghani. Representations of stream processors using nested fixed points. Logical Methods in Computer Science, 5(3), 2009. [ bib | .pdf ]
[12] L. Schröder and D. Pattinson. PSPACE bounds for rank-1 modal logics. ACM Transactions on Computational Logics, 10(2), 2009. [ bib | .pdf ]
[13] A. Edalat and D. Pattinson. Denotational semantics of hybrid automata. Journal of Logic and Algebraic Programming, 73:3-21, 2007. [ bib | .pdf ]
[14] C. Cirstea and D. Pattinson. Modular construction of complete coalgebraic logics. Theoretical Computer Science, 388:83-108, 2007. [ bib | .pdf ]
[15] A. Edalat and D. Pattinson. A domain-theoretic account of Picard's theorem. LMS Journal of Computation and Mathematics, 10:83-118, 2007. [ bib | .pdf ]
[16] A. Kurz and D. Pattinson. Coalgebraic modal logic of finite rank. Mathematical Structures in Computer Science, 15(3):453-473, 2005. [ bib | .pdf ]
[17] D. Pattinson and M. Wirsing. A coordination approach to mobile components. Theoretical Computer Science, 331(2-3):457-483, 2005. [ bib | .pdf ]
[18] D. Pattinson. Expressive logics for coalgebras via terminal sequence induction. Notre Dame Journal of Formal Logic, 45(1):19-33, 2004. [ bib | .pdf ]
[19] D. Pattinson. Coalgebraic modal logic: Soundness, completeness and decidability of local consequence. Theoretical Computer Science, 309(1-3):177-193, 2003. [ bib | .pdf ]

Refereed Conference and Workshop Proceedings

[1] Florrie Verity and Dirk Pattinson. Formally verified invariants of vote counting schemes. In Proc. ACSW 2017, pages 31:1-31:10. ACM, 2017. [ bib | .pdf ]
[2] Dirk Pattinson and Florrie Verity. Modular synthesis of provably correct vote counting programs. In Robert Krimmer and Melanie Volkamer, editors, Proc. E-Vote-ID 2016, 2016. [ bib | .pdf ]
[3] Dirk Pattinson and Lutz Schröder. Program equivalence is coinductive. In Natarajan Shankar, editor, Proc. LICS 2016. IEEE, 2016. [ bib | .pdf ]
[4] Stefan Milius, Dirk Pattinson, and Thorsten Wißmann. A new foundation for finitary corecursion. In Bart Jacobs and Christof Löding, editors, Proc. FOSSACS 2016, Lecture Notes in Computer Science. Springer, 2016. [ bib | .pdf ]
[5] Dirk Pattinson and Carsten Schürmann. Vote counting as mathematical proof. In Bernhard Pfahringer and Jochen Renz, editors, Proc. AI 2015, Lecture Notes in Comp. Sci. Springer, 2015. [ bib | .pdf ]
[6] Dirk Pattinson and Lutz Schröder. Sound and complete equational reasoning over comodels. In Dan Ghica, editor, Proc. MFPS 2015, Electr. Notes in Theoret. Comp. Sci., 2015. [ bib | .pdf ]
[7] Stefan Milius, Dirk Pattinson, and Lutz Schröder. Generic trace semantics and graded monads. In Larry Moss and Pawel Sobocinsky, editors, Proc. CALCO 2015, Lecture Notes in Comp. Sci. Springer, 2015. [ bib | .pdf ]
[8] Clemens Kupke, Dirk Pattinson, and Lutz Schröder. Reasoning with global assumptions in arithmetic modal logics. In Adrian Kosowski and Igor Walukiewicz, editors, Proc. FCT 2015, Lecture Notes in Computer Science. Springer, 2015. [ bib | .pdf ]
[9] Alexander Kurz, Stefan Milius, Dirk Pattinson, and Lutz Schröder. Simplified coalgebraic trace equivalence. In Rolf Hennicker and Rocco de Nicola, editors, Software, Services and Systems, volume 8950 of Lecture Notes in Computer Science. Springer, 2015. [ bib | .pdf ]
[10] Sergey Goncharov and Dirk Pattinson. Coalgebraic weak bisimulation from recursive equations over monads. In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias, editors, Proc. ICALP 2014, volume 8573 of Lecture Notes in Computer Science, pages 196-207. Springer, 2014. [ bib | .pdf ]
[11] Daniel Gorín, Dirk Pattinson, Lutz Schröder, Florian Widmann, and Thorsten Wißmann. Cool - A generic reasoner for coalgebraic hybrid logics (system description). In Stéphane Demri, Deepak Kapur, and Christoph Weidenbach, editors, Proc. IJCAR 2014, volume 8562 of Lecture Notes in Computer Science, pages 396-402. Springer, 2014. [ bib | .pdf ]
[12] Björn Lellmann and Dirk Pattinson. Correspondence between modal hilbert axioms and sequent rules with an application to S5. In Didier Galmiche and Dominique Larchey-Wendling, editors, Proc. TABLEAUX 2013, LNCS. Springer, 2013. [ bib | .pdf ]
[13] Dirk Pattinson. The logic of exact covers: Completeness and uniform interpolation. In Orna Kupferman, editor, Proc. LICS 2013. IEEE, 2013. [ bib | .pdf ]
[14] Agnieszka Kulacka, Dirk Pattinson, and Lutz Schröder. Syntactic labelled tableaux for lukasiewicz fuzzy ALC. In Sebastian Thrun, editor, Proc. IJCAI 2013. IJCAI/AIII, 2013. [ bib | .pdf ]
[15] T. Litak, D. Pattinson, K. Sano, and L. Schröder. Coalgebraic predicate logic: Equipollence results and proof theory. In G. Bezhanishvili, S. Loebner, V. Marra, and F. Richter, editors, Proc. TbiLLC 2011 (selected and revised papers), LNCS. Springer, 2013. [ bib | .pdf ]
[16] Faris Abou-Saleh and Dirk Pattinson. Comodels and effects in mathematical operational semantics. In Frank Pfenning, editor, Proc. FoSSaCS 2013, volume 7794 of Lecture Notes in Computer Science, pages 129-144. Springer, 2013. [ bib | .pdf ]
[17] Fredrik Dahlqvist and Dirk Pattinson. Some sahlqvist completeness results for coalgebraic logics. In Frank Pfenning, editor, Proc. FoSSaCS 2013, volume 7794 of Lecture Notes in Computer Science, pages 193-208. Springer, 2013. [ bib | .pdf ]
[18] Björn Lellmann and Dirk Pattinson. Constructing cut free sequent systems with context restrictions based on classical or intuitionistic logic. In Kamal Lodaya, editor, Proc. ICLA 2013, volume 7750 of Lecture Notes in Computer Science, pages 148-160. Springer, 2013. [ bib | .pdf ]
[19] Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, and Lutz Schröder. Coalgebraic predicate logic. In Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, and Roger Wattenhofer, editors, Proc. ICALP 2012, volume 7392 of Lecture Notes in Computer Science, pages 299-311. Springer, 2012. [ bib ]
[20] Björn Lellmann and Dirk Pattinson. Sequent systems for lewis' conditional logics. In Luis Fariñas del Cerro, Andreas Herzig, and Jérôme Mengin, editors, Proc. JELIA 2012, volume 7519 of Lecture Notes in Computer Science, pages 320-332. Springer, 2012. [ bib | .pdf ]
[21] William Snell, Dirk Pattinson, and Florian Widmann. Solving graded/probabilistic modal logic via linear inequalities (system description). In Nikolaj Bjørner and Andrei Voronkov, editors, Proc. LPAR 2012, volume 7180 of Lecture Notes in Computer Science, pages 383-390. Springer, 2012. [ bib ]
[22] F. Abou-Saleh and D. Pattinson. Towards effects in mathematical operational semantics. In J. Ouaknine, editor, Proc. MFPS XXVII, Electr. Notes in Theoret. Comp. Sci., 2011. [ bib | .pdf ]
[23] Fredrik Dahlqvist and Dirk Pattinson. On the fusion of coalgebraic logics. In Andrea Corradini, Bartek Klin, and Corina Cîrstea, editors, Proc. CALCO 2011, volume 6859 of Lecture Notes in Computer Science, pages 161-175. Springer, 2011. [ bib | .pdf ]
[24] L. Schröder and D. Pattinson. Description logics and fuzzy probability. In T. Walsh, editor, Proc. IJCAI 2011, pages 1075-1080. AAAI Press, 2011. [ bib | .pdf ]
[25] B. Lellmann and D. Pattinson. Cut elimination for shallow modal logics. In K. Brünnler and G. Metcalfe, editors, Proc. Tableaux 2011, volume 6793 of Lecture Notes in Artificial Intelligence, pages 211-225, 2011. [ bib | .pdf ]
[26] D. Pattinson and L. Santocanale. How to cover without lifting relations, 2011. TbiLLC 2011. [ bib | .pdf ]
[27] C. Kupke and D. Pattinson. On modal logics of linear inequalities. In V. Goranko and V. Shehtman, editors, Proc. AiML 2010. College Publications, 2010. [ bib | .pdf ]
[28] R. Goré, C. Kupke, D. Pattinson, and L. Schröder. Global caching for coalgebraic description logics. In J. Giesl and R. Haehnle, editors, Proc. IJCAR 2010, number 6173 in Lecture Notes in Comp. Sci., pages 46-60, 2010. [ bib | .pdf ]
[29] L. Schröder, D. Pattinson, and D. Hausmann. Optimal tableaux for conditional logics with cautious monotonicity. In H. Coelho, R. Studer, and M. Wooldridge, editors, Proc. ECAI 2010, volume 215 of Frontiers in Artificial Intelligence and Applications, pages 707-712. IOS Press, 2010. [ bib | .pdf ]
[30] L. Schröder and D. Pattinson. Coalgebraic correspondence theory. In L. Ong, editor, Proc. FoSSaCS 2010, Lecture Notes in Comp. Sci., 2010. [ bib | .pdf ]
[31] L. Schröder and D. Pattinson. Named models in coalgebraic hybrid logic. In J.-Y. Marion and T. Schwentick, editors, Proc. STACS 2010, Leibniz International Proceedings in Informatics, 2010. [ bib | .pdf ]
[32] R. Goré, C. Kupke, and D. Pattinson. Optimal tableau algorithms for coalgebraic logics. In R. Majumdar and J. Esparza, editors, Proc. TACAS 2010, volume 6015 of Lecture Notes in Comp. Sci., pages 114-128, 2010. [ bib | .pdf ]
[33] G. Calin, R. Myers, D. Pattinson, and L. Schröder. ColoSS: The coalgebraic logic satisfiability solver. Electr. Notes Theor. Comput. Sci., 231:41-54, 2009. Proc. Methods for Modalities 5 (2007). [ bib | .pdf ]
[34] N. Ghani, P. Hancock, and D. Pattinson. Continuous functions of final coalgebras. Electr. Notes in Theoret. Comput. Sci., 249:3-18, 2009. Proc. MFPS 2009. [ bib | .pdf ]
[35] C. Cîrstea, C. Kupke, and D. Pattinson. EXPTIME tableaux for the coalgebraic μ-calculus. In E. Grädel and R. Kahle, editors, Proc. CSL 2009, number 5771 in Lecture Notes in Comp. Sci., pages 179-193, 2009. [ bib | .pdf ]
[36] R. Myers, D. Pattinson, and L. Schröder. Coalgebraic hybrid logic. In L. de Alfaro, editor, Proc. FOSSACS 2009, volume 5504 of Lecture Notes in Computer Science, pages 137-151. Springer, 2009. [ bib | .pdf ]
[37] L. Schröder, D. Pattinson, and C. Kupke. Nominals for everyone. In C. Boutilier, editor, Proc. IJCAI 2009, pages 917-922, 2009. online proceedings. [ bib | .pdf ]
[38] L. Schröder and D. Pattinson. Strong completeness of coalgebraic modal logics. In S. Albers and J.-Y. Marion, editors, Proc. STACS 2009, volume 09001 of Dagstuhl Seminar Proceedings, pages 673-684. Schloss Dagstuhl, 2009. [ bib | .pdf ]
[39] D. Pattinson and L. Schröder. Generic modal cut elimination applied to conditional logics. In M. Giese and A. Waaler, editors, Proc. Tableaux 2009, volume 5607 of Lect. Notes in Artificial Intelligence. Springer, 2009. [ bib | .pdf ]
[40] Dirk Pattinson and Lutz Schröder. Admissibility of cut in coalgebraic logics. Electr. Notes Theor. Comput. Sci., 203(5):221-241, 2008. [ bib | .pdf ]
[41] C. Cîrstea, A. Kurz, D. Pattinson, L. Schröder, and Y. Venema. Modal logics are coalgebraic. In S. Abramsky and V. Sassone, editors, BCS Visions in Computer Science, Electronic Workshops in Computing, 2008. [ bib | .pdf ]
[42] D. Pattinson and L. Schröder. Beyond rank 1: Algebraic semantics and finite models for coalgebraic logics. In R. Amadio, editor, Proc. FoSSaCS 2008, number 4962 in LNCS, pages 66-80, 2008. [ bib | .pdf ]
[43] L. Schröder and D. Pattinson. Shallow models for non-iterative modal logics. In A. Dengel, K. Berns, T. Breuel, F. Bomarius, and T. Roth-Berghofer, editors, Proc. KI 2008, volume 5243 of Lecture Notes in Computer Science, pages 324-331. Springer, 2008. [ bib | .pdf ]
[44] L. Schröder and D. Pattinson. How many toes do I have? parthood and number restrictions in description logics. In Proc. Knowledge Representation 2008. AAAI Press, 2008. [ bib | .pdf ]
[45] L. Schröder and D. Pattinson. Modular algorithms for heterogeneous modal logics. In L. Arge, C. Cachin, T. Jurdzinski, and A. Tarlecki, editors, Proc 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), number 4596 in Lecture Notes in Comp. Sci., pages 459-471, 2007. [ bib | .pdf ]
[46] L. Schröder and D. Pattinson. Rank-1 logics are coalgebraic. In W. Thomas and T. Weil, editors, Proc. 24th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2007), number 4393 in Lecture Notes in Comp. Sci., pages 573-585, 2007. [ bib | .pdf ]
[47] A. Edalat and D. Pattinson. Domain theoretic solutions of initial value problems for unbounded vector fields. In M. Escardó, editor, Proc. MFPS XXI, volume 155 of Electr. Notes in Theoret. Comp. Sci., pages 565-581, 2006. [ bib | .pdf ]
[48] N. Ghani, P. Hancock, and D. Pattinson. Continuous functions on final coalgebras. In J. Power, editor, Proc. CMCS 2006, Electr. Notes in Theoret. Comp. Sci., 2006. [ bib | .pdf ]
[49] A. Edalat and D. Pattinson. Denotational semantics of hybrid automata. In L. Aceto and A. Ingofsdottir, editors, Proc. FoSSaCS 2006, volume 3921 of Lecture Notes in Comp. Sci., pages 231-245, 2006. [ bib | .pdf ]
[50] L. Schröder and D. Pattinson. PSPACE bounds for rank-1 modal logics. In Proc. 21st IEEE Symposium on Logic in Computer Science (LICS 2006), pages 231-242, 2006. [ bib | .pdf ]
[51] C. Kupke, A. Kurz, and D. Pattinson. Ultrafilter extensions for coalgebras. In J. Fiadeiro and J. Rutten, editors, Proc. CALCO 2005, volume 3629 of Lecture Notes in Comp. Sci., pages 263-277, 2005. [ bib | .pdf ]
[52] D. Pattinson. Domain theoretic formulation of linear boundary value problems. In B. Loewe, editor, Proc. CiE 2005, number 3526 in Lecture Notes in Comp. Sci., pages 385-395, 2005. [ bib | .pdf ]
[53] A. Edalat, A. Lieutier, and D. Pattinson. A computational model for multi-variable differential calculus. In V. Sassone, editor, Proc. FoSSaCS 2005, volume 3441 of Lecture Notes in Comp. Sci., pages 505-519, 2005. [ bib | .pdf ]
[54] D. Pattinson and B. Reus. A complete temporal and spatial logic for distributed systems. In B. Gramlich, editor, Frontiers of Combining Systems, volume 3717 of Lecture Notes in Artificial Intelligence, pages 122-137, 2005. [ bib | .pdf ]
[55] A. Edalat and D. Pattinson. Inverse and implicit functions in domain theory. In P. Panangaden, editor, Proc. 20th IEEE Symposium on Logic in Computer Science (LICS 2005), pages 417-426, 2005. [ bib | .pdf ]
[56] C. Kupke, A. Kurz, and D. Pattinson. Algebraic semantics for coalgebraic logics. In J. Adàamek and S. Milius, editors, Coalgebraic Methods in Computer Science (CMCS 2004), volume 106 of Electr. Notes in Theoret. Comp. Sci., pages 219-241, 2004. [ bib | .pdf ]
[57] C. Cirstea and D. Pattinson. Modular construction of modal logics. In P. Gardner and N. Yoshida, editors, Proc. CONCUR 2004, volume 3170 of Lecture Notes in Comp. Sci., pages 258-275, 2004. [ bib | .pdf ]
[58] A. Edalat and D. Pattinson. A domain theoretic account of Picard's theorem. In Proc. ICALP 2004, volume 3142 of Lecture Notes in Comp. Sci., pages 494-505, 2004. [ bib | .pdf ]
[59] A. Edalat and D. Pattinson. A domain theoretic account of Euler's method for solving initial value problems. In J. Dongarra, K. Madsen, and J. Wasniewski, editors, Proc. PARA 2004, volume 3732 of Lecture Notes in Comp. Sci., pages 112-121, 2004. [ bib | .pdf ]
[60] A. Edalat and D. Pattinson. Initial value problems in domain theory. In Proc. International Conference on Computability and Complexity in Analysis (CCA 2003), pages 211-227, 2003. [ bib | .pdf ]
[61] D. Pattinson. Computable functions on final coalgebras. In H.-P. Gumm, editor, Coalgebraic Methods in Computer Science (CMCS 2003), volume 82 of Electr. Notes in Theoret. Comp. Sci., pages 1-20, 2003. [ bib | .pdf ]
[62] A. Kurz and D. Pattinson. Definability, canonical models, compactness for finitary coalgebraic modal logic. In L. Moss, editor, Coalgebraic Methods in Computer Science (CMCS 2002), volume 65.1 of Electr. Notes in Theoret. Comp. Sci., pages 1-21, 2002. [ bib | .pdf ]
[63] D. Pattinson and M. Wirsing. Making components move: A separation of concerns approach. In F. de Boer, M. Bonsangue, S. Graf, and W.-P. de Roever, editors, First International Symposium on Formal Methods for Components and Objects (FMCO 2002), volume 2852 of Lecture Notes in Computer Science, pages 487-507, 2002. [ bib | .pdf ]
[64] D. Pattinson. Translating logics for coalgebras. In M. Wirsing, D. Pattinson, and R. Hennicker, editors, Recent Trends in Algebraic Developement Techniques, volume 2755 of Lecture Notes in Comp. Sci., pages 397-412, 2002. [ bib | .pdf ]
[65] D. Pattinson. Modal languages for coalgebras in a topological setting. In U. Montanari, editor, Coalgebraic Methods in Computer Science (CMCS 2001), volume 44.1 of Electr. Notes in Theoret. Comp. Sci., pages 1-14, 2001. [ bib | .pdf ]
[66] D. Pattinson. Semantical Principles in the Modal Logic of Coalgebras. In H. Reichel and A. Ferreira, editors, Proc. 18th Symposium on Theoretical Aspects of Computer Science (STACS 2001), volume 2010 of Lecture Notes in Comp. Sci., pages 514-526, 2001. [ bib | .pdf ]
[67] D. Pattinson. Towards coalgebraic specification of rewrite theories. In M. V. Cengarle, editor, Requirements, Design, Correct Construction and Verification, volume 11 of Fast Reihe Softwaretechnik, 2000. 9 pages. [ bib | .pdf ]
[68] A. Kurz and D. Pattinson. Notes on coalgebras, co-fibrations and concurrency. In H. Reichel, editor, Coalgebraic Methods in Computer Science (CMCS 2000), volume 33 of Electr. Notes in Theoret. Comp. Sci., 2000. 34 pages. [ bib | .pdf ]
[69] D. Pattinson. Modal logic for rewriting theories. In K. Futatsugi, editor, The 3rd International Workshop on Rewriting Logic and its Applications, volume 36 of Electr. Notes in Theoret. Comp. Sci., 2001. [ bib | .pdf ]

Thesis

[1] D. Pattinson. Expressivity Results in the Modal Logic of Coalgebras. PhD thesis, Universität München, June 2001. [ bib ]

Lecture Notes

[1] D. Pattinson. An introduction to the theory of coalgebras, 2003. Lecture Notes, Second North American Summer School on Logic, Language and Information. [ bib | .pdf ]
[2] D. Pattinson. COALA: Coalgebraic logics and applications, 2008. Tutorial Lecture Notes, IJCAR 2008. [ bib | .pdf ]

Popular Science

[1] S. Borst and D. Pattinson. How secure is internet shopping? PM Fragen und Antworten, 4, 2003. In German. [ bib ]
[2] S. Borst and D. Pattinson. What is a software agent? PM Fragen und Antworten, 4, 2003. In German. [ bib ]
[3] S. Borst and D. Pattinson. Cryptography. PM, 12, 2003. In German. [ bib ]

Dirk Pattinson [check HTML] [check CSS]