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 2 of 6 Go to next page Go to last page

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.
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.
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
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.
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. (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.
Teichel, K., Sibold, D., & Milius, S. (2016). An Attack Possibility on Time Synchronization Protocols Secured with TESLA-Like Mechanisms. In Proceedings of the 12th International Conference on Information Systems Security, ICISS 2016 (pp. 3-22). Jaipur (India): Heidelberg: Springer.
Milius, S., Pattinson, D., & Wißmann, T. (2016). A New Foundation for Finitary Corecursion. In Foundations of Software Science and Computation Structures (pp. 107-125). Eindhoven, The Netherlands.
Goncharov, S., Milius, S., & Rauch, C. (2016). Complete Elgot Monads and Coalgebraic Resumptions. Electronic Notes in Theoretical Computer Science, 325, 147-168. https://dx.doi.org/10.1016/j.entcs.2016.09.036

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