The power of polymorphisms: the triangle of universal algebra, model theory, and theoretical computer science - Part 1 (abstract)

The power of polymorphisms: the triangle of universal algebra, model theory, and theoretical computer science - Part 2 (abstract)

A Categorical Approach to Automata Learning and Minimization - Part 1 (abstract)

A Categorical Approach to Automata Learning and Minimization - Part 2 (abstract)

Whose Dice Is It Anyway? (abstract)

Automata for MSO over Infinite Trees with Quantification over Borel Sets of Branches (abstract)

Layered automata: A canonical model for automata over infinite words (abstract)

History-deterministic Büchi automata are succinct (abstract)

Computing Measures: Fixed Points Beyond Lattices (abstract)

A simple algorithmic framework for disambiguation of finite automata (abstract)

Decomposition of Automata recognizing Ideals (abstract)

Asymptotic Hausdorff and Language Similarity (abstract)

Hierarchical-Alphabet Automata: Extendable Acceptors for Languages of Nested Words (abstract)

Dicey Games: Shared Sources of Randomness in Distributed Systems (abstract)

Verification of Equilibria in Probabilistic Concurrent Multiplayer Reachability Games (abstract)

Don't Start From Zero: Optimizing Value Iteration in MDPs After Action Removal (abstract)

Tractable Hyperproperties for MDPs (abstract)

Sure-almost-sure Window Mean Payoff in Markov Decision Processes (online) (abstract)

Stopping Criterion for Strategy Improvement on Concurrent Stochastic Games (abstract)

Randomise Alone, Reach as a Team (CAV26 Paper) (abstract)

Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives (abstract)

Representations: a general theory (abstract)

Program Logics via Distributive Monoidal Categories (abstract)

The Magmoid of Normalized Stochastic Kernels (abstract)

Languages and Recognition in a Category with Factorisation (abstract)

Polynomial Algebras of Logical Structures (abstract)

Register Automata in a Category (abstract)

Alternating Kleene Algebra (abstract)

Opacity problems in multi-energy timed automata (abstract)

Best-Effort Safety Control of Multi-Mode Systems (abstract)

(In)aproximability of weighted timed games (abstract)

Scalable Current-State Estimation of Discrete-Timed Automata (abstract)

Back in Time: Bringing a Classical Theory of Compositional Verification to Timed Automata (abstract)

Zero-knowledge Model Checking (abstract)

From Sets to Points: Simplifying MSO Interpretations via Reparameterizations (abstract)

Extending MSO with index quantifiers (abstract)

Hereditary 2-WQO Graph Classes Have Bounded Clique-Width (abstract)

Complexity of Clique-Guarded First-Order Logic with Counting (abstract)

On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic (abstract)

Alice, Bob, and Finite Relational Structures (abstract)

Join Queries with Insertion Order: Expressiveness and Query Evaluation (abstract)

The complexity of downward closures of indexed languages (abstract)

The Complexity of Nested Reset Counter Systems (abstract)

The complexity of well-matched regularity for visibly pushdown languages (abstract)

Quantitative Analysis of Pushdown Networks (abstract)

Bounded treewidth, multiple context-free grammars, and downward closures (abstract)

Extending VASS with Additional Integer Counters (abstract)

Exploring VASS Parameterised by Geometric Dimension (abstract)

Integer reachability in data VASS (abstract)

Reachability in Branching Vector Addition Systems (abstract)

Revisiting Finiteness of Matrix Monoids (abstract)

First-order definability of regular tree languages

Multiplicity equivalence of context-free grammars (abstract)

PTIME algorithm for parity games

Type 2 uncomputability, polynomial functors and automata (abstract)

Preservation Theorems for Transducer Outputs (abstract)

Hamming distance between finite transducers (abstract)

Towards an Equational Theory for String-to-String Regular Functions (abstract)

Reducing tree logic membership problems to automata-theoretic membership problems (abstract)

Tree Automata Acceptance up to Measurable Defect (abstract)

Ultimately-cyclic equational systems (abstract)

Edit Distance of Finite-Valued Transducers (online) (abstract)

String Solving with Stabilization and Transducers (abstract)

Lasso games (abstract)

Deciding ergodicity of functional transducers (abstract)

On the Subspace Orbit Problem and the Simultaneous Skolem Problem (abstract)

Kannan and Lipton meet Schanuel (abstract)

Non-negative residual functions (online) (abstract)

Pumping Sequence Families (abstract)

Fine-Grained Complexity of XNFA and NFA Acceptance (abstract)

On Deciding Constant Runtime of Linear Loops (abstract)

Algebraic and algorithmic methods for computing polynomial loop invariants (abstract)

Foundations for Deductive Verification of Continuous Probabilistic Programs (abstract)

Parallel Abstract Interpretation for Polynomial Programs with Range Bound Assertions (abstract)

Invariants and Expectation Bounds for Probabilistic Programs with Unbounded Updates (abstract)

Transformers are Inherently Succinct (abstract)

Formalism and Learning of Visibly Recursive Automata (abstract)

Follow the STARs: Dynamic ω-Regular Shielding of Learned Probabilistic Policies (abstract)

Strategy Repair on Parity Games using Semantic Information and Machine Learning (abstract)

Beep is all you need (abstract)

Population Protocols over Ordered Agents (abstract)

Scalable Learning of One-Counter Automata via State-Merging Algorithms (online) (abstract)

Multi-Player Discrete-Bidding Games (abstract)

Bidding Games with Rewards: Taming Infinite Configuration Space (abstract)

Maximizing Independence in Auction-Based Scheduling via Successive Refinement (abstract)

Playing Against a Partially-Known Opponent (abstract)

Cellular Automata as Language Generators: Gliders Beyond Regularity (abstract)

Towards a Parallel Knowledge Compilation Map (abstract)

Belief Entropy as a Risk Dial: Wasserstein-Robust Bellman Equations for Safe Sequential Decision Making} (abstract)

Runtime Monitoring of DNNs via Randomised Smoothing (abstract)

Understanding Transformers through the Lens of Logic and Automata (abstract)

Infinite-state games with energy objectives beyond counters (abstract)

An Automata-Based Approach to Games with ω-Automatic Preferences (abstract)

Decoupled Planning for Multiple Omega-Regular Objectives (abstract)

A Conway-universal automaton for structurally Adam-positional automata (abstract)

Memory requirements of omega-regular objectives: from deterministic to stochastic games (abstract)

A Parameterized Büchi-Landweber Theorem (abstract)

Games on Higher Dimensional Automata (abstract)

Distance between interval pomsets with interface (abstract)

Runtime Consultants (abstract)

Symbolic omega-automata with obligations (abstract)

Lagrangian-Based Duality for Quantified SMT Algorithms (abstract)

Lean on Vampire Proofs (abstract)

Deciding Separation Logic with Inductive Definitions via Translation to SMT (abstract)

PETRIFY- Concurrent program analysis using Petri Nets (abstract)

Efficiently computable temporal robustness for a practical STL fragment (abstract)