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

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


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


COAX: Coinduction Meets Algebra For the Axiomatization of System Equivalence
PD Dr. 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
Dr.-Ing. Sergey Goncharov; Prof. Dr. Lutz Schröder
(01/09/2013)


Kooperation Network Time Protocols
PD Dr. Stefan Milius
(01/04/2013 - 31/03/2016)



Publications (Download BibTeX)

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

Adámek, J., Milius, S., & Moss, L. (2018). Fixed Points of Functors. Journal of Logical and Algebraic Methods in Programming, 95, 41--81.
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., Rauch, C., Goncharov, S., & 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.
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.
Dorsch, U., Milius, S., Schröder, L., & Wißmann, T. (2017). Efficient Coalgebraic Partition Refinement. In Meyer R, Nestmann U (Eds.), Proc. 28th International Conference on Concurrency Theory (CONCUR 2017) (pp. 28:1--28:16). Schloss Dagstuhl.
Urbat, H., Adámek, J., Chen, L.-T., & Milius, S. (2017). Eilenberg Theorems for Free. In G.~Larsen K, L.~Bodlaender H, Raskin J (Eds.), Proc.~42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) (pp. 43:1-43:14). Schloss Dagstuhl.
Urbat, H. (2017). Finite behaviours and finitary corecursion. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
Gorin, D., Meyn, M., Naumann, A., Polzer, M., Rabenstein, U., & Schröder, L. (2017). Ontological Modelling of a Psychiatric Clinical Practice Guideline. In KI 2017: Advances in Artificial Intelligence - 40th Annual German Conference on AI, Dortmund, Germany, September 25-29, 2017, Proceedings (pp. 300--308).
Kohlhase, M., Müller, D., Pfeiffer, M., Rabe, F., Thiery, N., Vasilyev, V., & Wiesing, T. (2017). Knowledge-Based Interoperability for Mathematical Software Systems. In Johannes Blömer and Temur Kutsia and Dimitris Simos (Eds.), MACIS 2017: Seventh International Conference on Mathematical Aspects of Computer and Information Sciences (pp. 195-210). Springer.
Seifan, F., Schröder, L., & Pattinson, D. (2017). Uniform Interpolation in Coalgebraic Modal Logic. In 7th Conference on Algebra and Coalgebra in Computer Science, CALCO 2017, June 12-16, 2017, Ljubljana, Slovenia (pp. 21:1--21:16).
Milius, S. (2017). Proper Functors and their Rational Fixed Point. In Bonchi F, König B (Eds.), Proc.~7th Conference on Algebra and Coalgebra in Computer Science (CALCO'17) (pp. 18:1--18:15). Schloss Dagstuhl.
Deifel, H.-P., Göttlinger, M., Milius, S., Schröder, L., Dietrich, C., & Lohmann, D. (2017). Automatic verification of application-tailored OSEK kernels. In 2017 Formal Methods in Computer Aided Design, FMCAD 2017, Vienna, Austria, October 2-6, 2017 (pp. 196--203). IEEE.
Wild, P., & Schröder, L. (2017). A Characterization Theorem for a Modal Description Logic. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017 (pp. 1304--1310).
Adámek, J., Milius, S., & Velebil, J. (2017). A Presentation of Bases for Parametrized Iterativity. Theory and Applications of Categories, 32(19), 682--718.
Wiesing, T., Kohlhase, M., Rabe, F., & Kohlhase, M. (2017). Virtual Theories -- A Uniform Interface to Mathematical Knowledge Bases. In Johannes Blömer and Temur Kutsia and Dimitris Simos (Eds.), MACIS 2017: Seventh International Conference on Mathematical Aspects of Computer and Information Sciences (pp. 243-257). Springer.
Adámek, J., & Milius, S. (2017). On Corecursive Algebras for Functors Preserving Coproducts. In Bonchi F, König B (Eds.), Proc.~7th Conference on Algebra and Coalgebra in Computer Science (CALCO'17) (pp. 3:1--3:15). Schloss Dagstuhl.
Milius, S., & Litak, T.M. (2017). Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion. Fundamenta Informaticae, 150, 407-449. https://dx.doi.org/10.3233/FI-2017-1475
Gutierreiz-Basulto, V., Jung, J.C., Lutz, C., & Schröder, L. (2017). Probabilistic Description Logics for Subjective Uncertainty. Journal of Artificial Intelligence Research, 58, 1--66. https://dx.doi.org/10.1613/jair.5222
Goncharov, S., Milius, S., & Rauch, C. (2016). Complete Elgot Monads and Coalgebraic Resumptions. In Lars Birkedal (Eds.), (pp. 147--168). Carnegie Mellon University, Pittsburgh, US: Electronic Notes in Theoretical Computer Science.
Milius, S., Schröder, L., & Wißmann, T. (2016). Regular Behaviours with Names - On Rational Fixpoints of Endofunctors on Nominal Sets. Applied Categorical Structures, 24(5), 663--701. https://dx.doi.org/10.1007/s10485-016-9457-8

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