Lutz Schröder’s Publications

2025
[177], , , , , 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
[176], , , and : A point-free perspective on lax extensions and predicate liftings, In Mathematical Structures in Computer Science, 34(2), pp. 98–127, . [bibtex] [doi]
[175], , , , , 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]
[174], , , , 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
[173], , , and : Towards a Higher-Order Mathematical Operational Semantics, In In 50th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2023), . [bibtex]
[172], , , 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]
[171], , , , 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]
2022
[170], , , 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]
[169], , , 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]
[168] and : Characteristic Logics for Behavioural Hemimetrics via Fuzzy Lax Extensions, In Log. Methods Comput. Sci., 18(2), . [bibtex] [url] [doi]
[167]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
[166], 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]
[165], 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]
[164], , and : From Generic Partition Refinement to Weighted Tree Automata Minimization, In Form. Asp. Comput., 33, pp. 695–727, . [bibtex]
[163], , 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]
[162], 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]
[161], and : A metalanguage for guarded iteration, In Theoretical Computer Science, 880, pp. 111–137, . [bibtex]
[160], 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]
[159], and : Behavioural Preorders via Graded Monads, Chapter in , Association for Computing Machinery, . [bibtex] [url]
[158], , , and : Argument parsing via corpus queries, In it - Information Technology, 63(1), pp. 31–44, . [bibtex] [doi]
[157] 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]
[156] 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]
[155], , and : Finitary monads on the category of posets, In Mathematical Structures in Computer Science, 31(7), pp. 799–821, . [bibtex] [doi]
2020
[154], , , and : Reconstructing Arguments from Noisy Text, In Datenbank-Spektrum, 20, pp. 123–129, . [bibtex] [url] [doi]
[153], , and : Efficient and Modular Coalgebraic Partition Refinement, In Log. Methods. Comput. Sci., 16(1), pp. 8:1–8:63, . [bibtex]
[152] 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]
[151] 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]
[150], 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]
[149] 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]
[148] 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]
2019
[147], , 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]
[146] 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]
[145], , and : Guarded and Unguarded Iteration for Generalized Processes, In Logical Methods in Computer Science, 15(3), . [bibtex] [url] [doi]
[144], , , , , and : Combining Machine Learning and Semantic Features in the Classification of Corporate Disclosures, In J. Logic, Language and Information (JoLLI), . to appear [preprint] [bibtex]
[143], 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]
[142], , 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]
[141] 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
[140], , 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]
[139], , 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]
[138] and : Completeness of Flat Coalgebraic Fixpoint Logics, In ACM Trans. Comput. Log., 19(1), pp. 4:1–4:34, . [preprint] [bibtex] [url] [doi]
[137], , and : Model Theory and Proof Theory of Coalgebraic Predicate Logic, In Log. Methods Comput. Sci., 14(1), . [bibtex] [url] [doi]
[136], , , , and : A detailed analysis of the Arden Syntax expression grammar, In J. Biomed. Inf., 83, pp. 196–203, . [bibtex] [url] [doi]
[135], 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]
[134] 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]
[133], 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]
[132], , and : Unguarded Recursion on Coinductive Resumptions, In Log. Methods Comput. Sci., 14(3), . [bibtex] [url] [doi]
2017
[131], , 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]
[130] and : A Characterization Theorem for a Modal Description Logic, In International Joint Conference on Artificial Intelligence, IJCAI 2017, IJCAI/AAAI, . [preprint] [bibtex] [url] [doi]
[129], 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]
[128], and : A van Benthem/Rosen Theorem for Coalgebraic Predicate Logic, In Journal of Logic and Computation, 27(3), pp. 749–773, . [preprint] [bibtex] [url]
[127], 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]
[126], , and : Probabilistic Description Logics for Subjective Uncertainty, In J. Artif. Intell. Res. (JAIR), 58, pp. 1–66, . [bibtex] [url]
[125], , , , 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]
[124], , 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]
[123], , , , 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]
[122], , 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]
[121], , , , 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
[120] 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]
[119], 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]
[118], 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]
2015
[117], , 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]
[116] 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]
[115] 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]
[114], 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]
[113], 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]
[112] 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]
[111], 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]
2014
[110], , 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]
[109] 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]
[108], , , 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]
[107], , , , 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]
[106], , , , and : Semantic Support for Engineering Design Processes, In Proc. 13th International Design Conference, DESIGN 2014, pp. 1723–1732, . [bibtex] [pdf]
2013
[105]: 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]
[104], and : Preface, In Electronic Communications of the ECEASST, 62, . Special Issue Specification, Transformation, Navigation, Dedicated to Bernd Krieg-Brückner [bibtex] [url]
[103], and : Syntactic Labelled Tableaux for Lukasiewicz Fuzzy ALC, In Francesca Rossi, ed.: Proc. 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013, . To appear [bibtex]
[102], , and : Integrating generic sensor fusion algorithms with sound state representations through encapsulation of manifolds, In Information Fusion, 14(1), pp. 57–77, . [bibtex]
[101] 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., Springer, . To appear [bibtex]
[100], 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]
[99] 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]
[98] and : A coinductive calculus for asynchronous side-effecting processes, In Information and Computation, 231(0), pp. 204 – 232, . [bibtex] [pdf] [doi]
[97], and : Coalgebraic Announcement Logics, In Fedor Fomin, Marta Kwiatkowska, David Peleg, eds.: Proc. 40th International Colloquium on Automata, Languages and Programming, ICALP 2013, Lect. Notes Comput. Sci., Springer, . To appear [bibtex]
[96], , and : Exploring the Boundaries of Monad Tensorability on Set, In Logical Methods in Computer Science, 9(3), . [bibtex] [url] [doi]
2012
[95]Dirk Pattinson, Lutz Schröder, eds.: Proceedings of the 11th International Workshop on Coalgebraic Methods in Computer Science (CMCS 2012), Lect. Notes Comput. Sci., vol. 7399, Springer, . To appear [bibtex]
[94], , 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]
[93] and : Extending ALCQ With Bounded Self-Reference, In Silvio Ghilardi, Lawrence Moss, eds.: Proc. Advances in Modal Logic 2012, AiML 2012, College Publications, . To appear [preprint] [bibtex]
[92] 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]
2011
[91] and : Description Logics and Fuzzy Probability, In Toby Walsh, ed.: International Joint Conference on Artificial Intelligence, IJCAI 2011, pp. 1075–1081, AAAI Press; Menlo Park, CA, . Oral and poster presentation [preprint] [bibtex] [pdf]
[90] and : Modular Algorithms for Heterogeneous Modal Logics via Multi-Sorted Coalgebra, In Math. Struct. Comput. Sci., 21(2), pp. 235–266, . Copyright Cambridge University Press [preprint] [bibtex] [url]
[89] and : Generic Modal Cut Elimination Applied to Conditional Logics, In Log. Methods Comput. Sci., 7(1), . [bibtex] [url]
[88], , and : A Closer Look at the Probabilistic Description Logic Prob-EL, In Wolfram Burgard, Dan Roth, eds.: Proc. 25th Conference on Artificial Intelligence (AAAI-11), pp. 197–202, AAAI Press, . [bibtex]
[87] and : A Counterexample to Tensorability of Effects, In Andrea Corradini, Bartek Klin, eds.: Algebra and Coalgebra in Computer Science (CALCO 2011), Lecture Notes in Computer Science, vol. 6859, pp. 208–221, Springer, . [preprint] [bibtex]
[86] and : A coinductive calculus for asynchronous side-effecting processes, In Olaf Owe, Martin Steffen, Jan Arne Telle, eds.: Fundamentals of Computation Theory (FCT 2011), Lecture Notes in Computer Science, vol. 6914, pp. 276–287, Springer, . [bibtex] [url]
[85] and : Powermonads and Tensors of Unranked Effects, In Martin Grohe, ed.: Logic in Computer Science (LICS 2011), pp. 227–236, IEEE Computer Society, . [bibtex] [url]
[84]Alexander García, Carlos Toro, Luis Ramos, Lutz Schröder, eds.: Proceedings of the 1st International Workshop on Ontology and Semantic Web for Manufacturing (OSEMA 2011) at the 8th Extended Semantic Web Conference (ESWC 2011), CEUR Workshop Proceedings, vol. 748, . [bibtex] [url]
[83], , and : Ontological Semantics of Standards and PLM Repositories in the Product Development Phase, In Alain Bernard, ed.: Global Product Developement: Proc. of the 20th CIRP Design Conference, 2010, pp. 473–482, Springer, . [preprint] [bibtex]
[82], and : Formalizing and Operationalizing Industrial Standards, In Dimitra Giannakopoulou, Fernando Orejas, eds.: Fundamental Approaches to Software Engineering (FASE 2011), Lecture Notes in Computer Science, vol. 6603, pp. 81–95, Springer, . [preprint] [bibtex]
[81], , , and : Modal logics are coalgebraic, In The Computer Journal, 54(1), pp. 31–41, . Extends (Cirstea et al. 2008). [bibtex] [pdf] [preprint] http://comjnl.oxfordjournals.org/cgi/content/abstract/bxp004">[doi]
[80], , and : The Complexity of Probabilistic EL, In Sebastian Rudolph, Michael Zakharyaschev, eds.: Proc. 24th International Workshop on Description Logics (DL 2011), CEUR Workshop Proceedings, . [bibtex] [pdf]
2010
[79] and : Flat coalgebraic fixed point logics, In Paul Gastin, François Laroussinie, eds.: 21st International Conference on Concurrency Theory, CONCUR 2010, Lecture Notes in Computer Science, vol. 6269, pp. 524–538, Springer, . [preprint] [bibtex]
[78] and : Coalgebraic correspondence theory, In Luke Ong, ed.: Foundations of Software Science and Computation Structures (FoSSaCS 2010), Lecture Notes in Computer Science, vol. 6014, pp. 328–342, Springer, . [preprint] [bibtex]
[77] and : Named Models in Coalgebraic Hybrid Logic, In Jean-Yves Marion, Thomas Schwentick, eds.: 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, Leibniz International Proceedings in Informatics, vol. 5, pp. 645–656, Schloss Dagstuhl - Leibniz-Center of Informatics; Dagstuhl, Germany, . [preprint] [bibtex]
[76] and : Rank-1 modal logics are coalgebraic, In Journal of Logic and Computation, 20(5), pp. 1113–1147, . Extends (Schröder and Pattinson STACS 2007) [preprint] [bibtex] [url]
[75], and : Optimal Tableaux for Conditional Logics with Cautious Monotonicity, In Michael Wooldridge, ed.: European Conference on Artificial Intelligence (ECAI 2010), Frontiers in Artificial Intelligence and Applications, vol. 215, pp. 707–712, IOS Press, . [preprint] [bibtex]
[74] and : Cut Elimination in Coalgebraic Logics, In Information and Computation, 208, pp. 1447–1468, . [preprint] [bibtex] [url]
[73], and : A Generic Complete Dynamic Logic for Reasoning about Purity and Effects, In Formal Aspects of Computing, 22(3-4), pp. 363–384, . [preprint] [bibtex] [url]
[72] and : Probabilistic Description Logics for Subjective Uncertainty, In Fangzhen Lin, Ulrike Sattler, Miroslaw Truszczynski, eds.: Principles of Knowledge Representation and Reasoning (KR 2010), pp. 393–403, AAAI Press; Menlo Park, CA, . [preprint] [bibtex]
[71] and : Optimizing Conditional Logic Reasoning within CoLoSS, In Thomas Bolander, Torben Braüner, eds.: Methods for Modalities (M4M-6, 2009), Electronic Notes in Theoretical Computer Science, vol. 262, pp. 157–171, Elsevier; Amsterdam, . [preprint] [bibtex]
[70], , and : Global Caching for Coalgebraic Description Logics, In Jürgen Giesl, Reiner Haehnle, eds.: International Joint Conference on Automated Reasoning, IJCAR 2010, Lecture Notes in Computer Science, vol. 6173, pp. 46–60, Springer, . [preprint] [bibtex]
[69], , and : Creating a HasCASL library, In Jonathan Aldrich, Ricardo Massa, eds.: 14th Brazilian Symposium on Programming Languages (SBLP 2010), . [bibtex]
2009
[68] and : Strong completeness of coalgebraic modal logics, In Susanne Albers, Jean-Yves Marion, eds.: 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), Leibniz International Proceedings in Informatics, pp. 673–684, Schloss Dagstuhl - Leibniz-Center of Informatics; Dagstuhl, Germany, . [bibtex] [url]
[67] and : PSPACE Bounds for Rank-1 Modal Logics, In ACM Transactions on Computational Logic, 10(2:13), pp. 1–33, . [preprint] [bibtex] [url]
[66] and : HasCASL: Integrated Higher-Order Specification and Program Development, In Theoretical Computer Science, 410(12-13), pp. 1217–1260, . [preprint] [bibtex] [url]
[65], and : Nominals for Everyone, In Craig Boutilier, ed.: International Joint Conferences on Artificial Intelligence (IJCAI 2009), pp. 917–922, AAAI Press; Menlo Park, CA, . [preprint] [bibtex]
[64] and : Generic Modal Cut Elimination Applied to Conditional Logics, In Martin Giese, Arild Waaler, eds.: Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2009), Lecture Notes in Computer Science, vol. 5607, pp. 280–294, Springer, . [preprint] [bibtex]
[63], and : Coalgebraic Hybrid Logic, In Luca de Alfaro, ed.: Foundations of Software Science and Computation Structures (FOSSACS 2009), Lecture Notes in Computer Science, vol. 5504, pp. 137–151, Springer, . [preprint] [bibtex]
[62], , and : Formal Management of CAD/CAM Processes, In Ana Cavalcanti, Dennis Dams, eds.: Formal Methods (FM 2009), Lecture Notes in Computer Science, vol. 5850, pp. 223–238, Springer, . [preprint] [bibtex]
[61], and : Kleene Monads: Handling Iteration in a Framework of Generic Effects, In Alexander Kurz, Andrzej Tarlecki, eds.: Algebra and Coalgebra in Computer Science (CALCO 2009), Lecture Notes in Computer Science, vol. 5728, pp. 18–33, Springer, . [preprint] [bibtex]
[60], , and : CoLoSS: The Coalgebraic Logic Satisfiability Solver (System Description), In Carlos Areces, Stephane Demri, eds.: Methods for Modalities (M4M-5, 2007), Electronic Notes in Theoretical Computer Science, vol. 231, pp. 41–54, Elsevier Science; http://www.elsevier.nl/, . [preprint] [bibtex]
2008
[59] and : Shallow models for non-iterative modal logics, In Andreas Dengel, Karsten Berns, Thomas Breuel, Frank Bomarius, Thomas Roth-Berghofer, eds.: Advances in Artificial Intelligence (KI 2008), Lecture Notes in Artificial Intelligence, vol. 5243, pp. 324–331, Springer, . Full version available as e-print arXiv:0802.0116 [preprint] [bibtex] [url]
[58] and : How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics, In Gerhard Brewka, Jerôme Lang, eds.: Principles of Knowledge Representation and Reasoning (KR 2008), pp. 307–218, AAAI Press; Menlo Park, CA, . [preprint] [bibtex]
[57]: Bootstrapping Inductive and Coinductive Types in HasCASL, In Logical Methods in Computer Science, 4(4:17), pp. 1–27, . [bibtex] [url]
[56]: Linearizability of Non-expansive Semigroup Actions on Metric Spaces, In Topology and its Applications, 155, pp. 1576–1579, . Preliminary version appeared as DFKI Research Report RR-06-1, DFKI GmbH, Kaiserslautern, 2006 [preprint] [bibtex]
[55]: Expressivity of Coalgebraic Modal Logic: The Limits and Beyond, In Theoretical Computer Science, 390, pp. 230–247, . Extends (Schröder 2005) [preprint] [bibtex] [url]
[54] and : Admissibility of Cut in Coalgebraic Logics, In J. Adamek, C. Kupke, eds.: Coalgebraic Methods in Computer Science (CMCS 08), Electronic Notes in Theoretical Computer Science, vol. 203, pp. 221–241, Elsevier; Amsterdam, . [preprint] [bibtex] [url]
[53] and : Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics, In Roberto Amadio, ed.: Foundations of Software Science and Computation Structures (FOSSACS 2008), Lecture Notes in Computer Science, vol. 4962, pp. 66–80, Springer, . [preprint] [bibtex] [url]
[52], and : A generic complete dynamic logic for reasoning about purity and effects, In J. Fiadeiro, P. Inverardi, eds.: Fundamental Approaches to Software Engineering (FASE 2008), Lecture Notes in Computer Science, vol. 4961, pp. 199–214, Springer, . [preprint] [bibtex] [url]
[51], , , and : Modal logics are coalgebraic, In Samson Abramsky, Erol Gelenbe, Vladimiro Sassone, eds.: Visions of Computer Science, BCS International Academic Research Conference (BCS 2008), pp. 129–140, British Computer Society, . [preprint] [bibtex]
2007
[50], and : Qualitative Constraint Calculi: Heterogeneous Verification of Composition Tables, In David Wilson, Geoff Sutcliffe, eds.: 20th International FLAIRS Conference (FLAIRS-20), pp. 665–670, AAAI Press, . [preprint] [bibtex]
[49] and : Rank-1 Modal Logics are Coalgebraic, In Wolfgang Thomas, Pascal Weil, eds.: International Symposium on Theoretical Aspects of Computer Science (STACS 07), Lecture Notes in Computer Science, vol. 4393, pp. 573–585, Springer, . Extended version available [preprint] [bibtex] [url]
[48] and : Modular Algorithms for Heterogeneous Modal Logics, In Lars Arge, Andrzej Tarlecki, Christian Cachin, eds.: Automata, Languages and Programming (ICALP 07), Lecture Notes in Computer Science, vol. 4596, pp. 459–471, Springer, . [preprint] [bibtex] [url]
[47] and : Coalgebraic Modal Logic in CoCASL, In José Luiz Fiadeiro, ed.: Recent Trends in Algebraic Development Techniques, 18th International Workshop, WADT 2006, Lecture Notes in Computer Science, vol. 4409, pp. 128–142, Springer, . [preprint] [bibtex] [url]
[46]: Bootstrapping Types and Cotypes in HasCASL, In Till Mossakowski, Udo Montanari, eds.: Algebra and Coalgebra in Computer Science (CALCO 07), Lecture Notes in Computer Science, vol. 4624, pp. 447–462, Springer, . Extended version available [preprint] [bibtex] [url]
[45]: A finite model construction for coalgebraic modal logic, In Journal of Logic and Algebraic Programming (FOSSACS 06 special issue), 73, pp. 97–110, . Extends (Schröder 2006) [preprint] [bibtex] [url]
[44]: Book review: L. M. G. Feijs and H. B. M. Jonkers, Formal Specification and Design, Cambridge University Press, 2005, . [bibtex]
[43], , , and : An Institutional View on Categorical Logic, In Int J Software Informatics, vol. 1(1), pp. 129–152, . [preprint] [bibtex]
2006
[42] and : Closing a Million-Landmarks Loop, In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, Beijing, . [preprint] [bibtex] [url]
[41] and : PSPACE Bounds for Rank 1 Modal Logics, In Rajeev Alur, ed.: Logic in Computer Science (LICS 06), pp. 231–240, IEEE, . Presentation slides available [preprint] [bibtex] [url]
[40]: A Finite Model Construction for Coalgebraic Modal Logic, In Luca Aceto, Anna Ingólfsdóttir, eds.: Foundations Of Software Science And Computation Structures, Lecture Notes in Computer Science, vol. 3921, pp. 157–171, Springer; Berlin; http://www.springer.de, . EATCS Best Paper Award at ETAPS 2006 [preprint] [bibtex] [url]
[39]: The HasCASL Prologue - Categorical Syntax and Semantics of the Partial $\lambda$-calculus, In Theoret. Comput. Sci., 353, pp. 1–25, . [preprint] [bibtex] [url]
[38], , and : Algebraic-co-algebraic specification in CoCASL, In Journal of Logic and Algebraic Programming, 67(1-2), pp. 146–197, . Extends (Mossakowski et al. 2003) [preprint] [bibtex] [url]
[37], and : A Categorical Perspective on Qualitative Constraint Calculi, In Stefan Wölfl, Till Mossakowski, eds.: Qualitative Constraint Calculi - Application and Integration. Workshop at KI 2006, pp. 28–39, . [preprint] [bibtex]
[36], and : A Coalgebraic Approach to the Semantics of the Ambient Calculus, In Theoretical Computer Science, 366(1-2), pp. 121–143, . Extends (Hausmann et al. 2005) [preprint] [bibtex] [url]
[35], and : Completeness of Global Evaluation Logic, In Rastislav Kralovic, Pawel Urzyczyn, eds.: Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 4162, pp. 447–458, Springer; Berlin; http://www.springer.de, . [preprint] [bibtex] [url]
2005
[34], and : Parametrized Exceptions, In Jose Fiadeiro, Jan Rutten, eds.: Algebra and Coalgebra in Computer Science, Lecture Notes in Computer Science, vol. 3629, pp. 424–438, Springer; Berlin; http://www.springer.de, . [preprint] [bibtex] [url]
[33], and : Type class polymorphism in an institutional framework, In José Fiadeiro, ed.: Recent Trends in Algebraic Development Techniques, 17th International Workshop (WADT 2004), Lecture Notes in Computer Science, vol. 3423, pp. 234–248, Springer; Berlin; http://www.springer.de, . [preprint] [bibtex] [url]
[32], , , and : Amalgamation in the semantics of CASL, In Theoretical Computer Science, 331(1), pp. 215–247, . [preprint] [bibtex] [url]
[31]: Expressivity of Coalgebraic Modal Logic: The Limits and Beyond, In Vladimiro Sassone, ed.: Foundations of Software Science And Computation Structures, Lecture Notes in Computer Science, vol. 3441, pp. 440–454, Springer; Berlin; http://www.springer.de, . [preprint] [bibtex] [url]
[30], and : CCC - The CASL Consistency Checker, In José Fiadeiro, ed.: Recent Trends in Algebraic Development Techniques, 17th International Workshop (WADT 2004), Lecture Notes in Computer Science, vol. 3423, pp. 94–105, Springer; Berlin; http://www.springer.de, . [preprint] [bibtex] [url]
[29], and : Iterative Circular Coinduction for CoCASL in Isabelle/HOL, In Maura Cerioli, ed.: Fundamental Approaches to Software Engineering 2005, Lecture Notes in Computer Science, vol. 3442, pp. 341–356, Springer; Berlin; http://www.springer.de, . [preprint] [bibtex] [url]
[28], and : Towards a Coalgebraic Approach to the Semantics of the Ambient Calculus, In Jose Fiadeiro, Neil Harman, Markus Roggenbach, Jan Rutten, eds.: Algebra and Coalgebra in Computer Science, Lecture Notes in Computer Science, vol. 3629, pp. 232–246, Springer; Berlin, . [preprint] [bibtex] [url]
2004
[27] and : Generic exception handling and the Java monad, In Charles Rattray, Savitri Maharaj, Carron Shankland, eds.: Algebraic Methodology and Software Technology, Lecture Notes in Computer Science, vol. 3116, pp. 443–459, Springer, . [preprint] [bibtex] [url]
[26] and : Monad-independent dynamic logic in HasCASL, In Journal of Logic and Computation, 14(4), pp. 571–619, . Earlier version appeared in Martin Wirsing, Dirk Pattinson, and Rolf Hennicker (eds.), Recent Trends in Algebraic Development Techniques, 16th International Workshop (WADT 2002), LNCS vol. 2755, Springer, Berlin, 2003, pp. 425-441 [preprint] [bibtex] [url]
[25]: The logic of the partial $\lambda$-calculus with equality, In Jerzy Marcinkowski, Andrzej Tarlecki, eds.: Computer Science Logic (CSL 04), Lecture Notes in Computer Science, vol. 3210, pp. 385–399, Springer; Berlin; http://www.springer.de, . [preprint] [bibtex] [url]
[24], and : Libraries, Chapter in Peter Mosses, ed.: CASL reference manual, Lecture Notes in Computer Science, vol. 2960, Springer; Berlin; http://www.springer.de, . Early version appeared as CoFI note L-12, http://www.informatik.uni-bremen.de/cofi/old/Notes/L-12/index.html [preprint] [bibtex] [url]
[23] and : Globalization of Confluent Partial Actions on Topological and Metric Spaces, In Topology and Applications, 145, pp. 119–145, . [preprint] [bibtex]
2003
[22] and : Monad-independent Hoare logic in HasCASL, In Mauro Pezze, ed.: Fundamental Approaches to Software Engineering (FASE 2003), Lecture Notes in Computer Science, vol. 2621, pp. 261–277, Springer; Berlin; http://www.springer.de, . [preprint] [bibtex] [url]
[21]: Henkin models of the partial $\lambda$-calculus, In Matthias Baaz, Johann Makowsky, eds.: Computer Science Logic, Lecture Notes in Computer Science, vol. 2803, pp. 498–512, Springer; Berlin; http://www.springer.de, . [preprint] [bibtex] [url]
[20]: Classifying categories for partial equational logic, In Richard Blute, ed.: Category Theory and Computer Science (CTCS 02), Electronic Notes in Theoretical Computer Science, vol. 69, Elsevier, . [preprint] [bibtex] [url]
[19], and : CoCASL at work — Modelling Process Algebra, In Hans-Peter Gumm, ed.: Coalgebraic Methods in Computer Science, Electronic Notes in Theoretical Computer Science, vol. 82, Elsevier Science; http://www.elsevier.nl/, . [preprint] [bibtex]
[18], , and : Algebraic-co-algebraic specification in CoCASL, In Martin Wirsing, Dirk Pattinson, Rolf Hennicker, eds.: Recent Developments in Algebraic Development Techniques, 16th International Workshop, WADT'02, Lecture Notes in Computer Science, vol. 2755, pp. 376–392, Springer; Berlin; http://www.springer.de, . [preprint] [bibtex] [url]
2002
[17] and : HasCASL: towards integrated specification and development of functional programs, In Hélène Kirchner, Christophe Ringeissen, eds.: Algebraic Methodology And Software Technology (AMAST 2002), Lecture Notes in Computer Science, vol. 2422, pp. 99–116, Springer; Berlin; http://www.springer.de, . [preprint] [bibtex] [url]
[16] and : Universal aspects of probabilistic automata, In Math. Struct. Comput. Sci., 12, pp. 481–512, . [preprint] [bibtex]
[15]: Monads on composition graphs, In Applied Categorical Structures, 10, pp. 221–236, . [preprint] [bibtex]
2001
[14], , , and : Semantics of Architectural Specifications in CASL, In Heinrich Hußmann, ed.: Fundamental Approaches to Software Engineering, Lecture Notes in Computer Science, vol. 2029, pp. 253–268, Springer; Berlin; http://www.springer.de, . [preprint] [bibtex] [url]
[13], and : Amalgamation via enriched CASL signatures, In Fernando Orejas, Paul Spirakis, Jan van Leeuwen, eds.: International Colloquium on Automata, Languages and Programming (ICALP 2001), Lecture Notes in Computer Science, vol. 2076, pp. 993–1004, Springer; Berlin; http://www.springer.de, . [preprint] [bibtex] [url]
[12] and : Free factorizations, In Applied Categorical Structures, 9, pp. 571–593, . [preprint] [bibtex]
[11]: Life without the Terminal Type, In Laurent Fribourg, ed.: Computer Science Logic, Lecture Notes in Computer Science, vol. 2142, pp. 429–442, Springer; Berlin; http://www.springer.de, . [preprint] [bibtex] [url]
[10]: Traces of Epimorphism classes, In Quaestiones Mathematicae, 24, pp. 193–200, . [preprint] [bibtex]
[9]: Categories: a free tour, Chapter in Austin Melton, Jürgen Koslowski, eds.: Categorical Perspectives, pp. 1–27, Birkhäuser; Basel, . [preprint] [bibtex]
[8] and : Towards Trustworthy Specifications I: Consistency Checks, In Maura Cerioli, Gianna Reggio, eds.: Recent Trends in Algebraic Specification Techniques, 15th International Workshop, WADT 2001, Lecture Notes in Computer Science, vol. 2267, Springer; Berlin; http://www.springer.de, . [preprint] [bibtex] [url]
[7], , , and : Checking amalgamability conditions for CASL architectural specifications, In Jiri Sgall, Ales Pultr, Petr Kolman, eds.: Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 2136, pp. 512–523, Springer; Berlin; http://www.springer.de, . [preprint] [bibtex] [url]
2000
[6] and : Free adjunction of morphisms, In Applied Categorical Structures, 8, pp. 595–606, . [preprint] [bibtex]
[5] and : Abstract initiality, In Commentationes Mathematicae Universitatis Carolinae, 41, pp. 575–583, . [preprint] [bibtex]
[4]: Isomorphisms and splitting of idempotents in semicategories, In Cahiers de Topologie et Géométrie Différentielle catégoriques, 41, pp. 143–153, . [preprint] [bibtex]
[3], and : Specifying real numbers in CASL, In Christine Choppy, Didier Bert, eds.: Recent Developments in Algebraic Development Techniques, 14th International Workshop, WADT'99, Lecture Notes in Computer Science, vol. 1827, pp. 146–161, Springer; Berlin; http://www.springer.de, . [bibtex] [url]
1999
[2]: Composition graphs and free extensions of categories, PhD thesis, Universität Bremen; www.uni-bremen.de, . [bibtex]
[1] and : Composing special epimorphisms and retractions, In Cahiers de Topologie et Géométrie Différentielle catégoriques, 40, pp. 221–226, . [bibtex]