Program

The hours are in CEST.

TimeSessionChair
10:00 — 10:10— Grand opening —
10:10 — 10:45Michał Skrzypczak: Presenting your work - tikz & tricksKaroliina Lehtinen
10:45 — 10:55— Break —
10:55 — 11:30Orna Kupferman: Examining Classical Graph-Theory Problems
11:30 — 11:40— Break —
11:40 — 12:15 Florin Manea: Combinatorics on Words (through the Word-Equations-lens)Filip Mazowiecki
12:15 — 12:25— Break —
12:25 — 13:00Wim Martens: Research in Logic and Data Management
13:00 — 14:30 — Lunch Break —
14:30 — 15:05Joël Ouaknine: Some Advice to Budding Researchers Erin Chapman
15:05 — 15:15— Break —
15:15 — 15:50Philip Wadler: You and Your Research and The Elements of Style
15:50 — 16:00— Break —
16:00 — 16:35Joey Dodds: Logic in IndustryMichaël Cadilhac
16:35 — 16:45— Break —
16:45 — 18:00Panel with Kathleen Fisher, Wim Martens, Sandra Kiefer
18:00 — 18:10— Closing remarks —

Videos

All talks are recorded and they are available here.

Abstracts and slides

Michał Skrzypczak: Presenting your work - tikz & tricks slides
Making a good slides-based presentation is a highly non-trivial task. You should balance being specific but not boring, properly assess the basic knowledge of the audience, make your slides communicative and aesthetic, manage time and content, etc The task is also tricky, as some of the good practices may seem counterintuitive at the first sight. I will share some non-expert's thoughts on the topic, suggesting certain rules of thumb to follow and technologies that might be handy.

Orna Kupferman: Examining Classical Graph-Theory Problems From The Viewpoint of Formal-Verification Methods slides
While classical graph algorithms are extensively studied by the "Volume A" community of Theoretical Computer Science, the rich semantics and structure that graphs may have is the bread and butter of the "Volume B" community. In particular, in formal verification, we study labeled and game graphs, and we develop algorithms for systems with an internal structure or with huge state spaces. The questions studied by the formal-verification community are, however, very different from those studied in classical graph theory. The talk surveys a series of works that lift the rich semantics and structure of graphs, and our experience in reasoning about them, to classical graph-theoretical problems.

Florin Manea: Combinatorics on Words (through the Word-Equations-lens) slides
In this talk, I will introduce several concepts from the area of combinatorics on words in a framework based on the notion of Word Equation. This perspective will allow us to travel from very basic problems in this area to some attractive and hard open problems. Along the way we will see interesting connections of combinatorics on words to pure combinatorics, algebra, automata theory, computability, complexity theory, algorithms and data structures, and, nevertheless, logic.

Wim Martens: Research in Logic and Data Management slides
Data management has been a field that attracts researchers with a strong logic background for decades. Today, with data management being more influential than ever in our society, this still remains true, and perhaps it can even be said that the field is searching for new theoreticians. In this talk, I plan to give a quick overview of some current challenges in data management that bring theory and practice together.

Joël Ouaknine: Some Advice to Budding Researchers slides
I will offer pieces of advice on various research-related topics, drawing from both personal experience and lessons learnt from mentors and peers. I will try my best not to overlap with the next talk, even though I too am a big fan of Richard Hamming...

Philip Wadler: You and Your Research and The Elements of Style slides
This talk surveys advice from experts, including Richard Hamming, William Strunk, E. B. White, Donald Knuth, and others, on how to conduct your research and communicate your results.

Joey Dodds: Logic in Industry slides
Many papers about applying logic to programs talk about how those techniques can help programmers produce safer, more correct systems. Despite this, it is rare to see this work transitioned. In this talk, I will discuss what we can do in our research to help it have impact, and back this up with evidence from my work applying logic techniques to industrial systems.
Data Protection Imprint