Publications

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2009

Warning: this comment is included in the final HTML code and is only
hidden via the CSS block below. Documentation on the above cris-parameters: https://www.wp.rrze.fau.de/plugins/portale/fau-cris/
Old way of including the chair publications: 




2025


[193], ,  and :  Algebraic Language Theory with Effects, In Keren Censor-Hillel, Fabrizio Grandoni, Joël Ouaknine, Gabriele Puppis, eds.: 52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, July 8-11, 2025, Aarhus, Denmark, LIPIcs, vol. 334, pp. 165:1–165:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, . [bibtex] [url] [doi]


[192], ,  and : Trees in Coalgebra from Generalized Reachability, In Corina Cîrstea, Alexander Knapp, eds.: 11th Conference on Algebra and Coalgebra in Computer Science (CALCO 2025), Leibniz International Proceedings in Informatics (LIPIcs), vol. 342, pp. 15:1–15:18, . CALCO 2025 Best Paper Award [bibtex] [doi]


[191], , ,  and :  Identity-Preserving Lax Extensions and Where to Find Them, In Olaf Beyersdorff, Michal Pilipczuk, Elaine Pimentel, Kim Thang Nguyen, eds.: 42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, March 4-7, 2025, Jena, Germany, LIPIcs, vol. 327, pp. 40:1–40:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, . [bibtex] [url] [doi]


[190], , , , ,  and :  Quantitative Graded Semantics and Spectra of Behavioural Metrics, In Jörg Endrullis, Sylvain Schmitz, eds.: 33rd EACSL Annual Conference on Computer Science Logic, CSL 2025, February 10-14, 2025, Amsterdam, Netherlands, LIPIcs, vol. 326, pp. 33:1–33:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, . [bibtex] [url] [doi]


2024


[189] and :  Initial Algebras Unchained - A Novel Initial Algebra Construction Formalized in Agda, In Pawel Sobocinski, Ugo Dal Lago, Javier Esparza, eds.: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2024, Tallinn, Estonia, July 8-11, 2024, pp. 72:1–72:14, ACM, . [bibtex] [url] [doi]


[188], , ,  and : A point-free perspective on lax extensions and predicate liftings, In Mathematical Structures in Computer Science, 34(2), pp. 98–127, . [bibtex] [doi]


[187], , , , ,  and : Expressive Quantale-Valued Logics for Coalgebras: An Adjunction-Based Approach, In Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov, eds.: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, LIPIcs, vol. 289, pp. 10:1–10:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, . [bibtex] [doi]


[186], , , , ,  and :  Behavioural Metrics: Compositionality of the Kantorovich Lifting and an Application to Up-To Techniques, In Rupak Majumdar, Alexandra Silva, eds.: 35th International Conference on Concurrency Theory, CONCUR 2024, September 9-13, 2024, Calgary, Canada, LIPIcs, vol. 311, pp. 20:1–20:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, . [bibtex] [url] [doi]


[185], , , ,  and : Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras, In Barbara König, Henning Urbat, eds.: Coalgebraic Methods in Computer Science - 17th IFIP WG 1.3 International Workshop, CMCS 2024, Colocated with ETAPS 2024, Luxembourg City, Luxembourg, April 6-7, 2024, Proceedings, Lecture Notes in Computer Science, vol. 14617, pp. 114–134, Springer, . [bibtex] [doi]


2023


[184] and : Weighted and Branching Bisimilarities from Generalized Open Maps, In Proc. 26th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2023), Lecture Notes in Computer Science, vol. 13992, pp. 308–327, Springer, . [bibtex] [doi]


[183] and : Action Codes, In Kousha Etessami, Uriel Feige, Gabriele Puppis, eds.: 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), Leibniz International Proceedings in Informatics (LIPIcs), vol. 261, pp. 137:1–137:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, . [bibtex] [doi]


[182] and : Bisimilar States in Uncertain Structures, In 10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023), Leibniz International Proceedings in Informatics, pp. 12:1–12:17, . [bibtex] [doi]


[181], , ,  and : Towards a Higher-Order Mathematical Operational Semantics, In In 50th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2023), . [bibtex]


[180], , ,  and : Kantorovich Functors and Characteristic Logics for Behavioural Distances, In Pawel Sobocinski, Orna Kupferman, eds.: Foundations of Software Science and Computation Structures (FoSSaCS 2023), Springer International Publishing, . [bibtex]


[179], , , ,  and : Quantitative Hennessy-Milner Theorems via Notions of Density, In Bartek Klin, Elaine Pimentel, eds.: 31st EACSL Annual Conference on Computer Science Logic, CSL 2023, February 13-16, 2023, Warsaw, Poland, LIPIcs, vol. 252, pp. 22:1–22:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, . [bibtex] [doi]


[178] and :  Fast Coalgebraic Bisimilarity Minimization, In Proc. ACM Program. Lang., 7(POPL), pp. 1514–1541, . [bibtex] [url] [doi]


[177]:  Supported Sets - A New Foundation for Nominal Sets and Automata, In Bartek Klin, Elaine Pimentel, eds.: 31st EACSL Annual Conference on Computer Science Logic, CSL 2023, February 13-16, 2023, Warsaw, Poland, LIPIcs, vol. 252, pp. 38:1–38:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, . [bibtex] [url] [doi]


2022


[176], , ,  and : Stateful Structural Operational Semantics, In Amy Felty, ed.: Proc. 7th International Conference on Formal Structures for Computation and Deduction (FSCD), LIPIcs, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, . To appear; available online at https://arxiv.org/pdf/2202.10866 [bibtex]


[175],  and : Coalgebraic Semantics of Nominal Automata, In Helle Hansen, Fabio Zanasi, eds.: Proc. Coalgebraic Methods in Computer Science (CMCS), LNCS, Springer, . To appear; available online at https://arxiv.org/abs/2202.06546 [bibtex]


[174], , ,  and : Graded Monads and Behavioural Equivalence Games, In Christel Baier, ed.: Proc. 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Association for Computing Machinery, . To appear; available online at https://arxiv.org/pdf/2203.15467 [bibtex]


[173],  and : Distributed Coalgebraic Partition Refinement, In Dana Fisman, Grigore Roşu, eds.: Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Lecture Notes Comput. Sci. (ARCoSS), vol. 13244, pp. 159–177, Springer, . [bibtex]


[172] and :  Characteristic Logics for Behavioural Hemimetrics via Fuzzy Lax Extensions, In Log. Methods Comput. Sci., 18(2), . [bibtex] [url] [doi]


[171]Patricia Bouyer, Lutz Schröder, eds.:  Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings, Lecture Notes in Computer Science, vol. 13242, Springer, . [bibtex] [url] [doi]


2021


[170],  and :  The Alternating-Time µ-Calculus with Disjunctive Explicit Strategies, In Christel Baier, Jean Goubault-Larrecq, eds.: Computer Science Logic, CSL 2021, LIPIcs, vol. 183, pp. 26:1–26:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, . [bibtex] [url] [doi]


[169],  and : Explaining Behavioural Inequivalence Generically in Quasilinear Time, In Serge Haddad, Daniele Varacca, eds.: Proc. 32nd International Conference on Concurrency Theory (CONCUR), LIPIcs, vol. 203, pp. 31:1–32:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, . [bibtex]


[168], ,  and : From Generic Partition Refinement to Weighted Tree Automata Minimization, In Form. Asp. Comput., 33, pp. 695–727, . [bibtex]


[167], ,  and : Nominal Büchi Automata with Name Allocation, In Serge Haddad, Daniele Varacca, eds.: Proc. 32nd International Conference on Concurrency Theory (CONCUR), LIPIcs, vol. 203, pp. 4:1–4:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, . [bibtex]


[166] and : Syntactic Minimization Of Nondeterministic Finite Automata, In Filippo Bonchi, Simon J. Puglisi, eds.: 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), pp. 78:1–78:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, . [bibtex]


[165],  and : Nondeterministic Syntactic Complexity, In Stefan Kiefer, Christine Tasson, eds.: Proc. Foundations of Software Science and Computation Structures (FoSSaCS), Lecture Notes Comput. Sci. (ARCoSS), vol. 12650, pp. 448–468, Springer, . [bibtex]


[164],  and : A Linear-Time Nominal µ-Calculus with Name Allocation, In Filippo Bonchi, Simon Puglisi, eds.: Proc. 46th International Symposium on Mathematical Foundations of Computer Science (MFCS), LIPIcs, vol. 202, pp. 58:1–58:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, . [bibtex]


[163],  and : Coalgebra Encoding for Efficient Minimization, In Naoki Kobayashi, ed.: Proc. 6th International Conference on Formal Structures for Computation and Deduction (FSCD), LIPIcs, vol. 195, pp. 28:1–28:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, . [bibtex]


[162],  and : On Language Varieties Without Boolean Operations, In Alberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron, eds.: Proc. 15th International Conference on Language and Automata Theory and Applications (LATA), LNCS, vol. 12638, pp. 3–15, Springer, . [bibtex]


[161],  and : On the behaviour of coalgebras with side effects and algebras with effectful iteration, In J. Logic Comput., 31(6), pp. 1429–1481, . [bibtex]


[160],  and :  Initial Algebras Without Iteration, In Fabio Gaducci, Alexandra Silva, eds.: 9th Conference on Algebra and Coalgebra in Computer Science (CALCO), LIPIcs, vol. 211, pp. 5:1–5:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, . [bibtex] [url]


[159], ,  and : Reiterman's Theorem on Finite Algebras for a Monad, In ACM Trans. Comput. Log., 22(4:23), . [bibtex]


[158],  and : A metalanguage for guarded iteration, In Theoretical Computer Science, 880, pp. 111–137, . [bibtex]


[157]: Uniform Elgot Iteration in Foundations, In Nikhil Bansal, Emanuela Merelli, James Worrell, eds.: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), LIPIcs, vol. 198, pp. 131:1–131:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, . [bibtex]


[156],  and :  Monads on Categories of Relational Structures, In Fabio Gadducci, Alexandra Silva, eds.: 9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021), LIPIcs, vol. 211, pp. 14:1–14:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, . [bibtex] [url] [doi]


[155],  and :  Behavioural Preorders via Graded Monads, Chapter in , Association for Computing Machinery, . [bibtex] [url]


[154], , ,  and : Argument parsing via corpus queries, In it - Information Technology, 63(1), pp. 31–44, . [bibtex] [doi]


[153] and : Quasipolynomial Computation of Nested Fixpoints, In Jan Friso Groote, Kim Guldstrand Larsen, eds.: Tools and Algorithms for the Construction and Analysis of Systems - 27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings, Part I, Lecture Notes in Computer Science, vol. 12651, pp. 38–56, Springer, . [bibtex] [doi]


[152] and : A Quantified Coalgebraic van Benthem Theorem, In Stefan Kiefer, Christine Tasson, eds.: Foundations of Software Science and Computation Structures - 24th International Conference, FOSSACS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings, Lecture Notes in Computer Science, vol. 12650, pp. 551–571, Springer, . [bibtex] [doi]


[151], ,  and : Finitary monads on the category of posets, In Mathematical Structures in Computer Science, 31(7), pp. 799–821, . [bibtex] [doi]


2020


[150],  and :  Towards a Uniform Theory of Effectful State Machines, In ACM Trans. Comput. Logic, 21(3), . [preprint] [bibtex] [url]


[149], ,  and :  Cheap CTL Compassion in NuSMV, In 21st International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2020), LNCS, vol. 11990, pp. 248–269, Springer, . Artifact evaluation: Available and Functional [bibtex] [url]


[148], , ,  and :  Reconstructing Arguments from Noisy Text, In Datenbank-Spektrum, 20, pp. 123–129, . [bibtex] [url] [doi]


[147], ,  and : Efficient and Modular Coalgebraic Partition Refinement, In Log. Methods. Comput. Sci., 16(1), pp. 8:1–8:63, . [bibtex]


[146], ,  and : Unifying Metadata-Based Storage Reconstruction and Carving with LAYR, In Proc. DFRWS USA, Forensic Science International: Digital Investigation, Elsevier, . To appear [bibtex]


[145] and :  Local Local Reasoning: A BI-Hyperdoctrine for Full Ground Store, In Jean Goubault-Larrecq, Barbara König, eds.: 23rd International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2020), Lecture Notes in Computer Science, vol. 12077, pp. 542–561, Springer, . [bibtex] [url] [doi]


[144]: Implementing Hybrid Semantics: From Functional to Imperative, In Adenilso da Silva Simão  Volker Stolz Violet Ka I Pun, ed.: 17th International Colloquium on Theoretical Aspects of Computing (ICTAC 2020), . [preprint] [bibtex]


[143] and :  Towards Constructive Hybrid Semantics, In Zena M. Ariola, ed.: 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020), Leibniz International Proceedings in Informatics (LIPIcs), vol. 167, pp. 24:1–24:19, Schloss Dagstuhl–Leibniz-Zentrum für Informatik, . [bibtex] [url] [doi]


[142] and :  Automata Learning: An Algebraic Approach, In Holger Hermanns, Lijun Zhang, Naoki Kobayashi, Dale Miller, eds.: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020, pp. 900–914, ACM, . [bibtex] [url] [doi]


[141] and :  Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions, In Igor Konnov, Laura Kovács, eds.: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference), LIPIcs, vol. 171, pp. 27:1–27:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, . [bibtex] [url] [doi]


[140],  and : Explaining Non-bisimilarity in a Coalgebraic Approach: Games and Distinguishing Formulas, In Daniela Petrisan, Jurriaan Rot, eds.: Coalgebraic Methods in Computer Science - 15th IFIP WG 1.3 International Workshop, CMCS 2020, Colocated with ETAPS 2020, Dublin, Ireland, April 25-26, 2020, Proceedings, Lecture Notes in Computer Science, vol. 12094, pp. 133–154, Springer, . [bibtex] [doi]


[139] and : NP Reasoning in the Monotone µ-Calculus, In Nicolas Peltier, Viorica Sofronie-Stokkermans, eds.: Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Paris, France, July 1-4, 2020, Proceedings, Part I, Lecture Notes in Computer Science, vol. 12166, pp. 482–499, Springer, . [bibtex] [doi]


[138] and :  Non-Iterative Modal Logics Are Coalgebraic, In Nicola Olivetti, Rineke Verbrugge, Sara Negri, Gabriel Sandu, eds.: 13th Conference on Advances in Modal Logic, AiML 2020, Helsinki, Finland, August 24-28, 2020, pp. 229–248, College Publications, . [bibtex] [pdf]


[137],  and : On Well-Founded and Recursive Coalgebras, In Barbara König, Jean Goubault-Larrecq, eds.: Proc. Foundations of Software Science and Computation Structures (FoSSaCS), Lecture Notes Comput. Sci. (ARCoSS), vol. 12077, pp. 17–36, Springer, . [bibtex]


2019


[136], ,  and : A Coalgebraic View on Reachability, In Comment. Math. Univ. Carolin., 60(4), . [bibtex]


[135] and : Varietes of Data Languages, In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, Stefano Leonardi, eds.: Proc. 46th International Colloquium on Automata, Languages, and Programming (ICALP), LIPIcs, vol. 132, pp. 130:1–130:14, . Full version available online at https://arxiv.org/abs/1903.08053 [bibtex]


[134], ,  and :  The High-Level Benefits of Low-Level Sandboxing, In Proc. ACM Program. Lang., 4(POPL), . 47th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2020). Artifact evaluation: Reusable [bibtex] [url] [doi]


[133] and : Equational Axiomatization of Algebras with Structure, In Mikołaj Bojańczyk, Alex Simpson, eds.: Proc. Foundations of Software Science and Computation Structures (FoSSaCS), Lecture Notes Comput. Sci. (ARCoSS), vol. 11425, pp. 400–417, Springer, . [bibtex]


[132]:  From Equational Specifications of Algebras with Structure to Varieties of Data Languages, In Markus Roggenbach, Ana Sokolova, eds.: 8th Conference on Algebra and Coalgebra in Computer Science (CALCO), Leibniz International Proceedings in Informatics (LIPIcs), vol. 139, pp. 2:1–2:5, Schloss Dagstuhl, . [bibtex] [url] [doi]


[131], ,  and : Finitely Presentable Algebras for Finitary Monads, In Theory Appl. Categ., 34, pp. 1179–1195, . [bibtex]


[130], ,  and : On Finitary Functors, In Theory Appl. Categ., 34, pp. 1134–1164, . [bibtex]


[129], ,  and : Generalized Eilenberg Theorem: Varieties of Languages in a Category, In ACM Trans. Comput. Log., 20(1), pp. 3:1–3:47, . [bibtex]


[128] and : On Functors Preserving Coproducts and Algebras with Iterativity, In Theoret. Comput. Sci., 763, pp. 66–87, . [bibtex]


[127], ,  and : A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic, In Sarit Kraus, ed.: Proc. International Joint Conference on Artificial Intelligence, IJCAI 2019, ijcai.org, . to appear [preprint] [bibtex]


[126] and :  Lewisian Fixed Points I: Two Incomparable Constructions, In CoRR, abs/1905.09450, . [bibtex] [url]


[125] and :  Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot, In Markus Roggenbach, Ana Sokolova, eds.: Proc. 8rd international conference on Algebra and coalgebra in computer science (CALCO 2019), LIPIcs, vol. 139, pp. 13:1–13:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, . [bibtex] [url] [doi]


[124] and :  Complete Additivity and Modal Incompleteness, In Review of Symbolic Logic, 12(3), pp. 487–535, . Available on arXiv: https://arxiv.org/abs/1809.07542, eScholarship: https://escholarship.org/uc/item/01p9x1hv and publisher's page: https://doi.org/10.1017/S1755020317000259 [bibtex] [url] [doi]


[123] and : Optimal Satisfiability Checking for Arithmetic mu-Calculi, In Mikolaj Bojanczyk, Alex Simpson, eds.: Proc. Foundations of Software Science and Computation Structures, FoSSaCS 2019, LNCS, Springer, . to appear [bibtex]


[122], ,  and :  Guarded and Unguarded Iteration for Generalized Processes, In Logical Methods in Computer Science, 15(3), . [bibtex] [url] [doi]


[121] and : An Adequate While-Language for Hybrid Computation, In Ekaterina Komendantskaya, ed.: Proceedings of the 21th International Symposium on Principles and Practice of Declarative Programming, (PPDP 2019), ACM, . [preprint] [bibtex]


[120], , , , ,  and : Combining Machine Learning and Semantic Features in the Classification of Corporate Disclosures, In J. Logic, Language and Information (JoLLI), . to appear [preprint] [bibtex]


[119],  and :  Graded Monads and Graded Logics for the Linear Time - Branching Time Spectrum, In Wan J. Fokkink, Rob van Glabbeek, eds.: 30th International Conference on Concurrency Theory (CONCUR), Leibniz International Proceedings in Informatics (LIPIcs), vol. 140, pp. 36:1–36:16, Schloss Dagstuhl, . [bibtex] [url] [doi]


[118], ,  and : Generic Partition Refinement and Weighted Tree Automata, In Maurice ter Beek et al., ed.: Proc. International Symposium on Formal Methods (FM'19), Lecture Notes Comput. Sci., vol. 11800, pp. 280–297, Springer, . \bfseries Best Theory Paper at FM 2019 [bibtex]


[117] and :  Game-Based Local Model Checking for the Coalgebraic µ-Calculus, In Wan J. Fokkink, Rob van Glabbeek, eds.: 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands, LIPIcs, vol. 140, pp. 35:1–35:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, . [bibtex] [url] [doi]


2018


[116] and : Lewis meets Brouwer: constructive strict implication, In Indagationes Mathematicae, 29, pp. 36–90, . A special issue "L.E.J. Brouwer, fifty years later" [bibtex] [doi]


[115]: Proper Functors and Fixed Points for Finite Behaviour, In Log. Methods. Comput. Sci., 14(3:22), pp. 32 pp., . [bibtex]


[114], ,  and :  Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages, In Corina Cîrstea, ed.: Proc. Coalgebraic Methods in Computer Science (CMCS'18), Springer, . To appear [bibtex] [url] [doi]


[113],  and : On Algebras with Effectful Iteration, In Corina Cîrstea, ed.: Proc. Coalgebraic Methods in Computer Science (CMCS'18), Lecture Notes Comput. Sci., . To appear [bibtex]


[112],  and : A Categorical Approach to Syntactic Monoids, In Log. Methods Comput. Sci., 14(2:9), pp. 34 pp., . [bibtex]


[111], ,  and :  A van Benthem Theorem for Fuzzy Modal Logic, In Anuj Dawar, Erich Grädel, eds.: Proc. 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, pp. 909–918, ACM, . [preprint] [bibtex] [url] [doi]


[110] and :  Completeness of Flat Coalgebraic Fixpoint Logics, In ACM Trans. Comput. Log., 19(1), pp. 4:1–4:34, . [preprint] [bibtex] [url] [doi]


[109], ,  and :  Model Theory and Proof Theory of Coalgebraic Predicate Logic, In Log. Methods Comput. Sci., 14(1), . [bibtex] [url] [doi]


[108]:  Infinite Populations, Choice and Determinacy, In Studia Logica, 106, pp. 969–999, . [bibtex] [url] [doi]


[107], , , ,  and :  A detailed analysis of the Arden Syntax expression grammar, In J. Biomed. Inf., 83, pp. 196–203, . [bibtex] [url] [doi]


[106],  and :  Permutation Games for the Weakly Aconjunctive mu µ-Calculus, In Dirk Beyer, Marieke Huisman, eds.: Proc. 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2018,, LNCS, vol. 10806, pp. 361–378, Springer, . [bibtex] [url] [doi]


[105] and :  One Modal Logic to Rule Them All?, In G. Bezhanishvili, G. D'Agostino, G. Metcalfe, T. Studer, eds.: Advances in Modal Logic, vol. 12, pp. 367–386, College Publications, . Extended technical report available at https://escholarship.org/uc/item/07v9360j [bibtex] [pdf]


[104] and :  Guarded Traced Categories, In Christel Baier, Ugo Dal Lago, eds.: Proc. 21st International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2018, LNCS, vol. 10803, pp. 313–330, Springer, . [bibtex] [url] [doi]


[103],  and : A Metalanguage for Guarded Iteration, In Bernd Fischer, Tarmo Uustalu, eds.: Theoretical Aspects of Computing – ICTAC 2018, pp. 191–210, Springer International Publishing, .  [ArXiv preprint]  [bibtex]


[102],  and : A Semantics for Hybrid Iteration, In Sven Schewe, Lijun Zhang, eds.: 29th International Conference on Concurrency Theory (CONCUR 2018), LNCS, Springer, . [preprint] [bibtex]


[101], ,  and :  Unguarded Recursion on Coinductive Resumptions, In Log. Methods Comput. Sci., 14(3), . [bibtex] [url] [doi]


2017


[100], ,  and : Eilenberg Theorems for Free, In Kim G. Larsen, Hans L. Bodlaender, Jean-François Raskin, eds.: Proc. 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), LIPIcs, vol. 83, Schloss Dagstuhl, . \bfseries EATCS Best Paper Award [bibtex]


[99], ,  and :  Nominal Automata with Name binding, In Javier Esparza, Andrzej Murawski, eds.: Proc. 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017), Lecture Notes Comput. Sci. (ARCoSS), vol. 10203, pp. 124–142, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-54458-7_8. [bibtex] [url]


[98]: Proper Functors and their Rational Fixed Point, In Filippo Bonchi, Barbara König, eds.: Proc. 7th Conference on Algebra and Coalgebra in Computer Science (CALCO'17), LIPIcs, vol. 72, pp. 18:1–18:15, Schloss Dagstuhl, . To appear [bibtex]


[97]:  Constructive Modalities with Provability Smack (Author's Cut), . Unabridged and extended version of a chapter in the Esakia volume of "Outstanding Contributions to Logic" [bibtex] [url]


[96],  and : A Presentation of Bases for Parametrized Iterativity, In Theory Appl. Categ., 32(19), pp. 682–718, . [bibtex]


[95] and : On Corecursive Algebras for Functors Preserving Coproducts, In Filippo Bonchi, Barbara König, eds.: Proc. 7th Conference on Algebra and Coalgebra in Computer Science (CALCO'17), LIPIcs, vol. 72, pp. 3:1–3:15, Schloss Dagstuhl, . [bibtex]


[94] and :  A Characterization Theorem for a Modal Description Logic, In International Joint Conference on Artificial Intelligence, IJCAI 2017, IJCAI/AAAI, . [preprint] [bibtex] [url] [doi]


[93],  and :  Uniform Interpolation in Coalgebraic Modal Logic, In Proc. 7th Conference on Algebra and Coalgebra in Computer Science, LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, . [preprint] [bibtex] [url] [doi]


[92],  and :  A van Benthem/Rosen Theorem for Coalgebraic Predicate Logic, In Journal of Logic and Computation, 27(3), pp. 749–773, . [preprint] [bibtex] [url]


[91],  and :  Generic Hoare Logic for Order-Enriched Effects with Exceptions, In Phillip James, Markus Roggenbach, eds.: Recent Trends in Algebraic Development Techniques: 23rd IFIP WG 1.3 International Workshop, WADT 2016, Revised Selected Papers, pp. 208–222, Springer, . The final publication is available at Springer via https://doi.org/10.1007/978-3-319-72044-9_14. [bibtex] [pdf]


[90] and :  Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion, In Fundamenta Informaticae, 150, pp. 407–449, . special issue FiCS'13 edited by David Baelde, Arnaud Carayol, Ralph Matthes and Igor Walukiewicz [bibtex] [url] [doi]


[89],  and :  Negative Translations and Normal Modality, In Dale Miller, ed.: 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017), Leibniz International Proceedings in Informatics (LIPIcs), vol. 84, pp. 27:1–27:18, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, .  [Local copy]  [bibtex] [url] [doi]


[88] and :  An Algebraic Glimpse at Bunched Implications and Separation Logic, In CoRR, abs/1709.07063, . To appear in the Outstanding Contributions volume "Hiroakira Ono on Residuated Lattices and Substructural Logics" [bibtex] [url]


[87], ,  and :  Probabilistic Description Logics for Subjective Uncertainty, In J. Artif. Intell. Res. (JAIR), 58, pp. 1–66, . [bibtex] [url]


[86], , , ,  and :  Ontological Modelling of a Psychiatric Clinical Practice Guideline, In Proc. 40th German Conference on Artificial Intelligence (KI 2017), Lect. Notes Comput. Sci, . The final publication is available at Springer via https://doi.org/10.1007/978-3-319-67190-1_24. [bibtex] [pdf]


[85], ,  and :  Unifying Guarded and Unguarded Iteration, In Javier Esparza, Andrzej Murawski, eds.: Proc. 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017), Lect. Notes Comput. Sci. (ArCOSS), vol. 10203, pp. 517–533, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-54458-7_30. [bibtex] [pdf]


[84], , , ,  and :  Combining Machine Learning and Semantic Features in the Classification of Corporate Disclosures, In R. Loukanova, K. Liefke, eds.: Proc. Workshop on Logic and Algorithms in Computational Linguistics, LACompLing 2017, pp. 47 – 62, Stockholm University, . [bibtex] [pdf]


[83], ,  and : Efficient Coalgebraic Partition Refinement, In Proc. 28th International Conference on Concurrency Theory (CONCUR 2017), LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, . [Full version] [bibtex]


[82], , , ,  and :  Automatic verification of application-tailored OSEK kernels, In Daryl Stewart, Georg Weissenbacher, eds.: 2017 Formal Methods in Computer Aided Design, FMCAD 2017, Vienna, Austria, October 2-6, 2017, pp. 196–203, IEEE, . [bibtex] [url] [doi]


2016


[81],  and : An Attack Possibility on Time Synchronization Protocols Secured with TESLA-Like Mechanisms, In Indrajit Ray, Manoj Singh Gaur, Mauro Conti, Dheeraj Sanghi, V. Kamakoti, eds.: Proc. Information Systems Security (ICISS), Lecture Notes Comput. Sci., vol. 10063, pp. 3–22, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-49806-5_1. [bibtex] [doi]


[80],  and : A New Foundation for Finitary Corecursion: The Locally Finite Fixpoint and its Properties, In Bart Jacobs, Christof Löding, eds.: Proc. Foundations of Software Science and Computation Structures (FoSSaCS), Lecture Notes Comput. Sci. (ARCoSS), vol. 9634, pp. 107–125, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-49630-5_7. [bibtex] [doi]


[79], ,  and :  Profinite Monads, Profinite Equations and Reitermann's Theorem, In Bart Jacobs, Christof Löding, eds.: Proc. Foundations of Software Science and Computation Structures (FoSSaCS), Lecture Notes Comput. Sci. (ARCoSS), vol. 9634, pp. 531–547, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-49630-5_31. [bibtex] [url] [doi]


[78] and :  Program equivalence is coinductive, In Martin Grohe, Eric Koskinen, Natarajan Shankar, eds.: Logic in Computer Science, LICS 2016, pp. 337–346, ACM, . [bibtex] [pdf]


[77],  and :  Regular Behaviours with Names, In Appl. Cat. Struct., 24(5), pp. 663–791, . The final publication is available at Springer via http://dx.doi.org/10.1007/s10485-016-9457-8. [bibtex] [pdf] [doi]


[76],  and :  Relational lattices: From databases to universal algebra, In JLAMP, 85(4), pp. 540–573, . special issue with selected papers RAMiCS 2014 edited by Peter Höfner, Peter Jipsen, Wolfram Kahl and Martin E. Müller The final publication is available at Springer via http://dx.doi.org/10.1016/j.jlamp.2015.11.008 [bibtex] [url] [doi]


[75],  and :  Global Caching for the Alternation-free Coalgebraic µ-calculus, In Concurrency Theory, CONCUR 2016, LIPIcs, vol. 59, pp. 34:1–34:15, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, . [bibtex] [url]


[74],  and :  Complete Elgot Monads and Coalgebraic Resumptions, In Electr. Notes Theor. Comput. Sci., 325, pp. 147–168, . [bibtex] [url]


[73],  and :  Completeness for Coalgebraic Fixpoint Logic, In Jean-Marc Talbot, Laurent Regnier, eds.: 25th EACSL Annual Conference on Computer Science Logic (CSL 2016), Leibniz International Proceedings in Informatics (LIPIcs), vol. 62, pp. 7:1–7:19, . [bibtex] [pdf]


2015


[72], , ,  and : On Final Coalgebras of Power-Set Functors and Saturated Trees, In Appl. Categ. Structures, 23(4), pp. 609–641, . Available online; http://dx.doi.org/10.1007/s10485-014-9372-9 [bibtex]


[71],  and : First Results of a Formal Analysis of the Network Time Security Specification, In Liqun Chen, Shin'ichiro Matsuo, eds.: Proc. Security Standardization Research, Lecture Notes Comput. Sci., vol. 9497, pp. 218–245, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-27152-1_12. [bibtex] [doi]


[70], ,  and : Coalgebraic Constructions of Canonical Nondeterministic Automata, In Theoret. Comput. Sci., 604, pp. 81–101, . http:/dx.doi.org/10.1016/j.tcs.2015.03.035 [bibtex]


[69], ,  and :  Simplified Coalgebraic Trace Equivalence, In Software, Services and Systems, Lect. Notes Comput. Sci., vol. 8950, pp. 75–90, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-15545-6_8. [bibtex] [url] [doi]


[68], ,  and : Killing Epsilons with a Dagger: A Coalgebraic Study of Systems with Algebraic Label Structure, In Theoret. Comput. Sci., 604, pp. 102–126, . http://dx.doi.org/10.1016/j.tcs.2015.03.024 [bibtex]


[67], ,  and : On Finitary Functors and Their Presentation, In J. Comput. System Sci., 81(5), pp. 813–833, . http://dx.doi.org/10.1016/j.jcss.2014.12.002 [bibtex]


[66],  and : Syntactic Monoids in a Category, In Lawrence S. Moss, Pawel Sobocinski, eds.: Proc. Coalgebraic and Algebraic Methods in Computer Science (CALCO'15), LIPIcs, vol. 35, . CALCO 2015 Best Paper Award [bibtex]


[65], ,  and : Varieties of Languages in a Category, In Catuscia Palamidessi, ed.: Proc. 30th Annual Symposium on Logic in Computer Science (LICS'15), pp. 414–425, . [bibtex]


[64] and :  Sound and Complete Equational Reasoning over Comodels, In Proc. Mathematical Foundations of Programming Semantics XXXI, MFPS 2015, ENTCS, vol. 319, pp. 315–331, Elsevier, . [bibtex] [pdf]


[63] and : From the editors, In J. Comput. System Sci., 81, pp. 797–798, . Special Issue, 11th International Workshop on Coalgebraic Methods in Computer Science, CMCS 2012 (Selected Papers) [bibtex]


[62] and :  Finitary Corecursion for the Infinitary Lambda Calculus, In Lawrence S. Moss, Pawel Sobocinski, eds.: Proc. 6th Conference on Algebra and Coalgebra in Computer Science, CALCO 2015, Leibniz International Proceedings in Informatics, vol. 35, pp. 336–351, . [bibtex] [pdf]


[61],  and :  Generic Trace Semantics and Graded Monads, In Lawrence S. Moss, Pawel Sobocinski, eds.: Proc. 6th Conference on Algebra and Coalgebra in Computer Science, CALCO 2015, Leibniz International Proceedings in Informatics, vol. 35, pp. 253–269, . [bibtex] [pdf]


[60],  and :  Uniform Interpolation for Coalgebraic Fixpoint Logic, Chapter in Lawrence S. Moss, Pawel Sobocinski, eds.: 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), Leibniz International Proceedings in Informatics (LIPIcs), vol. 35, pp. 238–252, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, . [bibtex] [pdf]


[59],  and :  Reasoning with Global Assumptions in Arithmetic Modal Logics, In Proc. 20th International Symposium on Fundamentals of Computation Theory, FCT 2015, LNCS, vol. 9210, pp. 367–380, Springer, . [bibtex] [pdf]


[58] and :  Global Caching for the Flat Coalgebraic µ-Calculus, In Proc. 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, pp. 121–130, IEEE Comp. Soc., . [bibtex] [pdf]


[57],  and :  Unguarded Recursion on Coinductive Resumptions, In Proc. 31st Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXI), Electronic Notes in Theoretical Computer Science, vol. 319(), pp. 183 – 198, .   [preprint]  [bibtex] [url]


[56],  and :  Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras, In Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), LICS '15, pp. 353–365, IEEE Computer Society, . [bibtex] [url] [doi]


2014


[55]: A dynamical model for individual and social cognitive infocommunications over truth values, In Cognitive Infocommunications (CogInfoCom), 2014 5th IEEE Conference on, pp. 385–389, . [bibtex] [doi]


[54]: Uncertain network reasoning for agents via Gaussian radial basis functions, In Computational Intelligence and Applications (IWCIA), 2014 IEEE 7th International Workshop on, pp. 47–52, . [bibtex] [doi]


[53]:  PCA-based algorithmic approximation of crisp target sets, In 14th UK Workshop on Computational Intelligence, UKCI 2014, Bradford, UK, September 8-10, 2014, pp. 1–8, IEEE, . [bibtex] [url] [doi]


[52] and : Observations on formal safety analysis in practice, In Sci. Comput. Programming, 80A, pp. 150–168, . Available online at http://dx.doi.org/10.1016/j.scico.2013.01.001 [bibtex]


[51], ,  and : Canonical Nondeterministic Automata, In Marcello M. Bonsangue, ed.: Proc. Coalgebraic Methods in Computer Science (CMCS'14), Lecture Notes Comput. Sci., vol. 8446, pp. 189–210, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-44124-4_11. [bibtex] [doi]


[50]:  Data-Based Approximation of Fuzzy Target Sets, In Plamen P. Angelov, Krassimir T. Atanassov, Lyubka Doukovska, Mincho Hadjiski, Vladimir Simov Jotsov, Janusz Kacprzyk, Nikola Kasabov, Sotir Sotirov, Eulalia Szmidt, Slawomir Zadrozny, eds.: Intelligent Systems'2014 - Proceedings of the 7th International Conference Intelligent Systems IEEE IS'2014, September 24-26, 2014, Warsaw, Poland, Volume 1: Mathematical Foundations, Theory, Analyses, Advances in Intelligent Systems and Computing, vol. 322, pp. 801–810, Springer, . [bibtex] [url] [doi]


[49]:  Characterization of Large Target Sets with Probabilistic Classifiers, In Plamen P. Angelov, Krassimir T. Atanassov, Lyubka Doukovska, Mincho Hadjiski, Vladimir Simov Jotsov, Janusz Kacprzyk, Nikola Kasabov, Sotir Sotirov, Eulalia Szmidt, Slawomir Zadrozny, eds.: Intelligent Systems'2014 - Proceedings of the 7th International Conference Intelligent Systems IEEE IS'2014, September 24-26, 2014, Warsaw, Poland, Volume 1: Mathematical Foundations, Theory, Analyses, Advances in Intelligent Systems and Computing, vol. 322, pp. 791–800, Springer, . [bibtex] [url] [doi]


[48]:  Subjective characterization of fuzzy target sets based on a fuzzy universe, In 2014 IEEE International Conference on Granular Computing, GrC 2014, Noboribetsu, Japan, October 22-24, 2014, pp. 25–29, IEEE, . [bibtex] [url] [doi]


[47]:  Full Rough Sets, In Maria Ganzha, Leszek A. Maciaszek, Marcin Paprzycki, eds.: Position Papers of the 2014 Federated Conference on Computer Science and Information Systems, FedCSIS 2014, Warsaw, Poland, September 7-10, 2014., Annals of Computer Science and Information Systems, vol. 3, pp. 3–11, . [bibtex] [url] [doi]


[46], ,  and : How to Kill Epsilons with a Dagger: A Coalgebraic Take on Systems with Algebraic Label Structure, In Marcello M. Bonsangue, ed.: Proc. Coalgebraic Methods in Computer Science (CMCS'14), Lecture Notes Comput. Sci., vol. 8446, pp. 53–74, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-44124-4_4. [bibtex] [doi]


[45], ,  and : An Open Alternative for SMT-based Verification of SCADE Models, In F. Lang, F. Flammini, eds.: Proc. 19th International Workshop on Formal Methods for Industrial Critical Systems (FMICS'14), Lecture Notes Comput. Sci., vol. 8718, pp. 124–139, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-10702-8_9. [bibtex] [doi]


[44],  and : Base Modules for Parametrized Iterativity, In Theoret. Comput. Sci., 523, pp. 56–85, . doi: 10.1016/j.tcs.2013.12.019 [bibtex]


[43], ,  and : On Continuous Nondeterminism and State Minimality, In Bart Jacobs, Alexandra Silva, Sam Staton, eds.: Proc. Mathematical Foundations of Programming Science (MFPS XXX), Electron. Notes Theor. Comput. Sci., vol. 308, pp. 3–23, Elsevier, . [bibtex]


[42], ,  and : Generalized Eilenberg Theorem I: Local Varieties of Language, In Anca Muscholl, ed.: Proc. Foundations of Software Science and Computation Structures (FoSSaCS), Lecture Notes Comput. Sci., vol. 8412, pp. 366–380, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-54830-7_24. [bibtex] [doi]


[41],  and : Corecursive Algebras, Corecursive Monads and Bloom Monads, In Log. Methods Comput. Sci., 10(3:19), pp. 51 pp., . [bibtex]


[40],  and :  Relational Lattices, In Peter Höfner, Peter Jipsen, Wolfram Kahl, Martin E. Müller, eds.: Relational and Algebraic Methods in Computer Science 2014 (RAMiCS), Lecture Notes in Computer Science, vol. 8428, pp. 327–343, Springer International Publishing, . Superseded by the journal version in the special issue of JLAMP with selected papers of RAMiCS 2014 The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-06251-8_20. [bibtex] [url] [doi]


[39]: Constructive modalities with provability smack, Chapter in Guram Bezhanishvili, ed.: Leo Esakia on duality in modal and intuitionistic logics, Outstanding Contributions to Logic, vol. 4, pp. 179–208, Springer, . [bibtex] [doi]


[38], ,  and : Monodic Fragments of Probabilistic First-order Logic, In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias, eds.: Proc. 41st International Colloquium on Automata, Languages, and Programming, ICALP 2014, Lecture Notes in Computer Science, vol. 8573, pp. 256–267, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-43951-7_22. [bibtex] [doi]


[37] and :  Subsumption Checking in Conjunctive Coalgebraic Fixpoint Logics, In Rajeev Goré, Barteld Kooi, Agi Kurucz, eds.: Proc. Advances in Modal Logic, AiML 2014, pp. 254–273, College Publications, . [bibtex] [pdf]


[36], , ,  and :  COOL – A Generic Reasoner for Coalgebraic Hybrid Logics (System Description), In Stéphane Demri, Deepak Kapur, Christoph Weidenbach, eds.: Proc. 7th Internat. Joint Conf. on Automated Reasoning, IJCAR 2014, Lect. Notes Comput. Sci., vol. 8562, pp. 396–402, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-08587-6_31. [bibtex] [pdf] [doi]


[35] and : Coalgebraic Weak Bisimulation from Recursive Equations over Monads, In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias, eds.: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, Lecture Notes in Computer Science, vol. 8573, pp. 196–207, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-43951-7_17. [bibtex] [doi]


[34],  and : Towards a Coalgebraic Chomsky Hierarchy (Extended Abstract), In Josep Diaz, Ivan Lanese, Davide Sangiorgi, eds.: Proc. 8th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS'14), Lecture Notes Comput. Sci., vol. 8705, pp. 265–280, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-44602-7_21. [bibtex] [doi]


[33], , , ,  and :  Towards Ontological Support for Principle Solutions in Mechanical Engineering, In Pawel Garbacz, Oliver Kutz, eds.: Proc. 8th International Conference on Formal Ontology in Information Systems, FOIS 2014, Frontiers in Artificial Intelligence and Applications, vol. 267, pp. 427–432, IOS Press, . [bibtex] [pdf] [doi]


[32], , , ,  and :  Semantic Support for Engineering Design Processes, In Proc. 13th International Design Conference, DESIGN 2014, pp. 1723–1732, . [bibtex] [pdf]


2013


[31]Reiko Heckel, Stefan Milius, eds.: Algebra and Coalgebra in Computer Science: 5th International Conference, CALCO 2013 (Proceedings), Lecture Notes Comput. Sci., vol. 8089, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-40206-7. [bibtex] [doi]


[30],  and : Abstract GSOS Rules and a Modular Treatment of Recursive Definitions, In Log. Methods Comput. Sci., 9(3:28), pp. 52 pp., . [bibtex]


[29], ,  and : Rational Operation Models, In Michael Mislove, ed.: Proc. 29th conference on Mathematical Foundations of Programming Science (MFPS XXIX), Electron. Notes Theor. Comput. Sci., vol. 298, pp. 257–282, . The final publication is available at  http://dx.doi.org/10.1016/j.entcs.2013.09.017. [bibtex] [doi]


[28],  and : Sound and complete axiomatizations of coalgebraic language equivalence, In ACM Trans. Comput. Log., 14(1:7), . [bibtex]


[27],  and : How Iterative Reflections of Monads are Constructed, In Inform. and Comput., 225, pp. 83–118, . Available online at http://dx.doi.org/10.1016/j.ic.2013.02.003 [bibtex]


[26], ,  and : Well-pointed Coalgebras, In Log. Methods Comput. Sci., 9(3:2), pp. 51 pp., . [bibtex]


[25]: Preface to CALCO-Tools, In Reiko Heckel, Stefan Milius, eds.: Proc. 5th International Conference on Algebra and Coalgebra in Computer Science, CALCO 2013, Lecture Notes in Computer Science, vol. 8089, pp. 314, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-40206-7_23. [bibtex] [doi]


[24],  and :  Preface, In Electronic Communications of the ECEASST, 62, . Special Issue Specification, Transformation, Navigation, Dedicated to Bernd Krieg-Brückner [bibtex] [url]


[23] and :  Guard Your Daggers and Traces: On The Equational Properties of Guarded (Co-)recursion, In David Baelde, Arnaud Carayol, eds.: FICS, EPTCS, vol. 126, pp. 72–86, . Superseded by the journal version invited to FI [bibtex] [url]


[22],  and :  Coalgebraic Predicate Logic: Equipollence Results and Proof Theory, Chapter in Guram Bezhanishvili, Sebastian Löbner, Vincenzo Marra, Frank Richter, eds.: Logic, Language, and Computation. Revised Selected Papers of TbiLLC 2011, Lecture Notes in Computer Science, vol. 7758, pp. 257–276, Springer Berlin Heidelberg, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-36976-6_16. [bibtex] [url] [doi]


[21],  and :  Syntactic Labelled Tableaux for Lukasiewicz Fuzzy ALC, In Francesca Rossi, ed.: Proc. 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013, pp. 962–968, IJCAI/AAAI, .   [updated version] [bibtex] [pdf]


[20], ,  and :  Integrating generic sensor fusion algorithms with sound state representations through encapsulation of manifolds, In Information Fusion, 14(1), pp. 57–77, . [bibtex] [url] [doi]


[19] and :  Simulations and Bisimulations For Coalgebraic Modal Logics, In Reiko Heckel, Stefan Milius, eds.: Proc. 5th Conference on Algebra and Coalgebra in Computer Science, CALCO 2013, Lect. Notes Comput. Sci., vol. 8089, pp. 253–266, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-40206-7_19. [bibtex] [url] [doi]


[18],  and :  Reasoning with Bounded Self-reference Using Logical Interpreters, In Thomas Eiter, Birte Glimm, Yevgeny Kazakov, Markus Krötzsch, eds.: 26th International Workshop on Description Logics, DL 2013, CEUR Workshop Proceedings, vol. 1014, pp. 689–703, CEUR-WS.org, . [bibtex] [pdf]


[17] and :  A Relatively Complete Generic Hoare Logic for Order-Enriched Effects, In Proc. 28th Annual Symposium on Logic in Computer Science (LICS 2013), pp. 273–282, IEEE, . [bibtex] [pdf] [doi]


[16] and :  A coinductive calculus for asynchronous side-effecting processes, In Information and Computation, 231(0), pp. 204 – 232, . [bibtex] [pdf] [doi]


[15]: Trace Semantics via Generic Observations, In Reiko Heckel, Stefan Milius, eds.: Algebra and Coalgebra in Computer Science (CALCO 2013), Lecture Notes in Computer Science, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-40206-7_13. [bibtex] [doi]


[14],  and : Integrated program verification tools in education, In Softw., Pract. Exper., 43(4), pp. 403–418, . [bibtex]


[13],  and :  Coalgebraic Announcement Logics, In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg, eds.: Proc. 40th International Colloquium on Automata, Languages and Programming, ICALP 2013, Lect. Notes Comput. Sci., vol. 7966, pp. 101–112, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-39212-2_12. [bibtex] [pdf] [doi]


[12], ,  and :  Exploring the Boundaries of Monad Tensorability on Set, In Logical Methods in Computer Science, 9(3), . [bibtex] [url] [doi]


2012


[11], , , , , ,  and : A framework for formal verification of systems of synchronous components, In Holger Giese, Michaela Huhn, Jan Phillips, Bernhard Schätz, eds.: Tagungsband Modellbasierte Entwicklung eingebetteter Systeme (MBEES'12), pp. 145–154, . [bibtex]


[10],  and : On the formal verification of systems of synchronous software components, In Frank Ortmeier, Peter Daniel, eds.: Proc. SAFECOMP'12, Lecture Notes Comput. Sci., vol. 7612, pp. 291–304, Springer, . Extended version available at http:\\www.versyko.de The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-33678-2_25. [bibtex] [doi]


[9],  and : On the specification of operations on the rational behaviour of systems, In Bas Luttik, Michel A. Reniers, eds.: Proc. Combined Workshop on Expressiveness in Concurrency and Structural Operational Semantics (EXPRESS/SOS'12), Electron. Proc. Theoret. Comput. Sci., vol. 89, pp. 3–18, . [bibtex]


[8], ,  and : Well-Pointed Coalgebras, In Lars Birkedal, ed.: Proc. Foundations of Software Science and Computation Structures (FoSSaCS), Lecture Notes Comput. Sci., vol. 7213, pp. 89–103, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-28729-9_6. [bibtex] [doi]


[7],  and : On Finitary Functors and Their Presentation, In Dirk Pattinson, Lutz Schröder, eds.: Proc. Coalgebraic Methods in Computer Science (CMCS'12), Lecture Notes Comput. Sci., vol. 7399, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-32784-1_4. [bibtex] [doi]


[6], ,  and : Coproducts of Monads on Set, In Proc. 27th Annual Symposium on Logic in Computer Science (LICS'12), . [bibtex]


[5], , , ,  and : A Coalgebraic Perspective on Minimization and Determinization, In Lars Birkedal, ed.: Proc. Foundations of Software Science and Computation Structures (FoSSaCS), Lecture Notes Comput. Sci., vol. 7213, pp. 58–73, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-28729-9_4. [bibtex] [doi]


[4]Dirk Pattinson, Lutz Schröder, eds.: Coalgebraic Methods in Computer Science - 11th International Workshop, CMCS 2012, Colocated with ETAPS 2012, Tallinn, Estonia, March 31 - April 1, 2012, Revised Selected Papers, Lecture Notes in Computer Science, vol. 7399, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-32784-1. [bibtex] [doi]


[3], ,  and :  Coalgebraic Predicate Logic, In Artur Czumaj, Kurt Mehlhorn, Andrew Pitts, Roger Wattenhofer, eds.: Proc. 39th International Colloquium on Automata, Languages, and Programming, ICALP 2012, Lecture Notes in Computer Science, vol. 7392, pp. 299–311, Springer, . [bibtex] [pdf] [doi]


[2] and :  Extending ALCQ With Bounded Self-Reference, In Silvio Ghilardi, Lawrence Moss, eds.: Proc. Advances in Modal Logic 2012, AiML 2012, pp. 300–316, College Publications, . [bibtex] [pdf]


[1] and :  Narcissists Are Easy, Stepmothers Are Hard, In Lars Birkedal, ed.: Proc. 15th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2012, Lecture Notes in Computer Science, vol. 7213, pp. 240–254, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-28729-9_16. [bibtex] [pdf] [doi]