EN | DE
Theoretische Informatik

Chair Publications

[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] Negative Translations and Normal Modality (Tadeusz Litak, Miriam Polzer, Ulrich Rabenstein), In 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017) (Dale Miller, ed.), Leibniz International Proceedings in Informatics (LIPIcs), vol. 84, pp. 27:1–27:18, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2017. ( [Local copy] ) [bib] [pdf] [doi]
[88] An Algebraic Glimpse at Bunched Implications and Separation Logic (Peter Jipsen, Tadeusz Litak), In CoRR, vol. abs/1709.07063, 2017. [bib] [pdf]
[87] 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]
[86] 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. The final publication is available at Springer via https://doi.org/10.1007/978-3-319-67190-1_24. [bib] [pdf]
[85] 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]
[84] Combining Machine Learning and Semantic Features in the Classification of Corporate Disclosures (Stefan Evert, Philipp Heinrich, Klaus Henselmann, Ulrich Rabenstein, Elisabeth Scherr, Lutz Schröder), In Proc. Workshop on Logic and Algorithms in Computational Linguistics, LACompLing 2017 (R. Loukanova, K. Liefke, eds.), pp. 47 – 62, Stockholm University, 2017. [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]
[82] Automatic verification of application-tailored OSEK kernels (Hans-Peter Deifel, Christian Dietrich, Merlin Göttlinger, Daniel Lohmann, Stefan Milius, Lutz Schröder), In 2017 Formal Methods in Computer Aided Design, FMCAD 2017, Vienna, Austria, October 2-6, 2017 (Daryl Stewart, Georg Weissenbacher, eds.), pp. 196–203, IEEE, 2017. [bib] [pdf] [doi]
2016
[81] 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]
[80] 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]
[79] 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]
[78] 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]
[77] 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]
[76] 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]
[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]
[70] 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]
[69] Simplified Coalgebraic Trace Equivalence (Alexander Kurz, Stefan Milius, Dirk Pattinson, Lutz Schröder), In Software, Services and Systems, vol. 8950, pp. 75–90, Springer, 2015. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-15545-6_8. [bib] [pdf] [doi]
[68] 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]
[67] 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]
[66] 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]
Powered by bibtexbrowser
Publications as a bibtex file