Program for Thursday, September 10th: Talk View

Organizers

HIGHLIGHTS26: HIGHLIGHTS 2026

Overview Scope OpenProblems Posters Venue Submissions Important Dates Attendance Invited Speakers Tutorials Travel Accommodation Committee CREW HESS Registration Sponsors PROGRAM AUTHORS KEYWORDS

PROGRAM FOR THURSDAY, SEPTEMBER 10TH: TALK VIEW

Days:

View: with abstracts session overview

9:00

9:30

10:00

10:30

11:00

11:30

12:00

12:30

13:00

13:30

14:00

14:30

15:00

15:30

16:00

16:30

09:00-10:00

Type 2 uncomputability, polynomial functors and automata

Cécilia Pradic

10:00-10:30 Coffee Break

10:30-10:42

Preservation Theorems for Transducer Outputs

Mihir Vahanwala

10:42-10:54

Hamming distance between finite transducers

Silvio Vescovo

10:54-11:06

String Solving with Stabilization and Transducers

David Chocholatý

11:06-11:18

Towards an Equational Theory for String-to-String Regular Functions

Katzper Michno

11:18-11:30

Reducing tree logic membership problems to automata-theoretic membership problems

Angelo Matteo

11:30-11:42

Tree Automata Acceptance up to Measurable Defect

Anita Moyasari Amnieh

11:42-11:54

Ultimately-cyclic equational systems

Jean Zablocki

11:54-12:06

Krzysztof Żyndul

12:06-12:18

Van der Put Coefficients and Automata

Marie Coutereel Sleghem

12:18-12:30

Edit Distance of Finite-Valued Transducers

Saina Sunny

10:30-10:42

On the Subspace Orbit Problem and the Simultaneous Skolem Problem

Anton Varonka

10:42-10:54

Kannan and Lipton meet Schanuel

Piotr Bacik

10:54-11:06

Fine-Grained Complexity of XNFA and NFA Acceptance

Neha Rino

11:06-11:18

Algebraic and algorithmic methods for computing polynomial loop invariants

Erdenebayar Bayarmagnai

11:18-11:30

Parallel Abstract Interpretation for Polynomial Programs with Range Bound Assertions

Harshit Jitendra Motwani

11:30-11:42

On Deciding Constant Runtime of Linear Loops

Nils Lommen

11:42-11:54

Foundations for Deductive Verification of Continuous Probabilistic Programs

Francesca Randone

11:54-12:06

Pumping Sequence Families

Antoni Puch

12:06-12:18

Revisiting Finiteness of Matrix Monoids

Roland Guttenberg

12:18-12:30

Non-negative residual functions

Arka Ghosh

12:30-14:30 Lunch Break

14:30-14:42

Transformers are Inherently Succinct

Pascal Bergsträßer

14:42-14:54

Formalism and Learning of Visibly Recursive Automata

Kévin Dubrulle

14:54-15:06

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

Ashwani Anand

15:06-15:18

Strategy Repair on Parity Games using Semantic Information and Machine Learning

Tereza Kinská

15:18-15:30

Expectation Bounds and Termination for Programs with Unbounded Updates

Lorenz Winkler

15:30-15:42

Beep is all you need

Lucie Guillou

15:42-15:54

Population Protocols over Ordered Agents

Michaël Cadilhac

15:54-16:06

Scalable Learning of One-Counter Automata via State-Merging Algorithms

Prince Mathew

14:30-14:42

Towards a Parallel Knowledge Compilation Map

Steef Hegeman

14:42-14:54

Multi-Player Discrete-Bidding Games

Fatima Murra

14:54-15:06

Bidding Games with Rewards: Taming Infinite Configuration Space

Matan Pinkas

15:06-15:18

Cellular Automata as Language Generators: Gliders Beyond Regularity

Noa Izsak

15:18-15:30

Maximizing Independence in Auction-Based Scheduling via Successive Refinement

Guy Avni

15:30-15:42

Belief Entropy as a Risk Dial: Wasserstein-Robust Bellman Equations for Safe Sequential Decision

Deep Kumar Ganguly

15:42-15:54

Runtime Monitoring of DNNs via Randomised Smoothing

Diganta Mukhopadhyay

15:54-16:06

Playing Against a Partially-Known Opponent

Eden Asta

16:00-16:30 Coffee Break

Disclaimer | Powered by EasyChair Smart Program