Navigation

VERÖFFENTLICHUNGEN

2020
[122]The High-Level Benefits of Low-Level Sandboxing (Michael Sammler, Deepak Garg, Derek Dreyer, Tadeusz Litak), In 47th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2020), 2020. (To appear. Artifact evaluation: Reusable) [bib]
[121]Cheap CTL Compassion in NuSMV (Daniel Hausmann, Tadeusz Litak, Christoph Rauch, Matthias Zinner), In 21st International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2020), 2020. (To appear. Artifact evaluation: Available and Functional) [bib]
2019
[120]A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic (Paul Wild, Lutz Schröder, Dirk Pattinson, Barbara König), In Proc. International Joint Conference on Artificial Intelligence, IJCAI 2019 (Sarit Kraus, ed.), ijcai.org, 2019. [preprint] (to appear) [bib]
[119] Lewisian Fixed Points I: Two Incomparable Constructions (Tadeusz Litak, Albert Visser), In CoRR, vol. abs/1905.09450, 2019. [bib] [pdf]
[118] Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot (Paul Blain Levy, Sergey Goncharov), In 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019) (Markus Roggenbach, Ana Sokolova, eds.), Leibniz International Proceedings in Informatics (LIPIcs), vol. 139, pp. 13:1–13:17, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2019. [bib] [pdf] [doi]
[117] Complete Additivity and Modal Incompleteness (Wesley Halcrow Holliday, Tadeusz Litak), In Review of Symbolic Logic, vol. 12(3), pp. 487–535, 2019. (Available on arXiv: https://arxiv.org/abs/1809.07542 and eScholarship: https://escholarship.org/uc/item/01p9x1hv) [bib] [pdf] [doi]
[116]Optimal Satisfiability Checking for Arithmetic mu-Calculi (Daniel Hausmann, Lutz Schröder), In Proc. Foundations of Software Science and Computation Structures, FoSSaCS 2019 (Mikolaj Bojanczyk, Alex Simpson, eds.), LNCS, Springer, 2019. (to appear) [bib]
[115]Combining Machine Learning and Semantic Features in the Classification of Corporate Disclosures (Stefan Evert, Philipp Heinrich, Klaus Henselmann, Ulrich Rabenstein, Elisabeth Scherr, Martin Schmitt, Lutz Schröder), In J. Logic, Language and Information (JoLLI), 2019. [preprint] (to appear) [bib]
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] Infinite Populations, Choice and Determinacy (Tadeusz Litak), In Studia Logica, vol. 106, pp. 969–999, 2018. [bib] [pdf] [doi]
[106] 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]
[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? (Wesley Halcrow Holliday, Tadeusz Litak), In Advances in Modal Logic (G. Bezhanishvili, G. D’Agostino, G. Metcalfe, T. Studer, eds.), vol. 12, pp. 367–386, College Publications, 2018. [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 Theoretical Aspects of Computing — ICTAC 2018 (Bernd Fischer, Tarmo Uustalu, eds.), pp. 191–210, Springer International Publishing, 2018. ( [ArXiv preprint] ) [bib]
[101]A Semantics for Hybrid Iteration (Sergey Goncharov, Julian Jakob, Renato Neves), In 29th International Conference on Concurrency Theory (CONCUR 2018) (Sven Schewe, Lijun Zhang, eds.), lncs, springer, 2018. [bib]
[100] 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
[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]