Program for Wednesday, September 19th: Talk View

PROGRAM FOR WEDNESDAY, SEPTEMBER 19TH: TALK VIEW

Days:

previous day

next day

all 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

17:00

17:30

18:00

18:30

19:00

19:30

20:00

09:00-10:00

Algebraic Invariants for Affine Programs

James Worrell

10:30-10:40

A unified approach to Büchi determinisation

Anton Pirogov

10:40-10:50

Algorithms for inclusion into a regular language

Pierre Ganty

10:50-11:00

Determinizing two-way automata with linear-time Turing machines

Bruno Guillon

10:30-10:40

An Optimal Construction for the Barthelmann-Schwentick Normal Form on Classes of Structures of Bounded

André Frochaux

10:40-10:50

Logic and rational languages of scattered and countable series-parallel posets

Amazigh Amrane

10:50-11:00

Expressing Unboudedness in MSO + nabla

Edon Kelmendi

11:00-11:10

On Computing the Measures of First-Order Definable Sets of Trees

Marcin Przybyłko

10:30-10:40

Solving parity games in quasi-polynomial time -- a logician's approach

Karoliina Lehtinen

10:40-10:50

Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games

Paweł Parys

10:50-11:00

Universal parity graphs and lower bounds for parity games

Thomas Colcombet

11:00-11:10

Solving parity games with tangles

Tom van Dijk

11:20-12:00

Symbol Elimination for Program Analysis

Laura Kovács

13:30-14:20

The Automatic Data Scientist: Making Data Science Easier using High-level Languages, Fractional Automorphisms, and Arithmetic

Kristian Kersting

14:20-14:50

Learning Linear Temporal Properties

Daniel Neider

14:50-15:20

Learning Models over Relational Databases

Dan Olteanu

15:50-16:00

Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem

Joanna Ochremiak

16:00-16:10

On the First-Order Complexity of Subgraph Isomorphism

Oleg Verbitsky

16:10-16:20

Distinguishing Graphs via Logics with Counting

Sandra Kiefer

16:20-16:30

Non-convergence in existential monadic second order logic of random graphs

Svetlana Popova

15:50-16:00

Regular Transducer Expressions for Regular Transformations

Krishna S

16:00-16:10

Regular and First Order List Functions

Mikolaj Bojanczyk

16:10-16:20

Resynchronizing Classes of Word Relations

Maria Emilia Descotte

15:50-16:00

Parity Games with Weights

Alexander Weinert

16:00-16:10

Solving mean-payoff parity games in pseudo-quasi-polynomial time.

Laure Daviaud

16:10-16:20

Introduction to Iltis: An Interactive, Web-Based System for Teaching Logic

Thomas Zeume

16:20-16:30

Gralog, a visual tool for working with graphs, games, automata, logics

Roman Rabinovich

16:40-16:50

Efficient and Modular Coalgebraic Partition-Refinement

Thorsten Wißmann

16:50-17:00

Abstract MSO languages over monads

Julian Salamanca

17:00-17:10

Eilenberg Theorems for Free

Henning Urbat

17:10-17:20

Bracket Algebras: a nominal theory of interleaved scopes

Paul Brunet

16:40-16:50

A Pattern Logic for Automata with Outputs

Nicolas Mazzocchi

16:50-17:00

It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened

Marie Fortin

17:00-17:10

Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms

Lorenzo Clemente

17:10-17:20

Uniformization Problem for Variants of First Order Logic over Words

Vincent Michielini

16:40-16:50

Unambiguous languages exhaust the index hierarchy

Michał Skrzypczak

16:50-17:00

Is your automaton good for playing games ?

Denis Kuperberg

17:00-17:10

Eventually safe languages and Good-for-Games automata

Simon Iosti

17:10-17:20

Permutation Games for the Weakly Aconjunctive mu-Calculus

Daniel Hausmann

17:20-18:00 Poster session

10:00-10:30 Coffee break

12:00-13:30 Lunch break

15:20-15:50 Coffee break

18:00-20:00 Picnic (in Tiergarten)