EN | DE
Theoretische Informatik

Chair Publications

2018
[114] Lewis meets Brouwer: constructive strict implication (Tadeusz Litak, Albert Visser), In Indagationes Mathematicae, vol. 29, pp. 36–90, 2018. (A special issue "L.E.J. Brouwer, fifty years later") [bib] [pdf] [doi]
[113] Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages (Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wiß\/mann), In Proc. Coalgebraic Methods in Computer Science (CMCS'18) (Corina Cîrstea, ed.), Springer, 2018. (To appear) [bib] [pdf] [doi]
[112] On Algebras with Effectful Iteration (Jiří Adámek, Stefan Milius, Henning Urbat), In Proc. Coalgebraic Methods in Computer Science (CMCS'18) (Corina Cîrstea, ed.), Lecture Notes Comput. Sci., 2018. (To appear) [bib]
[111] A Categorical Approach to Syntactic Monoids (Jiří Adámek, Stefan Milius, Henning Urbat), In Log. Methods Comput. Sci., vol. 14(2:9), pp. 34 pp., 2018. [bib]
[110] A van Benthem Theorem for Fuzzy Modal Logic (Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König), In Proc. 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018 (Anuj Dawar, Erich Grädel, eds.), pp. 909–918, ACM, 2018. [preprint] [bib] [pdf] [doi]
[109] Completeness of Flat Coalgebraic Fixpoint Logics (Lutz Schröder, Yde Venema), In ACM Trans. Comput. Log., vol. 19(1), pp. 4:1–4:34, ACM, 2018. [preprint] [bib] [pdf] [doi]
[108] Model Theory and Proof Theory of Coalgebraic Predicate Logic (Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder), In Log. Methods Comput. Sci., vol. 14(1), 2018. [bib] [pdf] [doi]
[107] A detailed analysis of the Arden Syntax expression grammar (Stefan Kraus, Marc Rosenbauer, Lutz Schröder, Thomas Bürkle, Klaus-Peter Adlassnig, Dennis Toddenroth), In J. Biomed. Inf., vol. 83, pp. 196–203, 2018. [bib] [pdf] [doi]
[106] Complete Additivity and Modal Incompleteness (Wesley H. Holliday, Tadeusz Litak), In Review of Symbolic Logic, 2018. (to appear) [bib] [pdf]
[105] Permutation Games for the Weakly Aconjunctive mu $\mu$-Calculus (Daniel Hausmann, Lutz Schröder, Hans-Peter Deifel), In Proc. 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2018, (Dirk Beyer, Marieke Huisman, eds.), LNCS, vol. 10806, pp. 361–378, Springer, 2018. [bib] [pdf] [doi]
[104] One Modal Logic to Rule Them All? (Extended Technical Report) (Wesley H. Holliday, Tadeusz Litak), 2018. [slides] (Accepted for AiML 2018. UC Berkeley Working Paper in Logic and the Methodology of Science) [bib] [pdf]
[103] Guarded Traced Categories (Sergey Goncharov, Lutz Schröder), In Proc. 21st International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2018 (Christel Baier, Ugo Dal Lago, eds.), LNCS, vol. 10803, pp. 313–330, Springer, 2018. [bib] [pdf] [doi]
[102] A Metalanguage for Guarded Iteration (Sergey Goncharov, Christoph Rauch, Lutz Schröder), In Proc. 15th International Colloquium on Theoretical Aspects of Computing, ICTAC 2018 (Bernd Fischer, Tarmo Uustalu, eds.), 2018. (To appear) [bib]
[101] Unguarded Recursion on Coinductive Resumptions (Sergey Goncharov, Lutz Schröder, Christoph Rauch, Julian Jakob), In Log. Methods Comput. Sci., vol. 14(3), 2018. [bib] [pdf] [doi]
2017
[100] Infinite Populations, Choice and Determinacy (Tadeusz Litak), In Studia Logica, 2017. [Local version] (special issue on Logics for Social Behaviour edited by A. Palmigiano and M. Pivato) [bib] [pdf] [doi]
[99] Eilenberg Theorems for Free (Henning Urbat, Jiří Adámek, Liang-Ting Chen, Stefan Milius), In Proc. 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) (Kim G. Larsen, Hans L. Bodlaender, Jean-François Raskin, eds.), LIPIcs, vol. 83, Schloss Dagstuhl, 2017. (\bfseries EATCS Best Paper Award) [bib]
[98] Nominal Automata with Name binding (Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann), In Proc. 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017) (Javier Esparza, Andrzej Murawski, eds.), Lecture Notes Comput. Sci. (ARCoSS), vol. 10203, pp. 124–142, Springer, 2017. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-54458-7_8. [bib] [pdf]
[97] Proper Functors and their Rational Fixed Point (Stefan Milius), In Proc. 7th Conference on Algebra and Coalgebra in Computer Science (CALCO'17) (Filippo Bonchi, Barbara König, eds.), LIPIcs, vol. 72, pp. 18:1–18:15, Schloss Dagstuhl, 2017. (To appear) [bib]
[96] A Presentation of Bases for Parametrized Iterativity (Jiří Adámek, Stefan Milius, Jiří Velebil), In Theory Appl. Categ., vol. 32(19), pp. 682–718, 2017. [bib]
[95] On Corecursive Algebras for Functors Preserving Coproducts (Jiří Adámek, Stefan Milius), In Proc. 7th Conference on Algebra and Coalgebra in Computer Science (CALCO'17) (Filippo Bonchi, Barbara König, eds.), LIPIcs, vol. 72, pp. 3:1–3:15, Schloss Dagstuhl, 2017. [bib]
[94] A Characterization Theorem for a Modal Description Logic (Paul Wild, Lutz Schröder), In International Joint Conference on Artificial Intelligence, IJCAI 2017, IJCAI/AAAI, 2017. [preprint] [bib] [pdf] [doi]
[93] Uniform Interpolation in Coalgebraic Modal Logic (Fatemeh Seifan, Lutz Schröder, Dirk Pattinson), In Proc. 7th Conference on Algebra and Coalgebra in Computer Science, LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [preprint] [bib] [pdf] [doi]
[92] A van Benthem/Rosen Theorem for Coalgebraic Predicate Logic (Lutz Schröder, Dirk Pattinson, Tadeusz Litak), In Journal of Logic and Computation, vol. 27(3), pp. 749–773, 2017. [preprint] [bib] [pdf]
[91] Generic Hoare Logic for Order-Enriched Effects with Exceptions (Christoph Rauch, Sergey Goncharov, Lutz Schröder), In Recent Trends in Algebraic Development Techniques: 23rd IFIP WG 1.3 International Workshop, WADT 2016, Revised Selected Papers (Phillip James, Markus Roggenbach, eds.), pp. 208–222, Springer, 2017. The final publication is available at Springer via https://doi.org/10.1007/978-3-319-72044-9_14. [bib] [pdf]
[90] Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion (Stefan Milius, Tadeusz Litak), In Fundamenta Informaticae, vol. 150, pp. 407–449, 2017. (special issue FiCS'13 edited by David Baelde, Arnaud Carayol, Ralph Matthes and Igor Walukiewicz) [bib] [pdf] [doi]
Powered by bibtexbrowser
Publications as a bibtex file