default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Milius
Person information
- affiliation: University of Erlangen-Nuremberg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c82]Fabian Birkmann
, Henning Urbat, Stefan Milius:
Monoidal Extended Stone Duality. FoSSaCS (1) 2024: 144-165- [c81]Sergey Goncharov, Stefan Milius, Stelios Tsampas, Henning Urbat:
Bialgebraic Reasoning on Higher-order Program Equivalence. LICS 2024: 39:1-39:15 - [c80]Thorsten Wißmann, Stefan Milius:
Initial Algebras Unchained - A Novel Initial Algebra Construction Formalized in Agda. LICS 2024: 72:1-72:14 - [i58]Fabian Birkmann, Henning Urbat, Stefan Milius:
Monoidal Extended Stone Duality. CoRR abs/2401.08219 (2024) - [i57]Jan Jurka, Stefan Milius, Henning Urbat:
Algebraic Reasoning over Relational Structures. CoRR abs/2401.08445 (2024) - [i56]Sergey Goncharov, Stefan Milius, Stelios Tsampas, Henning Urbat:
Bialgebraic Reasoning on Higher-Order Program Equivalence. CoRR abs/2402.00625 (2024) - [i55]Thorsten Wißmann, Stefan Milius:
Initial Algebras Unchained - A Novel Initial Algebra Construction Formalized in Agda. CoRR abs/2405.09504 (2024) - [i54]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Higher-Order Mathematical Operational Semantics. CoRR abs/2405.16708 (2024) - [i53]Florian Frank, Daniel Hausmann, Stefan Milius, Lutz Schröder, Henning Urbat:
Alternating Nominal Automata with Name Allocation. CoRR abs/2408.03658 (2024) - 2023
- [j51]Fabian Birkmann, Stefan Milius, Henning Urbat:
Eilenberg's variety theorem without Boolean operations. Inf. Comput. 295(Part B): 104916 (2023) - [j50]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Towards a Higher-Order Mathematical Operational Semantics. Proc. ACM Program. Lang. 7(POPL): 632-658 (2023) - [c79]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
On Kripke, Vietoris and Hausdorff Polynomial Functors ((Co)algebraic pearls). CALCO 2023: 21:1-21:20 - [c78]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Higher-Order Mathematical Operational Semantics (Early Ideas). CALCO 2023: 24:1-24:3 - [c77]Fabian Birkmann, Stefan Milius, Henning Urbat:
Nominal Topology for Data Languages. ICALP 2023: 114:1-114:21 - [c76]Henning Urbat, Stelios Tsampas, Sergey Goncharov, Stefan Milius, Lutz Schröder:
Weak Similarity in Higher-Order Mathematical Operational Semantics. LICS 2023: 1-13 - [c75]Florian Frank, Stefan Milius, Henning Urbat:
Positive Data Languages. MFCS 2023: 48:1-48:15 - [i52]Henning Urbat, Stelios Tsampas, Sergey Goncharov, Stefan Milius, Lutz Schröder:
Weak Similarity in Higher-Order Mathematical Operational Semantics. CoRR abs/2302.08200 (2023) - [i51]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
On Kripke, Vietoris and Hausdorff Polynomial Functors. CoRR abs/2303.11071 (2023) - [i50]Florian Frank, Stefan Milius, Henning Urbat:
Positive Data Languages. CoRR abs/2304.12947 (2023) - [i49]Henning Urbat, Stefan Milius, Fabian Birkmann:
Nominal Topology for Data Languages. CoRR abs/2304.13337 (2023) - 2022
- [j49]Thorsten Wißmann, Stefan Milius, Lutz Schröder:
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence. Log. Methods Comput. Sci. 18(4) (2022) - [c74]Florian Frank, Stefan Milius, Henning Urbat:
Coalgebraic Semantics for Nominal Automata. CMCS 2022: 45-66 - [c73]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Stateful Structural Operational Semantics. FSCD 2022: 30:1-30:19 - [c72]Chase Ford, Stefan Milius, Lutz Schröder, Harsh Beohar, Barbara König:
Graded Monads and Behavioural Equivalence Games. LICS 2022: 61:1-61:13 - [c71]Fabian Birkmann, Hans-Peter Deifel, Stefan Milius:
Distributed Coalgebraic Partition Refinement. TACAS (2) 2022: 159-177 - [d1]Fabian Birkmann, Hans-Peter Deifel, Stefan Milius:
Software and Benchmarks for Distributed Coalgebraic Partition Refinement. Zenodo, 2022
- [i48]Florian Frank, Stefan Milius, Henning Urbat:
Coalgebraic Semantics for Nominal Automata. CoRR abs/2202.06546 (2022) - [i47]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Stateful Structural Operational Semantics. CoRR abs/2202.10866 (2022) - [i46]Thorsten Wißmann, Stefan Milius, Lutz Schröder:
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence. CoRR abs/2203.11175 (2022) - [i45]Harsh Beohar, Chase Ford, Barbara König, Stefan Milius, Lutz Schröder:
Graded Monads and Behavioural Equivalence Games. CoRR abs/2203.15467 (2022) - [i44]Fabian Birkmann, Hans-Peter Deifel, Stefan Milius:
Distributed Coalgebraic Partition Refinement. CoRR abs/2204.06248 (2022) - [i43]Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat:
Towards a Higher-Order Mathematical Operational Semantics. CoRR abs/2210.13387 (2022) - 2021
- [j48]Thorsten Wißmann, Hans-Peter Deifel, Stefan Milius, Lutz Schröder:
From generic partition refinement to weighted tree automata minimization. Formal Aspects Comput. 33(4-5): 695-727 (2021) - [j47]Jirí Adámek, Stefan Milius, Henning Urbat:
On the behaviour of coalgebras with side effects and algebras with effectful iteration. J. Log. Comput. 31(6): 1429-1481 (2021) - [j46]Jirí Adámek, Chase Ford, Stefan Milius, Lutz Schröder:
Finitary monads on the category of posets. Math. Struct. Comput. Sci. 31(7): 799-821 (2021) - [j45]Jirí Adámek, Liang-Ting Chen, Stefan Milius, Henning Urbat:
Reiterman's Theorem on Finite Algebras for a Monad. ACM Trans. Comput. Log. 22(4): 23:1-23:48 (2021) - [c70]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
Initial Algebras Without Iteration ((Co)algebraic pearls). CALCO 2021: 5:1-5:20 - [c69]Chase Ford, Stefan Milius, Lutz Schröder:
Monads on Categories of Relational Structures. CALCO 2021: 14:1-14:17 - [c68]Henning Urbat, Daniel Hausmann, Stefan Milius, Lutz Schröder:
Nominal Büchi Automata with Name Allocation. CONCUR 2021: 4:1-4:16 - [c67]Thorsten Wißmann, Stefan Milius, Lutz Schröder:
Explaining Behavioural Inequivalence Generically in Quasilinear Time. CONCUR 2021: 32:1-32:18 - [c66]Robert S. R. Myers, Stefan Milius, Henning Urbat:
Nondeterministic Syntactic Complexity. FoSSaCS 2021: 448-468 - [c65]Hans-Peter Deifel, Stefan Milius, Thorsten Wißmann:
Coalgebra Encoding for Efficient Minimization. FSCD 2021: 28:1-28:19 - [c64]Fabian Birkmann, Stefan Milius, Henning Urbat:
On Language Varieties Without Boolean Operations. LATA 2021: 3-15 - [c63]Chase Ford, Stefan Milius, Lutz Schröder:
Behavioural Preorders via Graded Monads. LICS 2021: 1-13 - [c62]Daniel Hausmann, Stefan Milius, Lutz Schröder:
A Linear-Time Nominal μ-Calculus with Name Allocation. MFCS 2021: 58:1-58:18 - [i42]Jirí Adámek, Liang-Ting Chen, Stefan Milius, Henning Urbat:
Reiterman's Theorem on Finite Algebras for a Monad. CoRR abs/2101.00942 (2021) - [i41]Robert S. R. Myers, Stefan Milius, Henning Urbat:
Nondeterministic Syntactic Complexity. CoRR abs/2101.03039 (2021) - [i40]Hans-Peter Deifel, Stefan Milius, Thorsten Wißmann:
Coalgebra Encoding for Efficient Minimization. CoRR abs/2102.12842 (2021) - [i39]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
An Initial Algebra Theorem Without Iteration. CoRR abs/2104.09837 (2021) - [i38]Thorsten Wißmann, Stefan Milius, Lutz Schröder:
Explaining Behavioural Inequivalence Generically in Quasilinear Time. CoRR abs/2105.00669 (2021) - [i37]Henning Urbat, Daniel Hausmann, Stefan Milius, Lutz Schröder:
Nominal Büchi Automata with Name Allocation. CoRR abs/2107.03213 (2021) - 2020
- [j44]Janine Schneider, Hans-Peter Deifel, Stefan Milius, Felix C. Freiling:
Unifying Metadata-Based Storage Reconstruction and Carving with LAYR. Digit. Investig. 33 Supplement: 301006 (2020) - [j43]Stefan Milius, Dirk Pattinson, Thorsten Wißmann:
A new foundation for finitary corecursion and iterative algebras. Inf. Comput. 271: 104456 (2020) - [j42]Thorsten Wißmann, Ulrich Dorsch, Stefan Milius, Lutz Schröder:
Efficient and Modular Coalgebraic Partition Refinement. Log. Methods Comput. Sci. 16(1) (2020) - [j41]Sergey Goncharov, Stefan Milius, Alexandra Silva:
Toward a Uniform Theory of Effectful State Machines. ACM Trans. Comput. Log. 21(3): 23:1-23:63 (2020) - [c61]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
On Well-Founded and Recursive Coalgebras. FoSSaCS 2020: 17-36 - [i36]Thorsten Wißmann, Hans-Peter Deifel, Stefan Milius, Lutz Schröder:
From Generic Partition Refinement to Weighted Tree Automata Minimization. CoRR abs/2004.01250 (2020) - [i35]Daniel Hausmann, Stefan Milius, Lutz Schröder:
Harnessing LTL With Freeze Quantification. CoRR abs/2010.10912 (2020) - [i34]Fabian Birkmann, Stefan Milius, Henning Urbat:
On Language Varieties Without Boolean Operations. CoRR abs/2011.06951 (2020) - [i33]Chase Ford, Stefan Milius, Lutz Schröder:
Behavioural Preorders via Graded Monads. CoRR abs/2011.14339 (2020)
2010 – 2019
- 2019
- [j40]Jirí Adámek, Stefan Milius:
On functors preserving coproducts and algebras with iterativity. Theor. Comput. Sci. 763: 66-87 (2019) - [j39]Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat:
Generalized Eilenberg Theorem: Varieties of Languages in a Category. ACM Trans. Comput. Log. 20(1): 3:1-3:47 (2019) - [c60]Stefan Milius:
From Equational Specifications of Algebras with Structure to Varieties of Data Languages (Invited Paper). CALCO 2019: 2:1-2:5 - [c59]Ulrich Dorsch, Stefan Milius, Lutz Schröder:
Graded Monads and Graded Logics for the Linear Time - Branching Time Spectrum. CONCUR 2019: 36:1-36:16 - [c58]Hans-Peter Deifel, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Generic Partition Refinement and Weighted Tree Automata. FM 2019: 280-297 - [c57]Stefan Milius, Henning Urbat:
Equational Axiomatization of Algebras with Structure. FoSSaCS 2019: 400-417 - [c56]Henning Urbat, Stefan Milius:
Varieties of Data Languages. ICALP 2019: 130:1-130:14 - [i32]Henning Urbat, Stefan Milius:
Varieties of Data Languages. CoRR abs/1903.08053 (2019) - [i31]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
On Well-Founded and Recursive Coalgebras. CoRR abs/1910.09401 (2019) - [i30]Stefan Milius, Jirí Adámek, Henning Urbat:
On the Behaviour of Coalgebras with Side Effects and Algebras with Effectful Iteration. CoRR abs/1911.06346 (2019) - 2018
- [j38]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
Fixed points of functors. J. Log. Algebraic Methods Program. 95: 41-81 (2018) - [j37]Jirí Adámek, Stefan Milius, Henning Urbat:
A Categorical Approach to Syntactic Monoids. Log. Methods Comput. Sci. 14(2) (2018) - [j36]Stefan Milius:
Proper Functors and Fixed Points for Finite Behaviour. Log. Methods Comput. Sci. 14(3) (2018) - [c55]Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages. CMCS 2018: 56-77 - [c54]Stefan Milius, Jirí Adámek, Henning Urbat:
On Algebras with Effectful Iteration. CMCS 2018: 144-166 - [i29]Stefan Milius, Dirk Pattinson, Thorsten Wißmann:
A New Foundation for Finitary Corecursion and Iterative Algebras. CoRR abs/1802.08070 (2018) - [i28]Jirí Adámek, Stefan Milius, Henning Urbat:
A Categorical Approach to Syntactic Monoids. CoRR abs/1804.03011 (2018) - [i27]Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages. CoRR abs/1805.07211 (2018) - [i26]Thorsten Wißmann, Ulrich Dorsch, Stefan Milius, Lutz Schröder:
Efficient and Modular Coalgebraic Partition Refinement. CoRR abs/1806.05654 (2018) - [i25]Hans-Peter Deifel, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
CoPaR: An Efficient Generic Partition Refiner. CoRR abs/1811.08850 (2018) - [i24]Ulrich Dorsch, Stefan Milius, Lutz Schröder:
Graded Monads for the Linear Time - Branching Time Spectrum. CoRR abs/1812.01317 (2018) - [i23]Stefan Milius, Henning Urbat:
Equational Axiomatization of Algebras with Structure. CoRR abs/1812.02016 (2018) - 2017
- [j35]Stefan Milius, Tadeusz Litak:
Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion. Fundam. Informaticae 150(3-4): 407-449 (2017) - [c53]Jirí Adámek, Stefan Milius:
On Corecursive Algebras for Functors Preserving Coproducts. CALCO 2017: 3:1-3:15 - [c52]Stefan Milius:
Proper Functors and their Rational Fixed Point. CALCO 2017: 18:1-18:16 - [c51]Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Efficient Coalgebraic Partition Refinement. CONCUR 2017: 32:1-32:16 - [c50]Hans-Peter Deifel, Merlin Göttlinger, Stefan Milius, Lutz Schröder, Christian Dietrich, Daniel Lohmann:
Automatic verification of application-tailored OSEK kernels. FMCAD 2017: 196-203 - [c49]Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann:
Nominal Automata with Name Binding. FoSSaCS 2017: 124-142 - [c48]Henning Urbat, Jirí Adámek, Liang-Ting Chen, Stefan Milius:
Eilenberg Theorems for Free. MFCS 2017: 43:1-43:15 - [i22]Jirí Adámek, Stefan Milius:
On Corecursive Algebras for Functors Preserving Coproducts. CoRR abs/1703.07574 (2017) - [i21]Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
A Coalgebraic Paige-Tarjan Algorithm. CoRR abs/1705.08362 (2017) - [i20]Stefan Milius:
Proper Functors and their Rational Fixed Point. CoRR abs/1705.09198 (2017) - 2016
- [j34]Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Regular Behaviours with Names - On Rational Fixpoints of Endofunctors on Nominal Sets. Appl. Categorical Struct. 24(5): 663-701 (2016) - [c47]Stefan Milius, Dirk Pattinson, Thorsten Wißmann:
A New Foundation for Finitary Corecursion - The Locally Finite Fixpoint and Its Properties. FoSSaCS 2016: 107-125 - [c46]Liang-Ting Chen, Jirí Adámek, Stefan Milius, Henning Urbat:
Profinite Monads, Profinite Equations, and Reiterman's Theorem. FoSSaCS 2016: 531-547 - [c45]Kristof Teichel, Dieter Sibold, Stefan Milius:
An Attack Possibility on Time Synchronization Protocols Secured with TESLA-Like Mechanisms. ICISS 2016: 3-22 - [c44]Sergey Goncharov, Stefan Milius, Christoph Rauch:
Complete Elgot Monads and Coalgebraic Resumptions. MFPS 2016: 147-168 - [i19]Stefan Milius, Dirk Pattinson, Thorsten Wißmann:
A New Foundation for Finitary Corecursion. CoRR abs/1601.01532 (2016) - [i18]Henning Urbat, Jirí Adámek, Liang-Ting Chen, Stefan Milius:
One Eilenberg Theorem to Rule Them All. CoRR abs/1602.05831 (2016) - [i17]Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann:
Nominal Automata with Name Binding. CoRR abs/1603.01455 (2016) - [i16]Sergey Goncharov, Stefan Milius, Christoph Rauch:
Complete Elgot Monads and Coalgebraic Resumptions. CoRR abs/1603.02148 (2016) - [i15]Stefan Milius, Tadeusz Litak:
Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion. CoRR abs/1603.05214 (2016) - [i14]Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Regular Behaviours with Names. CoRR abs/1607.07828 (2016) - 2015
- [j33]Jirí Adámek, Paul Blain Levy, Stefan Milius, Lawrence S. Moss, Lurdes Sousa:
On Final Coalgebras of Power-Set Functors and Saturated Trees - To George Janelidze on the Occasion of His Sixtieth Birthday. Appl. Categorical Struct. 23(4): 609-641 (2015) - [j32]Jirí Adámek, Stefan Milius, Lawrence S. Moss, Henning Urbat:
On finitary functors and their presentations. J. Comput. Syst. Sci. 81(5): 813-833 (2015) - [j31]Robert S. R. Myers, Jirí Adámek, Stefan Milius, Henning Urbat:
Coalgebraic constructions of canonical nondeterministic automata. Theor. Comput. Sci. 604: 81-101 (2015) - [j30]Filippo Bonchi, Stefan Milius, Alexandra Silva, Fabio Zanasi:
Killing epsilons with a dagger: A coalgebraic study of systems with algebraic label structure. Theor. Comput. Sci. 604: 102-126 (2015) - [c43]Alexander Kurz, Stefan Milius, Dirk Pattinson, Lutz Schröder:
Simplified Coalgebraic Trace Equivalence. Software, Services, and Systems 2015: 75-90 - [c42]Jirí Adámek, Stefan Milius, Henning Urbat:
Syntactic Monoids in a Category. CALCO 2015: 1-16 - [c41]Stefan Milius, Dirk Pattinson, Lutz Schröder:
Generic Trace Semantics and Graded Monads. CALCO 2015: 253-269 - [c40]Stefan Milius, Thorsten Wißmann:
Finitary Corecursion for the Infinitary Lambda Calculus. CALCO 2015: 336-351 - [c39]Jirí Adámek, Robert S. R. Myers, Henning Urbat, Stefan Milius:
Varieties of Languages in a Category. LICS 2015: 414-425 - [c38]Kristof Teichel, Dieter Sibold, Stefan Milius:
First Results of a Formal Analysis of the Network Time Security Specification. SSR 2015: 218-245 - [i13]Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat:
Generalized Eilenberg Theorem I: Local Varieties of Languages. CoRR abs/1501.02834 (2015) - [i12]Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat:
Varieties of Languages in a Category. CoRR abs/1501.05180 (2015) - [i11]Jirí Adámek, Stefan Milius, Henning Urbat:
Syntactic Monoids in a Category. CoRR abs/1504.02694 (2015) - [i10]Stefan Milius, Thorsten Wißmann:
Finitary Corecursion for the Infinitary Lambda Calculus. CoRR abs/1505.07736 (2015) - [i9]Liang-Ting Chen, Jirí Adámek, Stefan Milius, Henning Urbat:
Profinite Monads, Profinite Equations and Reiterman's Theorem. CoRR abs/1511.02147 (2015) - 2014
- [j29]Jirí Adámek, Mahdieh Haddadi, Stefan Milius:
Corecursive Algebras, Corecursive Monads and Bloom Monads. Log. Methods Comput. Sci. 10(3) (2014) - [j28]Michaela Huhn, Stefan Milius:
Observations on formal safety analysis in practice. Sci. Comput. Program. 80: 150-168 (2014) - [j27]Jirí Adámek, Stefan Milius, Jirí Velebil:
Base modules for parametrized iterativity. Theor. Comput. Sci. 523: 56-85 (2014) - [c37]Filippo Bonchi, Stefan Milius, Alexandra Silva, Fabio Zanasi:
How to Kill Epsilons with a Dagger - A Coalgebraic Take on Systems with Algebraic Label Structure. CMCS 2014: 53-74 - [c36]Robert S. R. Myers, Jirí Adámek, Stefan Milius, Henning Urbat:
Canonical Nondeterministic Automata. CMCS 2014: 189-210 - [c35]Henning Basold, Henning Günther, Michaela Huhn, Stefan Milius:
An Open Alternative for SMT-Based Verification of Scade Models. FMICS 2014: 124-139 - [c34]Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat:
Generalized Eilenberg Theorem I: Local Varieties of Languages. FoSSaCS 2014: 366-380 - [c33]Sergey Goncharov, Stefan Milius, Alexandra Silva:
Towards a Coalgebraic Chomsky Hierarchy - (Extended Abstract). IFIP TCS 2014: 265-280 - [c32]Jirí Adámek, Robert S. R. Myers, Henning Urbat, Stefan Milius:
On Continuous Nondeterminism and State Minimality. MFPS 2014: 3-23 - [i8]Sergey Goncharov, Stefan Milius, Alexandra Silva:
Towards a Coalgebraic Chomsky Hierarchy. CoRR abs/1401.5277 (2014) - [i7]Filippo Bonchi, Stefan Milius, Alexandra Silva, Fabio Zanasi:
How to Kill Epsilons with a Dagger - A Coalgebraic Take on Systems with Algebraic Label Structure. CoRR abs/1402.4062 (2014) - [i6]Jirí Adámek, Nathan J. Bowler, Paul Blain Levy, Stefan Milius:
Coproducts of Monads on Set. CoRR abs/1409.3804 (2014) - [i5]Alexander Kurz, Stefan Milius, Dirk Pattinson, Lutz Schröder:
Simplified Coalgebraic Trace Equivalence. CoRR abs/1410.2463 (2014) - 2013
- [j26]Stefan Milius, Lawrence S. Moss, Daniel Schwencke:
Abstract GSOS Rules and a Modular Treatment of Recursive Definitions. Log. Methods Comput. Sci. 9(3) (2013) - [j25]Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa:
Well-Pointed Coalgebras. Log. Methods Comput. Sci. 9(3) (2013) - [j24]Jirí Adámek, Stefan Milius, Jirí Velebil:
How iterative reflections of monads are constructed. Inf. Comput. 225: 83-118 (2013) - [j23]Marcello M. Bonsangue, Stefan Milius, Alexandra Silva:
Sound and Complete Axiomatizations of Coalgebraic Language Equivalence. ACM Trans. Comput. Log. 14(1): 7:1-7:52 (2013) - [c31]Stefan Milius, Tadeusz Litak:
Guard Your Daggers and Traces: On The Equational Properties of Guarded (Co-)recursion. FICS 2013: 72-86 - [c30]Stefan Milius, Marcello M. Bonsangue, Robert S. R. Myers, Jurriaan Rot:
Rational Operational Models. MFPS 2013: 257-282 - [e2]Reiko Heckel, Stefan Milius:
Algebra and Coalgebra in Computer Science - 5th International Conference, CALCO 2013, Warsaw, Poland, September 3-6, 2013. Proceedings. Lecture Notes in Computer Science 8089, Springer 2013, ISBN 978-3-642-40205-0 [contents] - 2012
- [c29]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
On Finitary Functors and Their Presentations. CMCS 2012: 51-70 - [c28]Jirí Adámek, Filippo Bonchi, Mathias Hülsbusch, Barbara König, Stefan Milius, Alexandra Silva:
A Coalgebraic Perspective on Minimization and Determinization. FoSSaCS 2012: 58-73 - [c27]Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa:
Well-Pointed Coalgebras (Extended Abstract). FoSSaCS 2012: 89-103 - [c26]Jirí Adámek, Stefan Milius, Nathan J. Bowler, Paul Blain Levy:
Coproducts of Monads on Set. LICS 2012: 45-54 - [c25]Stefan Milius, Henning Günther, Jan Peleska, Oliver Möller, Helge Löding, Martin Sulzmann, Ramin Hedayati, Axel Zechner:
A framework for formal verification of systems of synchronous components. MBEES 2012: 145-154 - [c24]Henning Günther, Stefan Milius, Oliver Möller:
On the Formal Verification of Systems of Synchronous Software Components. SAFECOMP 2012: 291-304 - [c23]Marcello M. Bonsangue, Stefan Milius, Jurriaan Rot:
On the specification of operations on the rational behaviour of systems. EXPRESS/SOS 2012: 3-18 - 2011
- [j22]Jirí Adámek, Stefan Milius, Jirí Velebil:
Semantics of Higher-Order Recursion Schemes. Log. Methods Comput. Sci. 7(1) (2011) - [j21]Jirí Adámek, Stefan Milius, Jirí Velebil:
Elgot theories: a new perspective on the equational properties of iteration. Math. Struct. Comput. Sci. 21(2): 417-480 (2011) - [j20]Jirí Adámek, Stefan Milius, Jirí Velebil:
On second-order iterative monads. Theor. Comput. Sci. 412(38): 4969-4988 (2011) - [c22]Jirí Adámek, Mahdieh Haddadi, Stefan Milius:
From Corecursive Algebras to Corecursive Monads. CALCO 2011: 55-69 - [c21]Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa:
Power-Set Functors and Saturated Trees. CSL 2011: 5-19 - [c20]Ilyas Daskaya, Michaela Huhn, Stefan Milius:
Formal Safety Analysis in Industrial Practice. FMICS 2011: 68-84 - [i4]Marcello M. Bonsangue, Stefan Milius, Alexandra Silva:
Sound and complete axiomatizations of coalgebraic language equivalence. CoRR abs/1104.2803 (2011) - 2010
- [j19]Jirí Adámek, Stefan Milius, Jirí Velebil:
Equational properties of iterative monads. Inf. Comput. 208(12): 1306-1348 (2010) - [j18]Jirí Adámek, Stefan Milius, Jirí Velebil:
Iterative reflections of monads. Math. Struct. Comput. Sci. 20(3): 419-452 (2010) - [c19]Stefan Milius, Lawrence S. Moss, Daniel Schwencke:
CIA Structures and the Semantics of Recursion. FoSSaCS 2010: 312-327 - [c18]Stefan Milius:
A Sound and Complete Calculus for Finite Stream Circuits. LICS 2010: 421-430 - [c17]Jirí Adámek, Stefan Milius, Jirí Velebil:
Recursive Program Schemes and Context-Free Monads. CMCS@ETAPS 2010: 3-23
2000 – 2009
- 2009
- [c16]Stefan Milius, Thorsten Palm, Daniel Schwencke:
Complete Iterativity for Algebras with Effects. CALCO 2009: 34-48 - [c15]Jirí Adámek, Stefan Milius, Jirí Velebil:
Semantics of Higher-Order Recursion Schemes. CALCO 2009: 49-63 - [c14]Jirí Adámek, Stefan Milius, Jirí Velebil:
A Description of Iterative Reflections of Monads (Extended Abstract). FoSSaCS 2009: 152-166 - [c13]Jirí Adámek, Stefan Milius, Jirí Velebil:
Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract). MFPS 2009: 407-427 - [i3]Stefan Milius, Lawrence S. Moss:
The Category Theoretic Solution of Recursive Program Schemes. CoRR abs/0904.2385 (2009) - 2008
- [j17]Jirí Adámek, Stefan Milius, Jirí Velebil:
Bases for parametrized iterativity. Inf. Comput. 206(8): 966-1002 (2008) - [j16]Jirí Adámek, Stephen L. Bloom, Stefan Milius:
On Algebras with Iteration. J. Log. Comput. 18(6): 1047-1085 (2008) - [j15]Stefan Milius, Lawrence S. Moss:
Corrigendum to: "The category theoretic solution of recursive program schemes" [TCS 366 (2006) 3-59]. Theor. Comput. Sci. 403(2-3): 409-415 (2008) - [c12]Stefan Milius, Uwe Steinke:
Modelbasierte Softwareentwicklung mit SCADE in der Eisenbahnautomatisierung. MBEES 2008: 68-77 - 2007
- [j14]Jirí Adámek, Dominik Lücke, Stefan Milius:
Recursive coalgebras of finitary functors. RAIRO Theor. Informatics Appl. 41(4): 447-462 (2007) - [j13]Jirí Adámek, Stefan Milius, Jirí Velebil:
Algebras with parametrized iterativity. Theor. Comput. Sci. 388(1-3): 130-151 (2007) - [c11]Jirí Adámek, Stefan Milius, Jirí Velebil:
What Are Iteration Theories? MFCS 2007: 240-252 - 2006
- [j12]Jirí Adámek, Stefan Milius:
Special Issue: Seventh Workshop on Coalgebraic Methods in Computer Science 2004. Inf. Comput. 204(4): 435-436 (2006) - [j11]Jirí Adámek, Stefan Milius:
Terminal coalgebras and free iterative theories. Inf. Comput. 204(7): 1139-1172 (2006) - [j10]Jirí Adámek, Stefan Milius, Jirí Velebil:
Elgot Algebras. Log. Methods Comput. Sci. 2(5) (2006) - [j9]Jirí Adámek, Stefan Milius, Jirí Velebil:
Iterative algebras at work. Math. Struct. Comput. Sci. 16(6): 1085-1131 (2006) - [j8]Stefan Milius, Lawrence S. Moss:
The category-theoretic solution of recursive program schemes. Theor. Comput. Sci. 366(1-2): 3-59 (2006) - [c10]Jirí Adámek, Stefan Milius, Jirí Velebil:
How Iterative are Iterative Algebras? CMCS 2006: 157-175 - [i2]Jirí Adámek, Stefan Milius, Jirí Velebil:
Elgot Algebras. CoRR abs/cs/0609040 (2006) - 2005
- [b1]Stefan Milius:
Coalgebras, monads and semantics. Braunschweig University of Technology, Germany, 2005 - [j7]Stefan Milius:
Completely iterative algebras and completely iterative monads. Inf. Comput. 196(1): 1-41 (2005) - [j6]Jirí Adámek, Stefan Milius, Jirí Velebil:
A general final coalgebra theorem. Math. Struct. Comput. Sci. 15(3): 409-432 (2005) - [c9]Stefan Milius, Lawrence S. Moss:
The Category Theoretic Solution of Recursive Program Schemes. CALCO 2005: 293-312 - [c8]Jirí Adámek, Stefan Milius, Jirí Velebil:
Elgot Algebras: (Extended Abstract). MFPS 2005: 87-109 - [p1]Stefan Milius:
Koalgebren Monaden und Semantik. Ausgezeichnete Informatikdissertationen 2005: 67-76 - 2004
- [j5]Jirí Adámek, Stefan Milius, Jirí Velebil:
On coalgebra based on classes. Theor. Comput. Sci. 316(1): 3-23 (2004) - [c7]Jirí Adámek, Stefan Milius:
Preface. CMCS 2004: 1-2 - [c6]Jirí Adámek, Stefan Milius, Jirí Velebil:
From Iterative Algebras to Iterative Theories (Extended Abstract). CMCS 2004: 3-24 - [c5]Jirí Adámek, Stefan Milius, Jirí Velebil:
Iterative Algebras for a Base. CTCS 2004: 147-170 - [e1]Jirí Adámek, Stefan Milius:
Proceedings of the Workshop on Coalgebraic Methods in Computer Science, CMCS 2004, Barcelona, Spain, March 27-29, 2004. Electronic Notes in Theoretical Computer Science 106, Elsevier 2004 [contents] - 2003
- [j4]Stefan Milius:
On Colimits in Categories of Relations. Appl. Categorical Struct. 11(3): 287-312 (2003) - [j3]Jirí Adámek, Stefan Milius, Jirí Velebil:
Some Remarks on Finitary and Iterative Monads. Appl. Categorical Struct. 11(6): 521-541 (2003) - [j2]Jirí Adámek, Stefan Milius, Jirí Velebil:
Free Iterative Theories: A Coalgebraic View. Math. Struct. Comput. Sci. 13(2): 259-320 (2003) - [j1]Peter Aczel, Jirí Adámek, Stefan Milius, Jirí Velebil:
Infinite trees and completely iterative theories: a coalgebraic view. Theor. Comput. Sci. 300(1-3): 1-45 (2003) - [i1]Jirí Adámek, Stefan Milius, Jirí Velebil:
On coalgebra based on classes. CoRR cs.LO/0306118 (2003) - 2002
- [c4]Jirí Adámek, Stefan Milius, Jirí Velebil:
Parametric corecursion and completely iterative monads. FICS 2002: 2-5 - [c3]Jirí Adámek, Stefan Milius, Jirí Velebil:
Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors. CMCS 2002: 1-28 - [c2]Jirí Adámek, Stefan Milius, Jirí Velebil:
On Rational Monads and Free Iterative Theories. CTCS 2002: 23-46 - [c1]Stefan Milius:
On Iteratable Endofunctors. CTCS 2002: 287-304
Coauthor Index
[c79] [i51] [j47] [j46] [j45] [c70] [i42] [i39] [c61] [j40] [j39] [i31] [i30] [j38] [j37] [c54] [i28] [c53] [c48] [i22] [c46] [i18] [j33] [j32] [j31] [c42] [c39] [i13] [i12] [i11] [i9] [j29] [j27] [c36] [c34] [c32] [i6] [j25] [j24] [c29] [c28] [c27] [c26] [j22] [j21] [j20] [c22] [c21] [j19] [j18] [c17] [c15] [c14] [c13] [j17] [j16] [j14] [j13] [c11] [j12] [j11] [j10] [j9] [c10] [i2] [j6] [c8] [j5] [c7] [c6] [c5] [e1] [j3] [j2] [j1] [i1] [c4] [c3] [c2]
[c82] [c81] [i58] [i57] [i56] [i54] [i53] [j51] [j50] [c78] [c77] [c76] [c75] [i52] [i50] [i49] [c74] [c73] [i48] [i47] [i43] [j47] [j45] [c68] [c66] [c64] [i42] [i41] [i37] [i34] [j39] [c57] [c56] [i32] [i30] [j37] [c54] [i28] [i23] [c48] [c46] [i18] [j32] [j31] [c42] [c39] [i13] [i12] [i11] [i9] [c36] [c34] [c32]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-10 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
