Berlin

18–21 SEPTEMBER 2018

Tutorial day: 18 SEPTEMBER 2018
Main Conference: 19–21 SEPTEMBER 2018
Satellite events:
ErichFest: 17 SEPTEMBER 2018
Workshop on theory of regular cost functions and beyond: 21 SEPTEMBER 2018

The goal of Highlights conferences is to integrate the community working on logic, games and automata.

IMPORTANT DATES

Presentation submission deadline: 13 JUNE 2018 5pm GMT
Notification: 22 JUNE 2018
Registration deadline: 31 AUGUST 2018

Venue and registration info can be found here

Highlights 2018 poster: light -- printing version

PREVIOUS EDITIONS

No proceedings

There are no proceedings. You present your best work, be it published elsewhere or yet unpublished.

Short

The conference is three days long. The contributed talks are around ten minutes.

Cheap

The participation costs are modest. Berlin is easy to reach.

Everybody is doing it!

Let's use the conference model that is so successful in other fields, like mathematics.

Committees

Call for Presentations

CALL FOR PRESENTATIONS:

HIGHLIGHTS 2018 is the sixth conference on Highlights of Logic, Games and Automata that aims at integrating the community working in these fields. Papers from these areas are dispersed across many conferences, which makes them difficult to follow.

A visit to the Highlights conference should offer a wide picture of the latest research in the field and a chance to meet everybody in the community, not just those who happen to publish in one particular proceedings volume.

We encourage you to attend and present your best work, be it already published or not, at the Highlights conference.

SCOPE:

Representative areas include, but are not restricted to:

logic and finite model theory
automata theory
games for logic and verification

IMPORTANT GUIDELINES:

The main part of your submission is an abstract, which should serve as a proposal for a presentation. Hence, submissions should have a single author—the speaker. We expect you to present your favourite result of the year, so there should be at most one submission per speaker. The Abstract may include a list of co-authors.

There are no formal proceedings and we encourage submission of work presented elsewhere. You may submit a pre-print of a paper that your presentation is based on, but you are not required to do that.

PREPARING A POSTER:

All speakers are invited to prepare a poster and participate to the Poster session.
The instructions are: A0, portrait. Please find not one, but two starter kits to produce a poster using LaTeX and Beamer: first one, second one.

Invited Presentations

KEYNOTE PRESENTATIONS

Andrei Bulatov, The Complexity of Constraints: Dichotomies and Beyond
Nicole Schweikardt, Constant Delay Enumeration of Query Results
James Worrell, Algebraic Invariants for Affine Programs

TUTORIALS

Amir Abboud, Fine-Grained Complexity and Hardness in P
Christoph Berkholz, Interactions Between Proof Complexity and Finite Model Theory
Joost-Pieter Katoen, Principles of Probabilistic Programming

INVITED SESSIONS

Chair: Christel Baier, Multi-Objective Reasoning in Probabilistic Models
Chair: Martin Grohe, Logic and Learning

SPOTLIGHT TALKS

Stéphane Gaubert, Nonarchimedean Convex Programming and Its Relation to Mean-Payoff Games
Laura Kovács, Symbol Elimination for Program Analysis
Jan Křetínský, A Journey from LTL to Your Favourite Automaton
Amaury Pouly, Continuous Models of Computation: Computability, Complexity, Universality
Jeffrey Shallit, Finite Automata and Additive Number Theory