EN | DE
Theoretische Informatik

Chair Publications

2017
[89] Nominal Automata with Name binding (Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann), In Proc. Foundations of Software Science and Computation Structures (FoSSaCS) (Javier Esparza, Andrzej Murawski, eds.), Lecture Notes Comput. Sci. (ARCoSS), Springer, 2017. (to appear; available at http://arxiv.org/abs/1603.01455) [bib]
[88] Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion (Stefan Milius, Tadeusz Litak), In Fundamenta Informaticae, vol. 150, pp. 407–449, IOS Press, 2017. (special issue FiCS'13 edited by David Baelde, Arnaud Carayol, Ralph Matthes and Igor Walukiewicz) [bib] [pdf] [doi]
[87] 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]
[86] 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, to appear) [bib]
[85] 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]
[84] Unifying Guarded and Unguarded Iteration (Sergey Goncharov, Lutz Schröder, Christoph Rauch, Maciej Piróg), In Proc. Foundations of Software Science and Computation Structures (FoSSaCS) (Javier Esparza, Andrzej Murawski, eds.), LNCS, Springer, 2017. [preprint] (to appear) [bib]
2016
[83] 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. [bib]
[82] 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. [bib]
[81] 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. [bib]
[80] 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]
[79] Regular Behaviours with Names (Stefan Milius, Lutz Schröder, Thorsten Wißmann), In Appl. Cat. Struct., vol. 24(5), pp. 663–791, 2016. [bib] [pdf]
[78] Relational lattices: From databases to universal algebra (Tadeusz Litak, Szabolcs Mikulás, Jan Hidders), In JLAMP, vol. 85(4), pp. 540–573, 2016. [Local copy] (special issue with selected papers RAMiCS 2014 edited by Peter Höfner, Peter Jipsen, Wolfram Kahl and Martin E. Müller) [bib] [pdf] [doi]
[77] Complete Additivity and Modal Incompleteness (Wesley H. Holliday, Tadeusz Litak), 2016. (eScholarship system of UC Berkeley, Working Papers series) [bib] [pdf]
[76] 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]
[75] 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]
[74] 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
[73] 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]
[72] 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. [bib]
[71] Coalgebraic Constructions of Canonical Nondeterministic Automata (Robert S. L. Myers, Jiří Adámek, Stefan Milius, Henning Urbat), In Theoret. Comput. Sci., vol. 604, pp. 81–101, 2015. (http:/dx.doi.org/10.1016/j.tcs.2015.03.035) [bib]
[70] Simplified Coalgebraic Trace Equivalence (Alexander Kurz, Stefan Milius, Dirk Pattinson, Lutz Schröder), Chapter in Software, Services and Systems, Lect. Notes Comput. Sci., vol. 8950, pp. 75–90, Springer, 2015. [bib] [pdf]
[69] Killing Epsilons with a Dagger: A Coalgebraic Study of Systems with Algebraic Label Structure (Filippo Bonchi, Stefan Milius, Alexandra Silva, Fabio Zanasi), In Theoret. Comput. Sci., vol. 604, pp. 102–126, 2015. (http://dx.doi.org/10.1016/j.tcs.2015.03.024) [bib]
[68] On Finitary Functors and Their Presentation (Jiří Adámek, Henning Urbat, Stefan Milius, Lawrence S. Moss), In J. Comput. System Sci., vol. 81(5), pp. 813–833, 2015. (http://dx.doi.org/10.1016/j.jcss.2014.12.002) [bib]
[67] Syntactic Monoids in a Category (Jiří Adámek, Stefan Milius, Henning Urbat), In Proc. Coalgebraic and Algebraic Methods in Computer Science (CALCO'15) (Lawrence S. Moss, Pawel Sobocinski, eds.), LIPICS, vol. 35, 2015. (CALCO 2015 Best Paper Award) [bib]
[66] Varieties of Languages in a Category (Jiří Adámek, Stefan Milius, Robert S.R. Myers, Henning Urbat), In Proc. 30th Annual Symposium on Logic in Computer Science (LICS'15) (Catuscia Palamidessi, ed.), pp. 414–425, 2015. [bib]
[65] A van Benthem/Rosen Theorem for Coalgebraic Predicate Logic (Lutz Schröder, Dirk Pattinson, Tadeusz Litak), In J. Log. Comput., 2015. (To appear) [bib] [pdf]
Powered by bibtexbrowser
Publications as a bibtex file