Lehrstuhl für Informatik 8 (Theoretische Informatik)


Description:

The Chair Computer Science 8 represents logic in computer science in teaching and research, with an emphasis on

  • Logiic-based knowledge representation and reasoning
  • Specification and verification of software
  • Modal logic in computer science, in particular coalgebraic logic
  • Progam logics and semantics of programming languages, in particular monad-based programming and semantics of iteration and recursion
  • Coalgebraic semantics of concurrent systems
Address:
Martensstraße 3
91058 Erlangen


Related Project(s)

Go to first page Go to previous page 1 of 2 Go to next page Go to last page

HighMoon2: A High Level Language for Monad-based Processes
PD Dr.-Ing. Sergey Goncharov; Prof. Dr. Lutz Schröder
(01/11/2017 - 31/10/2020)


DAAD Reisekostenbeihilfe - Eingeladener Vortrag auf dem Workshop “{Symmetry, Logic, Computation}” des Simons Institutes in Berkeley CA, USA
PD Dr. habil. Stefan Milius
(07/11/2016 - 10/11/2016)


Advances in Coalgebraic Automata Theory
PD Dr. habil. Stefan Milius
(01/01/2015 - 31/12/2015)


COAX: Coinduction Meets Algebra For the Axiomatization of System Equivalence
PD Dr. habil. Stefan Milius; Prof. Dr. Lutz Schröder
(01/10/2014 - 31/07/2018)


HighMoon: A High Level Language for Programming and Specifying Multi-Effect Algorithms
PD Dr.-Ing. Sergey Goncharov; Prof. Dr. Lutz Schröder
(01/09/2013)



Publications (Download BibTeX)

Go to first page Go to previous page 1 of 7 Go to next page Go to last page

Adámek, J., Milius, S., Myers, R., & Urbat, H. (2019). Generalized Eilenberg Theorem: Varieties of Languages in a Category. ACM Transactions on Computational Logic, 20(1), 3:1--3:47.
Goncharov, S., Schröder, L., Rauch, C., & Jakob, J. (2018). Unguarded Recursion on Coinductive Resumptions. Logical Methods in Computer Science, 14(3). https://dx.doi.org/10.23638/LMCS-14(3:10)2018
Holliday, W., & Litak, T.M. (2018). One Modal Logic to Rule Them All? In Guram Bezhanishvili, Giovanna D'Agostino, George Metcalfe, Thomas Studer (Eds.), Advances in Modal Logic 2018 (pp. 367-386). Bern, CH: London, UK: College Publications.
Litak, T.M., & Visser, A. (2018). Lewis meets Brouwer: Constructive strict implication. Indagationes Mathematicae-New Series, 29(1), 36-90. https://dx.doi.org/10.1016/j.indag.2017.10.003
Schröder, L., & Venema, Y. (2018). Completeness of Flat Coalgebraic Fixpoint Logics. ACM Transactions on Computational Logic, 19(1). https://dx.doi.org/10.1145/3157055
Goncharov, S., & Schröder, L. (2018). Guarded Traced Categories. (pp. 313-330). Springer Verlag.
Wild, P., Schröder, L., Pattinson, D., & König, B. (2018). A van Benthem theorem for fuzzy modal logic. (pp. 909-918). Institute of Electrical and Electronics Engineers Inc..
Litak, T.M., Pattinson, D., Sano, K., & Schröder, L. (2018). Model Theory and Proof Theory of Coalgebraic Predicate Logic. Logical Methods in Computer Science, 14(1). https://dx.doi.org/10.23638/LMCS-14(1:22)2018
Goncharov, S., & Neves, R. (2018). A Semantics for Hybrid Iteration. Beijing, China.
Harsh, B., König, B., Küpper, S., Silva, A., & Wißmann, T. (2018). A coalgebraic treatment of conditional transition systems with upgrades. Logical Methods in Computer Science, Volume 14, Issue 1. https://dx.doi.org/10.23638/LMCS-14(1:19)2018
Goncharov, S., Rauch, C., & Schröder, L. (2018). A Metalanguage for Guarded Iteration. In 11187. Stellenbosch, South Africa: Springer International Publishing.
Adámek, J., Milius, S., & Moss, L. (2018). Fixed Points of Functors. Journal of Logical and Algebraic Methods in Programming, 95, 41--81.
Hausmann, D., Schröder, L., & Deifel, H.-P. (2018). Permutation games for the weakly aconjunctive μ -calculus. (pp. 361-378). Springer Verlag.
Adámek, J., Milius, S., & Urbat, H. (2018). A Categorical Approach to Syntactic Monoids. Logical Methods in Computer Science, 14(2:9), 34 pp.. https://dx.doi.org/10.23638/LMCS-14(2:9)2018
Milius, S. (2018). Proper Functors and Fixed Points for Finite Behaviour. Logical Methods in Computer Science, 14(3), 32 pp..
Dorsch, U., Milius, S., Schröder, L., & Wißmann, T. (2018). Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages. In Corina Cîrstea (Eds.), Proc.~Coalgebraic Methods in Computer Science (CMCS'18). Thessaloniki: Springer.
Milius, S., Adámek, J., & Urbat, H. (2018). On Algebras with Effectful Iteration. In Corina Cîrstea (Eds.), Proc.~Coalgebraic Methods in Computer Science (CMCS'18). Thessaloniki: Heidelberg: Springer.
Evert, S., Heinrich, P., Henselmann, K., Rabenstein, U., Scherr, E., & Schröder, L. (2017). Combining Machine Learning and Semantic Features in the Classification of Corporate Disclosures. In Loukanova R, Liefke K (Eds.), Proceedings of the Workshop on Logic and Algorithms in Computational Linguistics 2017 (LACompLing2017) (pp. 47 - 62). Stockholm, SE: Stockholm: Stockholm University.
Schröder, L., Kozen, D., Milius, S., & Wißmann, T. (2017). Nominal Automata with Name binding. In Esparza Javier, Murawski Andrzej (Eds.), Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017). Uppsala, SE: Springer.
Goncharov, S., Schröder, L., Rauch, C., & Piróg, M. (2017). Unifying Guarded and Unguarded Iteration. In Esparza Javier , Murawski Andrzej (Eds.), Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017). Uppsala, SE: Berlin: Springer.

Last updated on 2018-18-06 at 15:53