Stefan Milius

Orcid: 0000-0002-2021-1644

Affiliations:
  • University of Erlangen-Nuremberg, Germany


According to our database1, Stefan Milius authored at least 148 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Algebraic Language Theory with Effects.
CoRR, 2024

Alternating Nominal Automata with Name Allocation.
CoRR, 2024

Higher-Order Mathematical Operational Semantics.
CoRR, 2024

Algebraic Reasoning over Relational Structures.
CoRR, 2024

Initial Algebras Unchained - A Novel Initial Algebra Construction Formalized in Agda.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Bialgebraic Reasoning on Higher-order Program Equivalence.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Monoidal Extended Stone Duality.
Proceedings of the Foundations of Software Science and Computation Structures, 2024

2023
Eilenberg's variety theorem without Boolean operations.
Inf. Comput., December, 2023

Towards a Higher-Order Mathematical Operational Semantics.
Proc. ACM Program. Lang., January, 2023

On Kripke, Vietoris and Hausdorff Polynomial Functors.
CoRR, 2023

Positive Data Languages.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Weak Similarity in Higher-Order Mathematical Operational Semantics.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Nominal Topology for Data Languages.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

On Kripke, Vietoris and Hausdorff Polynomial Functors ((Co)algebraic pearls).
Proceedings of the 10th Conference on Algebra and Coalgebra in Computer Science, 2023

Higher-Order Mathematical Operational Semantics (Early Ideas).
Proceedings of the 10th Conference on Algebra and Coalgebra in Computer Science, 2023

2022
Software and Benchmarks for Distributed Coalgebraic Partition Refinement.
Dataset, January, 2022

Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence.
Log. Methods Comput. Sci., 2022

Distributed Coalgebraic Partition Refinement.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

Graded Monads and Behavioural Equivalence Games.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Stateful Structural Operational Semantics.
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

Coalgebraic Semantics for Nominal Automata.
Proceedings of the Coalgebraic Methods in Computer Science, 2022

2021
Reiterman's Theorem on Finite Algebras for a Monad.
ACM Trans. Comput. Log., 2021

Finitary monads on the category of posets.
Math. Struct. Comput. Sci., 2021

On the behaviour of coalgebras with side effects and algebras with effectful iteration.
J. Log. Comput., 2021

From generic partition refinement to weighted tree automata minimization.
Formal Aspects Comput., 2021

An Initial Algebra Theorem Without Iteration.
CoRR, 2021

A Linear-Time Nominal μ-Calculus with Name Allocation.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Behavioural Preorders via Graded Monads.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

On Language Varieties Without Boolean Operations.
Proceedings of the Language and Automata Theory and Applications, 2021

Coalgebra Encoding for Efficient Minimization.
Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

Nondeterministic Syntactic Complexity.
Proceedings of the Foundations of Software Science and Computation Structures, 2021

Explaining Behavioural Inequivalence Generically in Quasilinear Time.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

Nominal Büchi Automata with Name Allocation.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

Monads on Categories of Relational Structures.
Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

Initial Algebras Without Iteration ((Co)algebraic pearls).
Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

2020
Toward a Uniform Theory of Effectful State Machines.
ACM Trans. Comput. Log., 2020

Efficient and Modular Coalgebraic Partition Refinement.
Log. Methods Comput. Sci., 2020

A new foundation for finitary corecursion and iterative algebras.
Inf. Comput., 2020

Unifying Metadata-Based Storage Reconstruction and Carving with LAYR.
Digit. Investig., 2020

Harnessing LTL With Freeze Quantification.
CoRR, 2020

On Well-Founded and Recursive Coalgebras.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

2019
Generalized Eilenberg Theorem: Varieties of Languages in a Category.
ACM Trans. Comput. Log., 2019

On functors preserving coproducts and algebras with iterativity.
Theor. Comput. Sci., 2019

Varieties of Data Languages.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Equational Axiomatization of Algebras with Structure.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

Generic Partition Refinement and Weighted Tree Automata.
Proceedings of the Formal Methods - The Next 30 Years - Third World Congress, 2019

Graded Monads and Graded Logics for the Linear Time - Branching Time Spectrum.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

From Equational Specifications of Algebras with Structure to Varieties of Data Languages (Invited Paper).
Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science, 2019

2018
Proper Functors and Fixed Points for Finite Behaviour.
Log. Methods Comput. Sci., 2018

A Categorical Approach to Syntactic Monoids.
Log. Methods Comput. Sci., 2018

Fixed points of functors.
J. Log. Algebraic Methods Program., 2018

Graded Monads for the Linear Time - Branching Time Spectrum.
CoRR, 2018

CoPaR: An Efficient Generic Partition Refiner.
CoRR, 2018

On Algebras with Effectful Iteration.
Proceedings of the Coalgebraic Methods in Computer Science, 2018

Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages.
Proceedings of the Coalgebraic Methods in Computer Science, 2018

2017
Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion.
Fundam. Informaticae, 2017

A Coalgebraic Paige-Tarjan Algorithm.
CoRR, 2017

Eilenberg Theorems for Free.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Nominal Automata with Name Binding.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

Automatic verification of application-tailored OSEK kernels.
Proceedings of the 2017 Formal Methods in Computer Aided Design, 2017

Efficient Coalgebraic Partition Refinement.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

Proper Functors and their Rational Fixed Point.
Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

On Corecursive Algebras for Functors Preserving Coproducts.
Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

2016
Complete Elgot Monads and Coalgebraic Resumptions.
Proceedings of the Thirty-second Conference on the Mathematical Foundations of Programming Semantics, 2016

One Eilenberg Theorem to Rule Them All.
CoRR, 2016

Regular Behaviours with Names.
CoRR, 2016

A New Foundation for Finitary Corecursion.
CoRR, 2016

Regular Behaviours with Names - On Rational Fixpoints of Endofunctors on Nominal Sets.
Appl. Categorical Struct., 2016

An Attack Possibility on Time Synchronization Protocols Secured with TESLA-Like Mechanisms.
Proceedings of the Information Systems Security - 12th International Conference, 2016

A New Foundation for Finitary Corecursion - The Locally Finite Fixpoint and Its Properties.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

Profinite Monads, Profinite Equations, and Reiterman's Theorem.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015
Coalgebraic constructions of canonical nondeterministic automata.
Theor. Comput. Sci., 2015

Killing epsilons with a dagger: A coalgebraic study of systems with algebraic label structure.
Theor. Comput. Sci., 2015

On finitary functors and their presentations.
J. Comput. Syst. Sci., 2015

On Final Coalgebras of Power-Set Functors and Saturated Trees - To George Janelidze on the Occasion of His Sixtieth Birthday.
Appl. Categorical Struct., 2015

First Results of a Formal Analysis of the Network Time Security Specification.
Proceedings of the Security Standardisation Research - Second International Conference, 2015

Varieties of Languages in a Category.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Finitary Corecursion for the Infinitary Lambda Calculus.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

Generic Trace Semantics and Graded Monads.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

Syntactic Monoids in a Category.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

Simplified Coalgebraic Trace Equivalence.
Proceedings of the Software, 2015

2014
Base modules for parametrized iterativity.
Theor. Comput. Sci., 2014

Observations on formal safety analysis in practice.
Sci. Comput. Program., 2014

On Continuous Nondeterminism and State Minimality.
Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics, 2014

Towards a Coalgebraic Chomsky Hierarchy.
CoRR, 2014

Corecursive Algebras, Corecursive Monads and Bloom Monads.
Log. Methods Comput. Sci., 2014

Towards a Coalgebraic Chomsky Hierarchy - (Extended Abstract).
Proceedings of the Theoretical Computer Science, 2014

Generalized Eilenberg Theorem I: Local Varieties of Languages.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

An Open Alternative for SMT-Based Verification of Scade Models.
Proceedings of the Formal Methods for Industrial Critical Systems, 2014

Canonical Nondeterministic Automata.
Proceedings of the Coalgebraic Methods in Computer Science, 2014

How to Kill Epsilons with a Dagger - A Coalgebraic Take on Systems with Algebraic Label Structure.
Proceedings of the Coalgebraic Methods in Computer Science, 2014

2013
Sound and Complete Axiomatizations of Coalgebraic Language Equivalence.
ACM Trans. Comput. Log., 2013

How iterative reflections of monads are constructed.
Inf. Comput., 2013

Rational Operational Models.
Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

Well-Pointed Coalgebras
Log. Methods Comput. Sci., 2013

Abstract GSOS Rules and a Modular Treatment of Recursive Definitions.
Log. Methods Comput. Sci., 2013

Guard Your Daggers and Traces: On The Equational Properties of Guarded (Co-)recursion.
Proceedings of the Proceedings Workshop on Fixed Points in Computer Science, 2013

2012
On the specification of operations on the rational behaviour of systems
Proceedings of the Proceedings Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics, 2012

On the Formal Verification of Systems of Synchronous Software Components.
Proceedings of the Computer Safety, Reliability, and Security, 2012

A framework for formal verification of systems of synchronous components.
Proceedings of the Dagstuhl-Workshop MBEES: Modellbasierte Entwicklung eingebetteter Systeme VIII, 2012

Coproducts of Monads on Set.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Well-Pointed Coalgebras (Extended Abstract).
Proceedings of the Foundations of Software Science and Computational Structures, 2012

A Coalgebraic Perspective on Minimization and Determinization.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

On Finitary Functors and Their Presentations.
Proceedings of the Coalgebraic Methods in Computer Science - 11th International Workshop, 2012

2011
On second-order iterative monads.
Theor. Comput. Sci., 2011

Elgot theories: a new perspective on the equational properties of iteration.
Math. Struct. Comput. Sci., 2011

Semantics of Higher-Order Recursion Schemes
Log. Methods Comput. Sci., 2011

Formal Safety Analysis in Industrial Practice.
Proceedings of the Formal Methods for Industrial Critical Systems, 2011

Power-Set Functors and Saturated Trees.
Proceedings of the Computer Science Logic, 2011

From Corecursive Algebras to Corecursive Monads.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010
Iterative reflections of monads.
Math. Struct. Comput. Sci., 2010

Equational properties of iterative monads.
Inf. Comput., 2010

Recursive Program Schemes and Context-Free Monads.
Proceedings of the Tenth Workshop on Coalgebraic Methods in Computer Science, 2010

A Sound and Complete Calculus for Finite Stream Circuits.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

CIA Structures and the Semantics of Recursion.
Proceedings of the Foundations of Software Science and Computational Structures, 2010

2009
Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract).
Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

A Description of Iterative Reflections of Monads (Extended Abstract).
Proceedings of the Foundations of Software Science and Computational Structures, 2009

Complete Iterativity for Algebras with Effects.
Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2008
Corrigendum to: "The category theoretic solution of recursive program schemes" [TCS 366 (2006) 3-59].
Theor. Comput. Sci., 2008

On Algebras with Iteration.
J. Log. Comput., 2008

Bases for parametrized iterativity.
Inf. Comput., 2008

Modelbasierte Softwareentwicklung mit SCADE in der Eisenbahnautomatisierung.
Proceedings of the Dagstuhl-Workshop MBEES: Modellbasierte Entwicklung eingebetteter Systeme IV, 2008

2007
Algebras with parametrized iterativity.
Theor. Comput. Sci., 2007

Recursive coalgebras of finitary functors.
RAIRO Theor. Informatics Appl., 2007

What Are Iteration Theories?
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
The category-theoretic solution of recursive program schemes.
Theor. Comput. Sci., 2006

Iterative algebras at work.
Math. Struct. Comput. Sci., 2006

Elgot Algebras.
Log. Methods Comput. Sci., 2006

Terminal coalgebras and free iterative theories.
Inf. Comput., 2006

Special Issue: Seventh Workshop on Coalgebraic Methods in Computer Science 2004.
Inf. Comput., 2006

How Iterative are Iterative Algebras?
Proceedings of the Eighth Workshop on Coalgebraic Methods in Computer Science, 2006

2005
A general final coalgebra theorem.
Math. Struct. Comput. Sci., 2005

Completely iterative algebras and completely iterative monads.
Inf. Comput., 2005

Elgot Algebras: (Extended Abstract).
Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics, 2005

Koalgebren Monaden und Semantik.
Proceedings of the Ausgezeichnete Informatikdissertationen 2005, 2005

Coalgebras, monads and semantics.
PhD thesis, 2005

2004
On coalgebra based on classes.
Theor. Comput. Sci., 2004

Iterative Algebras for a Base.
Proceedings of the 10th Conference on Category Theory in Computer Science, 2004

From Iterative Algebras to Iterative Theories (Extended Abstract).
Proceedings of the Workshop on Coalgebraic Methods in Computer Science, 2004

Preface.
Proceedings of the Workshop on Coalgebraic Methods in Computer Science, 2004

2003
Infinite trees and completely iterative theories: a coalgebraic view.
Theor. Comput. Sci., 2003

Free Iterative Theories: A Coalgebraic View.
Math. Struct. Comput. Sci., 2003

On Colimits in Categories of Relations.
Appl. Categorical Struct., 2003

Some Remarks on Finitary and Iterative Monads.
Appl. Categorical Struct., 2003

2002
On Iteratable Endofunctors.
Proceedings of the Category Theory and Computer Science, 2002

On Rational Monads and Free Iterative Theories.
Proceedings of the Category Theory and Computer Science, 2002

Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors.
Proceedings of the Coalgebraic Methods in Computer Science, 2002

Parametric corecursion and completely iterative monads.
Proceedings of the Fixed Points in Computer Science, 2002


  Loading...