E-LIB Suche - Ergebnisse für: Milius, Stefan

1

Monoidal Extended Stone Duality:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,

Birkmann, Fabian ; Urbat, Henning ; Milius, Stefan - p. 144-165 , 2024

Link: https://doi.org/10.1007/..

2

Eilenberg's variety theorem without Boolean operations:

Birkmann, Fabian ; Milius, Stefan ; Urbat, Henning
Information and Computation. 295 (2023) - p. 104916 , 2023

Link: https://doi.org/10.1016/..

3

Towards a Higher-Order Mathematical Operational Semantics:

Goncharov, Sergey ; Milius, Stefan ; Schröder, Lutz..
Proceedings of the ACM on Programming Languages. 7 (2023) POPL - p. 632-658 , 2023

Link: https://doi.org/10.1145/..

4

Weak Similarity in Higher-Order Mathematical Operational Se..:

, In: 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),

Urbat, Henning ; Tsampas, Stelios ; Goncharov, Sergey.. - p. 1-13 , 2023

Link: https://doi.org/10.1109/..

5

Quasilinear-time Computation of Generic Modal Witnesses for..:

Wißmann, Thorsten ; Milius, Stefan ; Schröder, Lutz
Logical Methods in Computer Science. 18, Issue 4 (2022) - p. , 2022

Link: https://doi.org/10.46298..

6

Graded Monads and Behavioural Equivalence Games:

, In: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science,

Ford, Chase ; Milius, Stefan ; Schröder, Lutz.. - p. 1-13 , 2022

Link: https://dl.acm.org/doi/1..

7

Coalgebraic Semantics for Nominal Automata:

, In: Coalgebraic Methods in Computer Science; Lecture Notes in Computer Science,

Frank, Florian ; Milius, Stefan ; Urbat, Henning - p. 45-66 , 2022

Link: https://doi.org/10.1007/..

8

Distributed Coalgebraic Partition Refinement:

, In: Tools and Algorithms for the Construction and Analysis of Systems; Lecture Notes in Computer Science,

Birkmann, Fabian ; Deifel, Hans-Peter ; Milius, Stefan - p. 159-177 , 2022

Link: https://doi.org/10.1007/..

9

On Language Varieties Without Boolean Operations:

, In: Language and Automata Theory and Applications; Lecture Notes in Computer Science,

Birkmann, Fabian ; Milius, Stefan ; Urbat, Henning - p. 3-15 , 2021

Link: https://doi.org/10.1007/..

10

Reiterman's Theorem on Finite Algebras for a Monad:

Adámek, Jiří ; Chen, Liang-Ting ; Milius, Stefan.
ACM Transactions on Computational Logic. 22 (2021) 4 - p. 1-48 , 2021

Link: https://doi.org/10.1145/..

11

Nondeterministic Syntactic Complexity:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,

Myers, Robert S. R. ; Milius, Stefan ; Urbat, Henning - p. 448-468 , 2021

Link: https://doi.org/10.1007/..

12

Finitary monads on the category of posets:

Adámek, Jiří ; Ford, Chase ; Milius, Stefan.
Mathematical Structures in Computer Science. 31 (2021) 7 - p. 799-821 , 2021

Link: https://doi.org/10.1017/..

13

From generic partition refinement to weighted tree automata..:

Wißmann, Thorsten ; Deifel, Hans-Peter ; Milius, Stefan.
Formal Aspects of Computing. 33 (2021) 4-5 - p. 695-727 , 2021

Link: https://doi.org/10.1007/..

14

On the behaviour of coalgebras with side effects and algebr..:

Adámek, Jiří ; Milius, Stefan ; Urbat, Henning
Journal of Logic and Computation. 31 (2021) 6 - p. 1429-1481 , 2021

Link: https://doi.org/10.1093/..

15

Behavioural preorders via graded monads:

, In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science,

Ford, Chase ; Milius, Stefan ; Schröder, Lutz - p. 1-13 , 2021

Link: https://dl.acm.org/doi/1..