| When Programs Have to Watch Paint Dry
|
2023 |
Ahman, Danel |
| A Strict Constrained Superposition Calculus for Graphs
|
2023 |
Echahed, Rachid |
| Explainability of Probabilistic Bisimilarity Distances for Labelled Markov Chains
|
2023 |
Rady, Amgad |
| Quantitative Safety and Liveness
|
2023 |
Henzinger, Thomas A. |
| On the Comparison of Discounted-Sum Automata with Multiple Discount Factors
|
2023 |
Boker, Udi |
| Compositional Learning for Interleaving Parallel Automata
|
2023 |
Labbaf, Faezeh |
| Pebble minimization: the last theorems
|
2023 |
Douéneau-Tabot, Gaëtan |
| An Efficient Cyclic Entailment Procedure in a Fragment of Separation Logic
|
2023 |
Le, Quang Loc |
| Deciding Contextual Equivalence of v-Calculus with Effectful Contexts
|
2023 |
Hirschkoff, Daniel |
| Kantorovich Functors and Characteristic Logics for Behavioural Distances
|
2023 |
Goncharov, Sergey |
| A Formal Logic for Formal Category Theory
|
2023 |
New, Max S. |
| A Logical Framework with Higher-Order Rational (Circular) Terms
|
2023 |
Chen, Zhibo |
| A Programming Language Characterizing Quantum Polynomial Time
|
2023 |
Hainry, Emmanuel |
| Coverability in 2-VASS with One Unary Counter is in NP
|
2023 |
Mazowiecki, Filip |
| Unboundedness Problems for Machines with Reversal-Bounded Counters
|
2023 |
Baumann, Pascal |
| Reverse Bisimilarity vs. Forward Bisimilarity
|
2023 |
Bernardo, Marco |
| A Higher-Order Language for Markov Kernels and Linear Operators
|
2023 |
Amorim, Pedro H. Azevedo de |
| Weighted and Branching Bisimilarities from Generalized Open Maps
|
2023 |
Dubut, Jérémy |
| Fast Matching of Regular Patterns with Synchronizing Counting
|
2023 |
Holik, Lukáš |
| Model and Program Repair via Group Actions
|
2023 |
Attie, Paul C. |
Tag hinzufügen