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 SLIDES

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

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

Katzper Michno

11:06-11:18

Reducing tree logic membership problems to automata-theoretic membership problems

Angelo Matteo

11:18-11:30

Tree Automata Acceptance up to Measurable Defect

Anita Moyasari Amnieh

11:30-11:42

Ultimately-cyclic equational systems

Jean Zablocki

11:42-11:54

Edit Distance of Finite-Valued Transducers (online)

Saina Sunny

11:54-12:06

String Solving with Stabilization and Transducers

David Chocholatý

12:06-12:18

Krzysztof Żyndul

12:18-12:30

Deciding ergodicity of functional transducers

Marie Coutereel Sleghem

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

Non-negative residual functions (online)

Arka Ghosh

11:06-11:18

Pumping Sequence Families

Antoni Puch

11:18-11:30

Fine-Grained Complexity of XNFA and NFA Acceptance

Neha Rino

11:30-11:42

On Deciding Constant Runtime of Linear Loops

Nils Lommen

11:42-11:54

Algebraic and algorithmic methods for computing polynomial loop invariants

Erdenebayar Bayarmagnai

11:54-12:06

Foundations for Deductive Verification of Continuous Probabilistic Programs

Francesca Randone

12:06-12:18

Parallel Abstract Interpretation for Polynomial Programs with Range Bound Assertions

Harshit Jitendra Motwani

12:18-12:30

Invariants and Expectation Bounds for Probabilistic Programs with Unbounded Updates

Lorenz Winkler

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

Satya Prakash Nayak

15:06-15:18

Strategy Repair on Parity Games using Semantic Information and Machine Learning

Tereza Kinská

15:18-15:30

Beep is all you need

Lucie Guillou

15:30-15:42

Population Protocols over Ordered Agents

Michaël Cadilhac

15:42-15:54

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

Prince Mathew

14:30-14:42

Multi-Player Discrete-Bidding Games

Fatima Murra

14:42-14:54

Bidding Games with Rewards: Taming Infinite Configuration Space

Matan Pinkas

14:54-15:06

Maximizing Independence in Auction-Based Scheduling via Successive Refinement

Guy Avni

15:06-15:18

Playing Against a Partially-Known Opponent

Eden Asta

15:18-15:30

Cellular Automata as Language Generators: Gliders Beyond Regularity

Noa Izsak

15:30-15:42

Towards a Parallel Knowledge Compilation Map

Steef Hegeman

15:42-15:54

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

Deep Kumar Ganguly

15:54-16:06

Runtime Monitoring of DNNs via Randomised Smoothing

Diganta Mukhopadhyay

16:00-16:30 Coffee Break

Disclaimer | Powered by EasyChair Smart Program