| “Most of” Leads to Undecidability: Failure of Adding Frequencies to LTL
|
2021 |
Bednarczyk, Bartosz |
| Focused Proof-search in the Logic of Bunched Implications
|
2021 |
Gheorghiu, Alexander |
| On the Expressiveness of Büchi Arithmetic
|
2021 |
Haase, Christoph |
| Nondeterministic Syntactic Complexity
|
2021 |
Myers, Robert S. R. |
| A General Semantic Construction of Dependent Refinement Type Systems Categorically
|
2021 |
Kura, Satoshi |
| The Structure of Sum-Over-Paths, its Consequences, and Completeness for Completeness for Clifford
|
2021 |
Vilmart, Renaud |
| Nominal Equational Problems
|
2021 |
Ayala-Rincon, Mauricio |
| Interpolation and Amalgamation for Arrays with MaxDiff
|
2021 |
Ghilardi, Silvio |
| Parametricity for Primitive Nested Types
|
2021 |
Johann, Patricia |
| Simple Stochastic Games with Almost-Sure Energy-Parity Objectives arein NPand coNP ’5 + + +
|
2021 |
Mayr, Richard |
| Constructing a Universe for the Setoid Model
|
2021 |
Altenkirch, Thorsten |
| Fair Refinement for Asynchronous Session Types
|
2021 |
Bravetti, Mario |
| Leafy Automata for Higher-order Concurrency
|
2021 |
Dixon, Alex |
| Generalized Bounded Linear Logic and its Categorical Semantics
|
2021 |
Fukihara, Yöji |
| The Spirit of Node Replication
|
2021 |
Kesner, Delia |
| Certifying Inexpressibility
|
2021 |
Kupferman, Orna |
| A String Diagrammatic Axiomatisation of Finite-State Automata
|
2021 |
Piedeleu, Robin |
| Work-sensitive Dynamic Complexity of Formal Languages
|
2021 |
Schmidt, Jonas |
| A Quantified Coalgebraic van Benthem Theorem
|
2021 |
Wild, Paul |
| Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
|
2021 |
Balasubramanian, A. R. |
Tag hinzufügen