Abstract is missing.
- When Programs Have to Watch Paint DryDanel Ahman. 1-23 [doi]
- Deciding Contextual Equivalence of ν-Calculus with Effectful ContextsDaniel Hirschkoff, Guilhem Jaber, Enguerrand Prebet. 24-45 [doi]
- Kantorovich Functors and Characteristic Logics for Behavioural DistancesSergey Goncharov 0001, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild. 46-67 [doi]
- A Logical Framework with Higher-Order Rational (Circular) TermsZhibo Chen, Frank Pfenning. 68-88 [doi]
- A Higher-Order Language for Markov Kernels and Linear OperatorsPedro H. Azevedo de Amorim. 89-112 [doi]
- A Formal Logic for Formal Category TheoryMax S. New, Daniel R. Licata. 113-134 [doi]
- A Strict Constrained Superposition Calculus for GraphsRachid Echahed, Mnacho Echenim, Mehdi Mhalla, Nicolas Peltier. 135-155 [doi]
- A Programming Language Characterizing Quantum Polynomial TimeEmmanuel Hainry, Romain Péchoux, Mário Silva. 156-175 [doi]
- On the Existential Arithmetics with Addition and Bitwise MinimumMikhail R. Starchak. 176-195 [doi]
- Coverability in 2-VASS with One Unary Counter is in NPFilip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki. 196-217 [doi]
- On History-Deterministic One-Counter NetsAditya Prakash 0002, K. S. Thejaswini. 218-239 [doi]
- Unboundedness Problems for Machines with Reversal-Bounded CountersPascal Baumann 0001, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche. 240-264 [doi]
- Reverse Bisimilarity vs. Forward BisimilarityMarco Bernardo, Sabina Rossi. 265-284 [doi]
- Explainability of Probabilistic Bisimilarity Distances for Labelled Markov ChainsAmgad Rady, Franck van Breugel. 285-307 [doi]
- Weighted and Branching Bisimilarities from Generalized Open MapsJérémy Dubut, Thorsten Wißmann. 308-327 [doi]
- Preservation and Reflection of Bisimilarity via Invertible StepsRuben Turkenburg, Clemens Kupke, Jurriaan Rot, Ezra Schoen. 328-348 [doi]
- Quantitative Safety and LivenessThomas A. Henzinger, Nicolas Mazzocchi, N. Ege Saraç. 349-370 [doi]
- On the Comparison of Discounted-Sum Automata with Multiple Discount FactorsUdi Boker, Guy Hefetz. 371-391 [doi]
- Fast Matching of Regular Patterns with Synchronizing CountingLukás Holík, Juraj Síc, Lenka Turonová, Tomás Vojnar. 392-412 [doi]
- Compositional Learning for Interleaving Parallel AutomataFaezeh Labbaf, Jan Friso Groote, Hossein Hojjat, Mohammad Reza Mousavi 0001. 413-435 [doi]
- Pebble minimization: the last theoremsGaëtan Douéneau-Tabot. 436-455 [doi]
- Fixed Points and Noetherian TopologiesAliaume Lopez. 456-476 [doi]
- An Efficient Cyclic Entailment Procedure in a Fragment of Separation LogicQuang Loc Le, Xuan-Bach D. Le. 477-497 [doi]
- Just TestingRob van Glabbeek. 498-519 [doi]
- Model and Program Repair via Group ActionsPaul C. Attie, William Cocke. 520-540 [doi]
- Subgame Optimal Strategies in Finite Concurrent Games with Prefix-Independent ObjectivesBenjamin Bordais, Patricia Bouyer, Stéphane Le Roux 0001. 541-560 [doi]