HIGHLIGHTS26: HIGHLIGHTS 2026

This page contains an index consisting of author-provided keywords.

A
acceptance games	Tree Automata Acceptance up to Measurable Defect
Active learning	Scalable Learning of One-Counter Automata via State-Merging Algorithms
Active learning of automata	Formalism and Learning of Visibly Recursive Automata
Aggregation and limit operators	Runtime Consultants
algebra	Regular Languages Out of Order: An Algebraic View of Streaming Space
Algebraic Automata Theory	Ultimately-cyclic equational systems
Algebraic Geometry	Dicey Games: Shared Sources of Randomness in Distributed Systems Polynomial Algebras of Logical Structures
Algebraic Language Theory	Languages and Recognition in a Category with Factorisation
algorithmic automata theory	A simple algorithmic framework for disambiguation of finite automata
algorithmic metatheorems	Complexity of Clique-Guarded First-Order Logic with Counting
Alternating parity automata	An Automata-Based Approach to Games with ω-Automatic Preferences
Alternation	Alternating Kleene Algebra
Ambiguity	Fine-Grained Complexity of XNFA and NFA Acceptance
Anytime Algorithms	Quantitative Analysis of Pushdown Networks
approximate integration	Foundations for Deductive Verification of Continuous Probabilistic Programs
Asymptotic Analysis	Asymptotic Hausdorff and Language Similarity
Atomic-Gliders	Cellular Automata as Language Generators: Gliders Beyond Regularity
Automata	Transformers are Inherently Succinct Regular Languages Out of Order: An Algebraic View of Streaming Space Games on Higher Dimensional Automata Distance between interval pomsets with interface Understanding Transformers through the Lens of Logic and Automata
automata on infinite trees	Computing Measures: Fixed Points Beyond Lattices
Automata theoretic properties	Formalism and Learning of Visibly Recursive Automata
Automata Theory	Reducing tree logic membership problems to automata-theoretic membership problems Tree Automata Acceptance up to Measurable Defect Languages and Recognition in a Category with Factorisation Asymptotic Hausdorff and Language Similarity
Automated Theorem Proving	Lean on Vampire Proofs
Automated verification	PETRIFY- Concurrent program analysis using Petri Nets
automaton	A Conway-universal automaton for structurally Adam-positional automata
automaton variants	Hierarchical-Alphabet Automata: Extendable Acceptors for Languages of Nested Words
B
Bayesian belief / epistemic uncertainty	Belief Entropy as a Risk Dial: Wasserstein-Robust Bellman Equations for Safe Sequential Decision Making}
Beep	Beep is all you need
Bekić's Theorem	Ultimately-cyclic equational systems
best-effort control	Best-Effort Safety Control of Multi-Mode Systems
Beyond worst-case synthesis	Sure-almost-sure Window Mean Payoff in Markov Decision Processes
bidding games	Multi-Player Discrete-Bidding Games Bidding Games with Income: Reachability in the Discrete poorman Setting Maximizing Independence in Auction-Based Scheduling via Successive Refinement
Bisimilarity	Ultimately-cyclic equational systems
bisimulation distance	Tree Automata Acceptance up to Measurable Defect
Bitsize Bound	Revisiting Finiteness of Matrix Monoids
bounded treewidth	Bounded treewidth, multiple context-free grammars, and downward closures
boundedness problem	Exploring VASS Parameterised by Geometric Dimension
Branching vector addition system	Reachability in Branching Vector Addition Systems
Büchi automata	History-deterministic Büchi automata are succinct
Büchi–Landweber theorem	A Parameterized Büchi-Landweber Theorem
C
canonical automata	Layered automata: A canonical model for automata over infinite words
Carathéodory bounds	Extending VASS with Additional Integer Counters
Categorical Semantics	The Magmoid of Normalized Stochastic Kernels Register Automata in a Category
Cellular automata	Cellular Automata as Language Generators: Gliders Beyond Regularity
Church synthesis	A Parameterized Büchi-Landweber Theorem
circuit complexity	Towards a Parallel Knowledge Compilation Map
coin-flipping measure	Computing Measures: Fixed Points Beyond Lattices
Communication Complexity	Alice, Bob, and Finite Relational Structures
Completeness	Alternating Kleene Algebra
complex event recognition	Join Queries with Insertion Order: Expressiveness and Query Evaluation
Complexity	Transformers are Inherently Succinct Infinite-state games with energy objectives beyond counters The Complexity of Nested Reset Counter Systems
complexity theory	Verification of Equilibria in Probabilistic Concurrent Multiplayer Reachability Games
Compositional Verification	Back in Time: Bringing a Classical Theory of Compositional Verification to Timed Automata
Compositionality	Alice, Bob, and Finite Relational Structures
Computational Complexity	Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives
concurrency modelling	PETRIFY- Concurrent program analysis using Petri Nets
Concurrent games	Dicey Games: Shared Sources of Randomness in Distributed Systems Bidding Games with Income: Reachability in the Discrete poorman Setting Randomise Alone, Reach as a Team (CAV26 Paper)
Constant Runtime	On Deciding Constant Runtime of Linear Loops
context-free grammars	Bounded treewidth, multiple context-free grammars, and downward closures
continuous distributions	Foundations for Deductive Verification of Continuous Probabilistic Programs
controller synthesis	Best-Effort Safety Control of Multi-Mode Systems
cost register automata	Pumping Sequence Families
Counter automata	The complexity of well-matched regularity for visibly pushdown languages
counter machines	Extending VASS with Additional Integer Counters
Counter systems	The Complexity of Nested Reset Counter Systems
Coverability	Beep is all you need
coverability problem	Exploring VASS Parameterised by Geometric Dimension
Current-State Estimation	Scalable Current-State Estimation of Discrete-Timed Automata
D
data	Integer reachability in data VASS
data VASS	Integer reachability in data VASS
Decidability	Infinite-state games with energy objectives beyond counters On Deciding Constant Runtime of Linear Loops Kannan and Lipton meet Schanuel On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic
decision procedures	Deciding Separation Logic with Inductive Definitions via Translation to SMT
Decomposition	Decomposition of Automata recognizing Ideals
decoupled planning	Maximizing Independence in Auction-Based Scheduling via Successive Refinement
deductive program verification	Foundations for Deductive Verification of Continuous Probabilistic Programs
Deep Neural Networks	Runtime Monitoring of DNNs via Randomised Smoothing
degree of ambiguity	A simple algorithmic framework for disambiguation of finite automata
Descriptive set theory	Automata for MSO over Infinite Trees with Quantification over Borel Sets of Branches
determinacy	Multi-Player Discrete-Bidding Games
determinization	A simple algorithmic framework for disambiguation of finite automata
Diophantine equations	On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic
disambiguation	A simple algorithmic framework for disambiguation of finite automata
Discrete bidding games	Bidding Games with Income: Reachability in the Discrete poorman Setting
Discrete-Timed Automata	Scalable Current-State Estimation of Discrete-Timed Automata
Distance bwetween words	Distance between interval pomsets with interface
Distributed computing	Beep is all you need
distributionally robust MDPs	Belief Entropy as a Risk Dial: Wasserstein-Robust Bellman Equations for Safe Sequential Decision Making}
distributive laws	The Magmoid of Normalized Stochastic Kernels
distributive monoidal categories	Program Logics via Distributive Monoidal Categories
downward closures	Bounded treewidth, multiple context-free grammars, and downward closures
Downward-closure	The complexity of downward closures of indexed languages
DP-completeness	Hamming distance between finite transducers
Dynamic programming	Don't Start From Zero: Optimizing Value Iteration in MDPs After Action Removal
E
Edit Distance	Edit Distance of Finite-Valued Transducers Asymptotic Hausdorff and Language Similarity
energy games	Infinite-state games with energy objectives beyond counters
entropic value-at-risk	Belief Entropy as a Risk Dial: Wasserstein-Robust Bellman Equations for Safe Sequential Decision Making}
enumeration	Complexity of Clique-Guarded First-Order Logic with Counting
equational theory	Towards an Equational Theory for String-to-String Regular Functions
equivalence problem	Towards an Equational Theory for String-to-String Regular Functions
equivariant ideal	Polynomial Algebras of Logical Structures
Ergodic Theory	Preservation Theorems for Transducer Outputs
Exponential Polynomial	Kannan and Lipton meet Schanuel
exponential space	Exploring VASS Parameterised by Geometric Dimension
Expressive power	Order-invariant cluster first-order logic on graph classes of bounded degree
Expressivity	Transformers are Inherently Succinct
F
Fast-growing hierarchy	The Complexity of Nested Reset Counter Systems
Fibrations	Languages and Recognition in a Category with Factorisation
Fine-grained complexity	Fine-Grained Complexity of XNFA and NFA Acceptance
Finitary objectives	Sure-almost-sure Window Mean Payoff in Markov Decision Processes
finite automata	String Solving with Stabilization and Transducers
Finite memory determinacy	Automata for MSO over Infinite Trees with Quantification over Borel Sets of Branches
Finite Model Theory	Alice, Bob, and Finite Relational Structures
finite presentations	Symbolic omega-automata with obligations
Finite state automata	Decomposition of Automata recognizing Ideals
Finite state transducers	Edit Distance of Finite-Valued Transducers
finite transducers	String Solving with Stabilization and Transducers
Finite-valued	Edit Distance of Finite-Valued Transducers
Finiteness	Revisiting Finiteness of Matrix Monoids
First-order logic	Population Protocols over Ordered Agents Order-invariant cluster first-order logic on graph classes of bounded degree Alice, Bob, and Finite Relational Structures
first-order logic with counting	Complexity of Clique-Guarded First-Order Logic with Counting
Formal language theory	Cellular Automata as Language Generators: Gliders Beyond Regularity
formal languages	Hierarchical-Alphabet Automata: Extendable Acceptors for Languages of Nested Words Asymptotic Hausdorff and Language Similarity
Formal Methods	Stopping Criterion for Strategy Improvement on Concurrent Stochastic Games Runtime Monitoring of DNNs via Randomised Smoothing
formal power series	Non-negative residual functions
foundations of probabilistic systems and games verification	Stopping Criterion for Strategy Improvement on Concurrent Stochastic Games
functional equivalence	Reasoning about Parameterized Quantum Circuits using Tree Automata
G
game quantifiers	A Parameterized Büchi-Landweber Theorem
game theory	Verification of Equilibria in Probabilistic Concurrent Multiplayer Reachability Games
Games	Games on Higher Dimensional Automata
games on graphs	Infinite-state games with energy objectives beyond counters Memory requirements of omega-regular objectives: from deterministic to stochastic games Lasso games
Games played on graphs	An Automata-Based Approach to Games with ω-Automatic Preferences
geometric dimension	Exploring VASS Parameterised by Geometric Dimension
graph dimension	Complexity of Clique-Guarded First-Order Logic with Counting
Graph games	Bidding Games with Income: Reachability in the Discrete poorman Setting Playing Against a Partially-Known Opponent
group action	Polynomial Algebras of Logical Structures
guarded command language	Program Logics via Distributive Monoidal Categories
H
Hamming distance	Hamming distance between finite transducers
Hausdorff Distance	Asymptotic Hausdorff and Language Similarity
hereditary graph classes	Hereditary 2-WQO Graph Classes Have Bounded Clique-Width
Higher Diemsnion Automata	Distance between interval pomsets with interface
Higher Dimensional Automata	Games on Higher Dimensional Automata
Higher-order pushdown automata	The complexity of downward closures of indexed languages
history determinism	Layered automata: A canonical model for automata over infinite words History-deterministic Büchi automata are succinct
Hoare logic	Program Logics via Distributive Monoidal Categories
hybrid systems	Best-Effort Safety Control of Multi-Mode Systems
Hyper-rectangle	Parallel Abstract Interpretation for Polynomial Programs with Range Bound Assertions
hyperproperties	Tractable Hyperproperties for MDPs
I
index problem	Extending MSO with index quantifiers
Inductive invariants	Reachability in Branching Vector Addition Systems
infinite games	A Parameterized Büchi-Landweber Theorem
Infinite state automata	Reachability in Branching Vector Addition Systems
Infinite Trees	Ultimately-cyclic equational systems
infinite-state systems	Symbolic omega-automata with obligations
Infinite-state-systems	The complexity of downward closures of indexed languages
integer reachability	Integer reachability in data VASS
Interactive Theorem Proving	Lean on Vampire Proofs
interpolation	Interpolants in Modal Logic with Nominals
Interpretation	From Sets to Points: Simplifying MSO Interpretations via Reparameterizations
Invariant First-order logic	Order-invariant cluster first-order logic on graph classes of bounded degree
Invariants	Parallel Abstract Interpretation for Polynomial Programs with Range Bound Assertions Expectation Bounds and Termination for Programs with Unbounded Updates
J
join queries with insertion order	Join Queries with Insertion Order: Expressiveness and Query Evaluation
K
key1	TBA - Part 1 TBA - Part 2 TBA - Part 1 TBA - Part 2 N/A N/A N/A
key2	TBA - Part 1 TBA - Part 2 TBA - Part 1 TBA - Part 2 N/A N/A N/A
key3	TBA - Part 1 TBA - Part 2 TBA - Part 1 TBA - Part 2 N/A N/A N/A
Kleene Algebra	Alternating Kleene Algebra
knowledge compilation	Towards a Parallel Knowledge Compilation Map
Krohn-Rhodes Theorem	Preservation Theorems for Transducer Outputs
L
Lagrangians	Lagrangian-Based Duality for Quantified SMT Algorithms
Language generators	Cellular Automata as Language Generators: Gliders Beyond Regularity
Language Similarity	Asymptotic Hausdorff and Language Similarity
Lean	Lean on Vampire Proofs
linear dynamical systems	On the Subspace Orbit Problem and the Simultaneous Skolem Problem
Linear Loops	On Deciding Constant Runtime of Linear Loops
Linear Recurrence Sequence	Kannan and Lipton meet Schanuel
linear recurrence sequences	On the Subspace Orbit Problem and the Simultaneous Skolem Problem
linear recursive sequences	Non-negative residual functions
list functions	Towards an Equational Theory for String-to-String Regular Functions
locally bounded expansion	Complexity of Clique-Guarded First-Order Logic with Counting
logic	Randomise Alone, Reach as a Team (CAV26 Paper) Understanding Transformers through the Lens of Logic and Automata
Logics	Representations: a general theory
Loop invariants	Algebraic and algorithmic methods for computing polynomial loop invariants
lower bound techniques	Extending VASS with Additional Integer Counters
LTL	Transformers are Inherently Succinct
LTL-Synthesis	Strategy Repair on Parity Games using Semantic Information and Machine Learning
M
Machine Learning	Runtime Monitoring of DNNs via Randomised Smoothing
Markov categories	The Magmoid of Normalized Stochastic Kernels
Markov decision processes	Tractable Hyperproperties for MDPs Sure-almost-sure Window Mean Payoff in Markov Decision Processes
Markov Decision Processes (MDP)	Don't Start From Zero: Optimizing Value Iteration in MDPs After Action Removal
Markov Processes	Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives
martingales	Expectation Bounds and Termination for Programs with Unbounded Updates
Matrix Semigroups	Revisiting Finiteness of Matrix Monoids
mean-payoff games	Lasso games
Membership	Revisiting Finiteness of Matrix Monoids
Membership problems	Reducing tree logic membership problems to automata-theoretic membership problems
memory	Lasso games
Memory requirements	Memory requirements of omega-regular objectives: from deterministic to stochastic games
Metric Spaces	Asymptotic Hausdorff and Language Similarity
ML in Formal Methods	Strategy Repair on Parity Games using Semantic Information and Machine Learning
modal logic	Interpolants in Modal Logic with Nominals
model checking	Tractable Hyperproperties for MDPs Stopping Criterion for Strategy Improvement on Concurrent Stochastic Games Back in Time: Bringing a Classical Theory of Compositional Verification to Timed Automata Distance between interval pomsets with interface Randomise Alone, Reach as a Team (CAV26 Paper) PETRIFY- Concurrent program analysis using Petri Nets
model representation	Verification of Equilibria in Probabilistic Concurrent Multiplayer Reachability Games
Modular model of computation	Formalism and Learning of Visibly Recursive Automata
Modular Synthesis	Decoupled Planning for Multiple Omega-Regular Objectives
moments	Expectation Bounds and Termination for Programs with Unbounded Updates
monadic second-order logic	Extending MSO with index quantifiers A Parameterized Büchi-Landweber Theorem
Moore Automaton	Van der Put Coefficients and Automata
Morphic Words	Preservation Theorems for Transducer Outputs
MSO	From Sets to Points: Simplifying MSO Interpretations via Reparameterizations
Mu-calculus	Computing Measures: Fixed Points Beyond Lattices
multi-player games	Multi-Player Discrete-Bidding Games
Multi-sequential	Edit Distance of Finite-Valued Transducers
multiagent system	Verification of Equilibria in Probabilistic Concurrent Multiplayer Reachability Games
multiplayer game	Verification of Equilibria in Probabilistic Concurrent Multiplayer Reachability Games
N
Nash equilibrium	An Automata-Based Approach to Games with ω-Automatic Preferences
nested words	Hierarchical-Alphabet Automata: Extendable Acceptors for Languages of Nested Words
Networks	Quantitative Analysis of Pushdown Networks
NL-completeness	Hamming distance between finite transducers
Nominal Automata	Register Automata in a Category
non zero sum games	Multi-Player Discrete-Bidding Games
nowhere dense	Complexity of Clique-Guarded First-Order Logic with Counting
Number theory	Kannan and Lipton meet Schanuel
O
oligomorphic	Polynomial Algebras of Logical Structures
Omega automata	Layered automata: A canonical model for automata over infinite words
omega-automata	Symbolic omega-automata with obligations
omega-regular	Decoupled Planning for Multiple Omega-Regular Objectives
omega-regular properties	Runtime Consultants
One-counter automata	Scalable Learning of One-Counter Automata via State-Merging Algorithms
online learning	Maximizing Independence in Auction-Based Scheduling via Successive Refinement
Opacity	Opacity problems in multi-energy timed automata
Optimal strategies	Memory requirements of omega-regular objectives: from deterministic to stochastic games
Orbit Problem	On the Subspace Orbit Problem and the Simultaneous Skolem Problem Kannan and Lipton meet Schanuel
orbit-finite sets	Integer reachability in data VASS
Order invariant FO	Order-invariant cluster first-order logic on graph classes of bounded degree
P
PAC learning	Complexity of Clique-Guarded First-Order Logic with Counting
Parallel abstract interpretation	Parallel Abstract Interpretation for Polynomial Programs with Range Bound Assertions
parallel complexity	Towards a Parallel Knowledge Compilation Map
parameterized verification	Reasoning about Parameterized Quantum Circuits using Tree Automata
Parametrized systems	Cellular Automata as Language Generators: Gliders Beyond Regularity
Parikh image	Integer reachability in data VASS
parity automata	Extending MSO with index quantifiers
parity games	Strategy Repair on Parity Games using Semantic Information and Machine Learning Playing Against a Partially-Known Opponent Lasso games
Parity objectives	Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives
partial-information games	Playing Against a Partially-Known Opponent
partially observable stochastic games	Belief Entropy as a Risk Dial: Wasserstein-Robust Bellman Equations for Safe Sequential Decision Making}
Partially-ordered automata	Population Protocols over Ordered Agents
Partical Observation	Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives
Passive learning	Scalable Learning of One-Counter Automata via State-Merging Algorithms
Petri nets	Integer reachability in data VASS
Planning	Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives
Polynomial ideals	Algebraic and algorithmic methods for computing polynomial loop invariants Non-negative residual functions
Polynomial programs	Parallel Abstract Interpretation for Polynomial Programs with Range Bound Assertions
Population protocols	Population Protocols over Ordered Agents
positional language	A Conway-universal automaton for structurally Adam-positional automata
Powerset domain	Parallel Abstract Interpretation for Polynomial Programs with Range Bound Assertions
Predictive analysis	Runtime Consultants
Presburger arithmetic	On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic
primal-dual	Lagrangian-Based Duality for Quantified SMT Algorithms
probabilistic inference	The Magmoid of Normalized Stochastic Kernels
probabilistic programs	Foundations for Deductive Verification of Continuous Probabilistic Programs
probabilistic system	Verification of Equilibria in Probabilistic Concurrent Multiplayer Reachability Games
probabilistic verification	Expectation Bounds and Termination for Programs with Unbounded Updates
probability	Computing Measures: Fixed Points Beyond Lattices
program logics	Program Logics via Distributive Monoidal Categories
Program Repair	Asymptotic Hausdorff and Language Similarity
Program Verification	On Deciding Constant Runtime of Linear Loops Expectation Bounds and Termination for Programs with Unbounded Updates
Proof Checking	Lean on Vampire Proofs
Proof Systems	Alternating Kleene Algebra
pumping	Pumping Sequence Families
pumping sequence family	Pumping Sequence Families
Pushdown Systems	Quantitative Analysis of Pushdown Networks
Q
quantified SMT	Lagrangian-Based Duality for Quantified SMT Algorithms
quantifier elimination	Extending MSO with index quantifiers
quantitative loop invariants	Foundations for Deductive Verification of Continuous Probabilistic Programs
Quantitative monitoring	Efficiently computable temporal robustness for a practical STL fragment
Quantitative Verification	Quantitative Analysis of Pushdown Networks
quantum circuit	Reasoning about Parameterized Quantum Circuits using Tree Automata
R
Randomised Smoothing	Runtime Monitoring of DNNs via Randomised Smoothing
Rational relations	Edit Distance of Finite-Valued Transducers
Rational synthesis	An Automata-Based Approach to Games with ω-Automatic Preferences
reachability	Verification of Equilibria in Probabilistic Concurrent Multiplayer Reachability Games Extending VASS with Additional Integer Counters Integer reachability in data VASS Reachability in Branching Vector Addition Systems
Reachability games	Bidding Games with Income: Reachability in the Discrete poorman Setting
Real-time systems	Efficiently computable temporal robustness for a practical STL fragment
Recursive Equation Systems	Ultimately-cyclic equational systems
refinement	Maximizing Independence in Auction-Based Scheduling via Successive Refinement
register automata	Register Automata in a Category Integer reachability in data VASS
Regular Expressions	Alternating Kleene Algebra
regular functions	Towards an Equational Theory for String-to-String Regular Functions
Regular languages	Regular Languages Out of Order: An Algebraic View of Streaming Space The complexity of well-matched regularity for visibly pushdown languages
Regular model checking	Cellular Automata as Language Generators: Gliders Beyond Regularity
Reinforcement Learning	Follow the STARs: Dynamic ω-Regular Shielding of Learned Probabilistic Policies
Relation algebra	Representations: a general theory
Reparameterization	From Sets to Points: Simplifying MSO Interpretations via Reparameterizations
replaceAll operations	String Solving with Stabilization and Transducers
ring theory	Polynomial Algebras of Logical Structures
risk-sensitive decision making	Belief Entropy as a Risk Dial: Wasserstein-Robust Bellman Equations for Safe Sequential Decision Making}
robust Bellman equation	Belief Entropy as a Risk Dial: Wasserstein-Robust Bellman Equations for Safe Sequential Decision Making}
RPNI	Scalable Learning of One-Counter Automata via State-Merging Algorithms
Run-time monitoring	Follow the STARs: Dynamic ω-Regular Shielding of Learned Probabilistic Policies
Runtime Composition	Decoupled Planning for Multiple Omega-Regular Objectives
Runtime monitoring	Runtime Consultants Runtime Monitoring of DNNs via Randomised Smoothing
Runtime verification	Runtime Consultants
S
safe reinforcement learning	Belief Entropy as a Risk Dial: Wasserstein-Robust Bellman Equations for Safe Sequential Decision Making}
safety games	Best-Effort Safety Control of Multi-Mode Systems
Schanuel conjecture	Kannan and Lipton meet Schanuel
Security properties	Opacity problems in multi-energy timed automata
Semantic labelling	Strategy Repair on Parity Games using Semantic Information and Machine Learning
Semantics	Representations: a general theory
separation	Interpolants in Modal Logic with Nominals
separation logic	Deciding Separation Logic with Inductive Definitions via Translation to SMT
Shared randomness	Dicey Games: Shared Sources of Randomness in Distributed Systems
Shielding	Follow the STARs: Dynamic ω-Regular Shielding of Learned Probabilistic Policies
Shuffle ideals	Decomposition of Automata recognizing Ideals
Signal temporal logic	Efficiently computable temporal robustness for a practical STL fragment
Skolem problem	On the Subspace Orbit Problem and the Simultaneous Skolem Problem Kannan and Lipton meet Schanuel
SMT	String Solving with Stabilization and Transducers Deciding Separation Logic with Inductive Definitions via Translation to SMT
SMT solving	Foundations for Deductive Verification of Continuous Probabilistic Programs
space complexity	Regular Languages Out of Order: An Algebraic View of Streaming Space
stabilization	String Solving with Stabilization and Transducers
Stochastic games	Memory requirements of omega-regular objectives: from deterministic to stochastic games
Strategy complexity	Memory requirements of omega-regular objectives: from deterministic to stochastic games
Strategy repair	Strategy Repair on Parity Games using Semantic Information and Machine Learning
strategy synthesis	A Parameterized Büchi-Landweber Theorem
Strategy Templates	Follow the STARs: Dynamic ω-Regular Shielding of Learned Probabilistic Policies
streaming	Regular Languages Out of Order: An Algebraic View of Streaming Space
streams	Join Queries with Insertion Order: Expressiveness and Query Evaluation
string solving	String Solving with Stabilization and Transducers
string transductions	Towards an Equational Theory for String-to-String Regular Functions
structural graph theory	Hereditary 2-WQO Graph Classes Have Bounded Clique-Width
succinctness	History-deterministic Büchi automata are succinct
Sure-almost-sure satisfaction	Sure-almost-sure Window Mean Payoff in Markov Decision Processes
Symbolic algebraic computations	Algebraic and algorithmic methods for computing polynomial loop invariants
Symbolic dynamics	Cellular Automata as Language Generators: Gliders Beyond Regularity
Syntactic Objects	Languages and Recognition in a Category with Factorisation
Synthesis	Randomise Alone, Reach as a Team (CAV26 Paper)
System analysis and verification	Representations: a general theory
T
T-nets	Integer reachability in data VASS
temporal logic	Tractable Hyperproperties for MDPs
Threshold problem	An Automata-Based Approach to Games with ω-Automatic Preferences
Timed Automata	(In)aproximability of weighted timed games Scalable Current-State Estimation of Discrete-Timed Automata Back in Time: Bringing a Classical Theory of Compositional Verification to Timed Automata
Timed logics	Efficiently computable temporal robustness for a practical STL fragment
Timed systems	Opacity problems in multi-energy timed automata
Topology	Dicey Games: Shared Sources of Randomness in Distributed Systems
Transducers	Preservation Theorems for Transducer Outputs Hamming distance between finite transducers Van der Put Coefficients and Automata
Transformers	Transformers are Inherently Succinct Understanding Transformers through the Lens of Logic and Automata
Tree automata	Automata for MSO over Infinite Trees with Quantification over Borel Sets of Branches
Tree languages	Reducing tree logic membership problems to automata-theoretic membership problems
Tree logics	Reducing tree logic membership problems to automata-theoretic membership problems
U
unambiguous automata models	A simple algorithmic framework for disambiguation of finite automata
Unambiguous star-free languages	Population Protocols over Ordered Agents
universal automaton	A Conway-universal automaton for structurally Adam-positional automata
V
valence systems	Infinite-state games with energy objectives beyond counters
Value approximability	(In)aproximability of weighted timed games
Value iteration	Don't Start From Zero: Optimizing Value Iteration in MDPs After Action Removal
Value reuse / value transfer	Don't Start From Zero: Optimizing Value Iteration in MDPs After Action Removal
Vampire	Lean on Vampire Proofs
Van der Put Series	Van der Put Coefficients and Automata
VASS	Infinite-state games with energy objectives beyond counters Integer reachability in data VASS
VC dimension	Complexity of Clique-Guarded First-Order Logic with Counting
vector addition systems	Extending VASS with Additional Integer Counters Exploring VASS Parameterised by Geometric Dimension
Verification	Opacity problems in multi-energy timed automata Beep is all you need Verification of Equilibria in Probabilistic Concurrent Multiplayer Reachability Games On the Subspace Orbit Problem and the Simultaneous Skolem Problem The complexity of downward closures of indexed languages Tractable Hyperproperties for MDPs
Visibly pushdown automata	The complexity of well-matched regularity for visibly pushdown languages
Visibly pushdown languages	Formalism and Learning of Visibly Recursive Automata
W
Wasserstein ambiguity sets	Belief Entropy as a Risk Dial: Wasserstein-Robust Bellman Equations for Safe Sequential Decision Making}
weakest preexpectations	Foundations for Deductive Verification of Continuous Probabilistic Programs
weighted automata	A simple algorithmic framework for disambiguation of finite automata Non-negative residual functions Pumping Sequence Families
Weighted timed games	(In)aproximability of weighted timed games
weighted tree transducers	Reasoning about Parameterized Quantum Circuits using Tree Automata
well-quasi orders	Hereditary 2-WQO Graph Classes Have Bounded Clique-Width
Window mean payoff	Sure-almost-sure Window Mean Payoff in Markov Decision Processes
Word Combinatorics	Preservation Theorems for Transducer Outputs
X
XNFA	Fine-Grained Complexity of XNFA and NFA Acceptance
Z
Z3-Noodler	String Solving with Stabilization and Transducers
Zero-sum games	An Automata-Based Approach to Games with ω-Automatic Preferences
ω
ω-automatic relations	An Automata-Based Approach to Games with ω-Automatic Preferences
ω-regular games	Follow the STARs: Dynamic ω-Regular Shielding of Learned Probabilistic Policies

Disclaimer | Powered by EasyChair Smart Program