EN | DE
Theoretische Informatik

Chair Publications

2017
[95] 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]
[94] 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]
[93] 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]
[92] 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]
[91] A van Benthem/Rosen Theorem for Coalgebraic Predicate Logic (Lutz Schröder, Dirk Pattinson, Tadeusz Litak), In J. Log. Comput., vol. 27(3), pp. 749–773, 2017. [preprint] [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]
[89] Lewis meets Brouwer: constructive strict implication (Tadeusz Litak, Albert Visser), In CoRR, vol. abs/1708.02143, 2017. [bib] [pdf]
[88] Model Theory and Proof Theory of CPL (Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder), In CoRR, vol. abs/1701.03773, 2017. [bib] [pdf]
[87] Negative Translations and Normal Modality (Tadeusz Litak, Miriam Polzer, Ulrich Rabenstein), In Second International Conference on Formal Structures for Computation and Deduction (FSCD), 2017. ( [Local copy] ) [bib]
[86] Probabilistic Description Logics for Subjective Uncertainty (Víctor Gutiérrez-Basulto, Jean Christoph Jung, Carsten Lutz, Lutz Schröder), In J. Artif. Intell. Res. (JAIR), vol. 58, pp. 1–66, 2017. [bib] [pdf]
[85] Ontological Modelling of a Psychiatric Clinical Practice Guideline (Daniel Gorín, Malte Meyn, Alexander Naumann, Miriam Polzer, Ulrich Rabenstein, Lutz Schröder), In Proc. 40th German Conference on Artificial Intelligence (KI 2017), Lect. Notes Comput. Sci, 2017. [bib] [pdf]
[84] Unifying Guarded and Unguarded Iteration (Sergey Goncharov, Lutz Schröder, Christoph Rauch, Maciej Piróg), In Proc. 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017) (Javier Esparza, Andrzej Murawski, eds.), Lect. Notes Comput. Sci. (ArCOSS), vol. 10203, pp. 517–533, Springer, 2017. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-54458-7_30. [bib] [pdf]
[83] Efficient Coalgebraic Partition Refinement (Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann), In Proc. 28th International Conference on Concurrency Theory (CONCUR 2017), LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [Full version] [bib]
2016
[82] An Attack Possibility on Time Synchronization Protocols Secured with TESLA-Like Mechanisms (Kristof Teichel, Dieter Sibold, Stefan Milius), In Proc. Information Systems Security (ICISS) (Indrajit Ray, Manoj Singh Gaur, Mauro Conti, Dheeraj Sanghi, V. Kamakoti, eds.), Lecture Notes Comput. Sci., vol. 10063, pp. 3–22, 2016. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-49806-5_1. [bib] [doi]
[81] A New Foundation for Finitary Corecursion: The Locally Finite Fixpoint and its Properties (Stefan Milius, Dirk Pattinson, Thorsten Wißmann), In Proc. Foundations of Software Science and Computation Structures (FoSSaCS) (Bart Jacobs, Christof Löding, eds.), Lecture Notes Comput. Sci. (ARCoSS), vol. 9634, pp. 107–125, Springer, 2016. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-49630-5_7. [bib] [doi]
[80] Profinite Monads, Profinite Equations and Reitermann's Theorem (Liang-Ting Chen, Jiří Adámek, Stefan Milius, Henning Urbat), In Proc. Foundations of Software Science and Computation Structures (FoSSaCS) (Bart Jacobs, Christof Löding, eds.), Lecture Notes Comput. Sci. (ARCoSS), vol. 9634, pp. 531–547, Springer, 2016. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-49630-5_31. [bib] [pdf] [doi]
[79] Program equivalence is coinductive (Dirk Pattinson, Lutz Schröder), In Logic in Computer Science, LICS 2016 (Martin Grohe, Eric Koskinen, Natarajan Shankar, eds.), pp. 337–346, ACM, 2016. [bib] [pdf]
[78] Regular Behaviours with Names (Stefan Milius, Lutz Schröder, Thorsten Wißmann), In Appl. Cat. Struct., vol. 24(5), pp. 663–791, 2016. The final publication is available at Springer via http://dx.doi.org/10.1007/s10485-016-9457-8. [bib] [pdf] [doi]
[77] Relational lattices: From databases to universal algebra (Tadeusz Litak, Szabolcs Mikulás, Jan Hidders), In JLAMP, vol. 85(4), pp. 540–573, 2016. The final publication is available at Springer via http://dx.doi.org/10.1016/j.jlamp.2015.11.008 (special issue with selected papers RAMiCS 2014 edited by Peter Höfner, Peter Jipsen, Wolfram Kahl and Martin E. Müller) [bib] [pdf] [doi]
[76] Complete Additivity and Modal Incompleteness (Wesley H. Holliday, Tadeusz Litak), 2016. (eScholarship system of UC Berkeley, Working Papers series) [bib] [pdf]
[75] Global Caching for the Alternation-free Coalgebraic $\mu$-calculus (Daniel Hausmann, Lutz Schröder, Christoph Egger), In Concurrency Theory, CONCUR 2016, LIPIcs, vol. 59, pp. 34:1–34:15, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [bib] [pdf]
[74] Complete Elgot Monads and Coalgebraic Resumptions (Sergey Goncharov, Stefan Milius, Christoph Rauch), In Electr. Notes Theor. Comput. Sci., vol. 325, pp. 147–168, 2016. [bib] [pdf]
[73] Completeness for Coalgebraic Fixpoint Logic (Sebastian Enqvist, Fatemeh Seifan, Yde Venema), In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016) (Jean-Marc Talbot, Laurent Regnier, eds.), Leibniz International Proceedings in Informatics (LIPIcs), vol. 62, pp. 7:1–7:19, 2016. [bib] [pdf]
2015
[72] On Final Coalgebras of Power-Set Functors and Saturated Trees (Jiří Adámek, Paul B. Levy, Lawrence S. Moss, Stefan Milius, Lurdes Sousa), In Appl. Categ. Structures, vol. 23(4), pp. 609–641, 2015. (Available online; http://dx.doi.org/10.1007/s10485-014-9372-9) [bib]
[71] First Results of a Formal Analysis of the Network Time Security Specification (Kristof Teichel, Dieter Sibold, Stefan Milius), In Proc. Security Standardization Research (Liqun Chen, Shin'ichiro Matsuo, eds.), Lecture Notes Comput. Sci., vol. 9497, pp. 218–245, Springer, 2015. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-27152-1_12. [bib] [doi]
Powered by bibtexbrowser
Publications as a bibtex file