apl. Prof. Dr. Stefan Milius


Personal Website: http://www.stefan-milius.eu



Organisation


Technische Fakultät
Lehrstuhl für Informatik 8 (Theoretische Informatik)



Project lead

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

Koinduktion und Algebra in der Axiomatisierung und Algorithmik von Systemäquivalenzen
apl. Prof. Dr. Stefan Milius
(01/06/2019 - 31/05/2022)

Coinduction meets algebra for the axiomatization and algorithmics of system equivalences
apl. Prof. Dr. Stefan Milius; Prof. Dr. Lutz Schröder
(01/02/2019 - 31/01/2022)

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

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

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


Project member


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

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

DAAD Reisekostenbeihilfe - eingeladener Vortrag auf dem Workshop über “Coalgebras in Computation, Logic, Probability and Quantum Physics”
apl. Prof. Dr. Stefan Milius
(18/03/2013 - 22/03/2013)


Publications (Download BibTeX)

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

Milius, S., & Urbat, H. (2019). Equational Axiomatization of Algebras with Structure. In Mikolaj Bojanczyk, Alex Simpson (Eds.), Proceedings of the 22nd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2019) (pp. 400-417). Springer Verlag.
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. https://dx.doi.org/10.1145/3276771
Adamek, J., & Milius, S. (2019). On functors preserving coproducts and algebras with iterativity. Theoretical Computer Science, 763, 66-87. https://dx.doi.org/10.1016/j.tcs.2019.01.018
Urbat, H., & Milius, S. (2019). Varieties of data languages. In Ioannis Chatzigiannakis, Christel Baier, Stefano Leonardi, Paola Flocchini (Eds.), Leibniz International Proceedings in Informatics, LIPIcs. Patras, GR: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
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
Adámek, J., Milius, S., & Moss, L. (2018). Fixed Points of Functors. Journal of Logical and Algebraic Methods in Programming, 95, 41--81.
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.
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. (2018). Proper Functors and Fixed Points for Finite Behaviour. Logical Methods in Computer Science, 14(3), 32 pp..
Adámek, J., Milius, S., & Velebil, J. (2017). A Presentation of Bases for Parametrized Iterativity. Theory and Applications of Categories, 32(19), 682--718.

Last updated on 2019-26-02 at 22:51