HIGHLIGHTS26: HIGHLIGHTS 2026

A
Anand, Ashwani	Follow the STARs: Dynamic ω-Regular Shielding of Learned Probabilistic Policies
Asadi, Ali	Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives
Asta, Eden	Playing Against a Partially-Known Opponent
Avni, Guy	Maximizing Independence in Auction-Based Scheduling via Successive Refinement
B
Bacik, Piotr	Kannan and Lipton meet Schanuel
Bakiri, Lydia	Opacity problems in multi-energy timed automata
Balasubramanian, A. R.	The Complexity of Nested Reset Counter Systems
Barbé, Killian	Register Automata in a Category
Bayarmagnai, Erdenebayar	Algebraic and algorithmic methods for computing polynomial loop invariants
Bergsträßer, Pascal	Transformers are Inherently Succinct
Berry, Mathias	Decomposition of Automata recognizing Ideals
Bizière, Clotilde	Reachability in Branching Vector Addition Systems
Bocevska, Ivana	Lagrangian-Based Duality for Quantified SMT Algorithms
Bodingbauer, Jonas	Lean on Vampire Proofs
Bose, Sougata	Memory requirements of omega-regular objectives: from deterministic to stochastic games
Brice, Léonard	Dicey Games: Shared Sources of Randomness in Distributed Systems
Brunet, Paul	Representations: a general theory
C
Cadilhac, Michaël	Population Protocols over Ordered Agents
Chocholatý, David	String Solving with Stabilization and Transducers
Clement, Emily	Games on Higher Dimensional Automata
Coutereel Sleghem, Marie	Van der Put Coefficients and Automata
Cruchten, Mike	Languages and Recognition in a Category with Factorisation
Czerwiński, Wojciech	Exploring VASS Parameterised by Geometric Dimension
D
Dacík, Tomáš	Deciding Separation Logic with Inductive Definitions via Translation to SMT
Di Lavore, Elena	Program Logics via Distributive Monoidal Categories
Di Stefano, Luca	Symbolic omega-automata with obligations
Dubrulle, Kévin	Formalism and Learning of Visibly Recursive Automata
Dufour, Aloÿs	Distance between interval pomsets with interface
F
Faella, Marco	Best-Effort Safety Control of Multi-Mode Systems
Fisman, Dana	Asymptotic Hausdorff and Language Similarity
Foughali, Mohammed	Efficiently computable temporal robustness for a practical STL fragment
G
Gaba, Pranshu	Sure-almost-sure Window Mean Payoff in Markov Decision Processes
Ganguly, Deep Kumar	Belief Entropy as a Risk Dial: Wasserstein-Robust Bellman Equations for Safe Sequential Decision Making}
Ghasemi, Fatemeh	Order-invariant cluster first-order logic on graph classes of bounded degree
Ghosh, Arka	Non-negative residual functions
Giacobbe, Mirco	N/A
Grandmont, Christophe	An Automata-Based Approach to Games with ω-Automatic Preferences
Grobelna, Marta	Stopping Criterion for Strategy Improvement on Concurrent Stochastic Games
Guillou, Lucie	Beep is all you need
Guttenberg, Roland	Revisiting Finiteness of Matrix Monoids
H
Hegeman, Steef	Towards a Parallel Knowledge Compilation Map
I
Idir, Olivier	A Conway-universal automaton for structurally Adam-positional automata
Izsak, Noa	Cellular Automata as Language Generators: Gliders Beyond Regularity
J
Jha, Prabhat	Alternating Kleene Algebra
K
Kamiński, Lukasz	Integer reachability in data VASS
Kinská, Tereza	Strategy Repair on Parity Games using Semantic Information and Machine Learning
Kleest-Meißner, Sarah	Join Queries with Insertion Order: Expressiveness and Query Evaluation
Klein, Julian	Scalable Current-State Estimation of Discrete-Timed Automata
Kołodziejski, Jędrzej	Interpolants in Modal Logic with Nominals
L
Labbe, Sebastien	Regular Languages Out of Order: An Algebraic View of Streaming Space
Lange, Johannes Friedrich	Complexity of Clique-Guarded First-Order Logic with Counting
Lengál, Ondřej	Reasoning about Parameterized Quantum Circuits using Tree Automata
Lin, Anthony	Understanding Transformers through the Lens of Logic and Automata
Lommen, Nils	On Deciding Constant Runtime of Linear Loops
M
Manthe, Sven	Automata for MSO over Infinite Trees with Quantification over Borel Sets of Branches
Mascle, Corto	The complexity of downward closures of indexed languages
Mathew, Prince	Scalable Learning of One-Counter Automata via State-Merging Algorithms
Matteo, Angelo	Reducing tree logic membership problems to automata-theoretic membership problems
Michno, Katzper	Towards an Equational Theory for String-to-String Regular Functions
Moeini Jam, Mehran	Back in Time: Bringing a Classical Theory of Compositional Verification to Timed Automata
Motwani, Harshit Jitendra	Parallel Abstract Interpretation for Polynomial Programs with Range Bound Assertions
Moyasari Amnieh, Anita	Tree Automata Acceptance up to Measurable Defect
Mukhopadhyay, Diganta	Runtime Monitoring of DNNs via Randomised Smoothing
Murra, Fatima	Multi-Player Discrete-Bidding Games
Muñoz, Martín	A simple algorithmic framework for disambiguation of finite automata
N
Nevatia, Dhruv	Quantitative Analysis of Pushdown Networks
Niwinski, Damian	Computing Measures: Fixed Points Beyond Lattices
P
Parys, Paweł	A Parameterized Büchi-Landweber Theorem
Petrisan, Daniela	TBA - Part 1 TBA - Part 2
Pinkas, Matan	Bidding Games with Income: Reachability in the Discrete poorman Setting
Pinsker, Michael	TBA - Part 1 TBA - Part 2
Pradic, Cécilia	N/A
Prakash, Keya	History-deterministic Büchi automata are succinct
Puch, Antoni	Pumping Sequence Families
R
Rabinovich, Alexander	From Sets to Points: Simplifying MSO Interpretations via Reparameterizations
Rajasekaran, Senthil	Verification of Equilibria in Probabilistic Concurrent Multiplayer Reachability Games
Randone, Francesca	Foundations for Deductive Verification of Continuous Probabilistic Programs
Rao, Shrisha	Don't Start From Zero: Optimizing Value Iteration in MDPs After Action Removal
Ricros, Marin	The complexity of well-matched regularity for visibly pushdown languages
Rino, Neha	Fine-Grained Complexity of XNFA and NFA Acceptance
Román, Mario	The Magmoid of Normalized Stochastic Kernels
S
Sadhukhan, Suman	Decoupled Planning for Multiple Omega-Regular Objectives
Saglam, Irmak	Infinite-state games with energy objectives beyond counters
Schuetze, Lia	Bounded treewidth, multiple context-free grammars, and downward closures
Shafiee, Ali	Randomise Alone, Reach as a Team (CAV26 Paper)
Shenoy, Akshatha	PETRIFY- Concurrent program analysis using Petri Nets
Sinclair-Banks, Henry	Extending VASS with Additional Integer Counters
Skrzypczak, Michał	Extending MSO with index quantifiers
Sudit, Elina	Runtime Consultants
Sunny, Saina	Edit Distance of Finite-Valued Transducers
T
Thejaswini, K. S.	N/A
Toruńczyk, Szymon	Hereditary 2-WQO Graph Classes Have Bounded Clique-Width
V
Vahanwala, Mihir	Preservation Theorems for Transducer Outputs
Van der Spiegel, Patrick	Hierarchical-Alphabet Automata: Extendable Acceptors for Languages of Nested Words
Varonka, Anton	On the Subspace Orbit Problem and the Simultaneous Skolem Problem
Vermeil, Matthieu	Polynomial Algebras of Logical Structures
Vescovo, Silvio	Hamming distance between finite transducers
Vialard, Isa	(In)aproximability of weighted timed games
W
Walukiewicz, Igor	Layered automata: A canonical model for automata over infinite words
Wieser, Emil Rugaard	On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic
Winkler, Lorenz	Expectation Bounds and Termination for Programs with Unbounded Updates
Winkler, Tobias	Tractable Hyperproperties for MDPs
Y
Yaghoubi, Omid	Alice, Bob, and Finite Relational Structures
Z
Zablocki, Jean	Ultimately-cyclic equational systems
Ż
Żyndul, Krzysztof	Lasso games

Disclaimer | Powered by EasyChair Smart Program