25th EACSL Annual Conference on Computer Science Logic

Aix-Marseille Université Marseille, France

CSL 2016 Aix-Marseille Université

Marseille, August 29 - September 1

http://csl16.lif.univ-mrs.fr

Local information Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). CSL 2016 is the 25th edition in the series, hosted by Aix-Marseille Université in Marseille (France).

Conference venue Both the main conference and its satellite workshops are held in the city center campus of the Faculty of Sciences (see map). CSL takes place in Amphithéâtre Sciences Naturelles, whereas workshops take place in Amphithéâtre Physique (CRECOGI and QSLC), Amphithéâtre Sciences Naturelles (PLRR) and Amphithéâtre Chimie (LCC): see map on page 3. Breaks and lunches are served in the Salle des Conférences (2 minutes walk from the auditoriums). The CSL welcome desk is located in front of Amphithéâtre Sciences Naturelles, every day starting at 8:30.

Public transportation The easiest way to reach the conference location is to take the metro and get out at station Saint Charles (on both metro lines M1 and M2). When exiting the station by the exit “Place Victor Hugo”, follow the road that goes up slightly and you will see a building with the name of our university. At the main entrance, do tell the guard that you come for the CSL conference and he will check your name on the listing. Beware that Aix-Marseille Université has many different campuses in Marseille…

!2 !2CSL 2016

St Charles

Calque sans titre

Faculté des Sciences d'AixMarseille Université

Station Saint CharlesMetro Line M1 & M2

Aix-Marseille Université Campus Saint Charles

Museum Regards de Provence

Welcome receptionAugust 29

Restaurant Les ArcenaulxBanquet - August 31 - 20:00

Start of the ExcursionAugust 31 - 16:00

Reception On Monday August 29, a welcome reception (included in the CSL fees) at the Museum Regards de Provence (see map on page 2) starts at 19:00. You will be able to visit the museum freely, and enjoy a nice view on the sea, nearby the MUCEM (recent Museum of Mediterranean Civilisation).

Excursion & banquet On Wednesday August 31, a boat trip in the Calanques is proposed (included in the CSL fees), starting at 16:00 in the Vieux Port (see map on page 2). The boat trip starts from the corner of Quai du Port and Quai des Belges, and will leave us back at the same place around 19:00. Then, the banquet (included in the CSL fees) takes place at the Restaurant Les Arcenaulx, starting at 20:00. The address is 25 cours Honoré d’Estienne d’Orves, 13001 Marseille (see map on page 2). Do not forget to bring your badge with you to facilitate the entrance. Please, do contact the organisers at the welcome desk in case you do not want to join for this excursion or the banquet.

Internet access Eduroam WLAN connection is available in the whole campus. If you are not able to connect to Eduroam, alternative WLAN connections are available at the welcome desk.

!3 !3CSL 2016

Amphithéâtre Sciences Naturelles

CSL & PLRR

Salle des ConférencesBreaks & Lunches

Main entrance

Amphithéâtre ChimieLCC

Amphithéâtre PhysiqueCRECOGI & QSLC

!4 !4

MO

ND

AY 2

9TU

ESD

AY 3

0W

EDN

ESD

AY 3

1TH

URS

DAY

109

:00

Invi

ted

talk

: Lib

or B

arto

. Infi

nite

Do

mai

n co

nstra

int s

atisf

actio

n pr

oble

mIn

vite

d ta

lk: A

nca

Mus

chol

l. Au

tom

ated

syn

thes

is: g

oing

dist

ribut

edIn

vite

d ta

lk: A

gata

Cia

batto

ni.

Anal

ytic

cal

culi

for n

on-c

lass

ical

logi

cs:

theo

ry a

nd a

pplic

atio

ns

Invi

ted

talk

: Ale

xand

ra S

ilva.

C

oalg

ebra

ic le

arni

ng09

:30

10:0

0Br

eak

Brea

kBr

eak

Brea

k10

:30

Alge

bra

Fini

te m

odel

s, D

escr

iptiv

e co

mpl

exity

Verifi

catio

nM

odal

logi

c11

:00

11:3

0

12:0

0

12:3

0

Lunc

hLu

nch

Lunc

hLu

nch

13:0

0

13:3

0

14:0

0

Verifi

catio

n, F

inite

mod

els

Hom

otop

y ty

pe th

eory

Acke

rman

n Aw

ard

Com

plex

ity a

nd d

ecis

ion

for

logi

cal t

heor

ies

14:3

0

15:0

0

15:3

0

16:0

0Br

eak

Brea

k

Excu

rsio

n - B

oat t

rip in

C

alan

ques

Brea

k16

:30

CSP

Real

isab

ility

, den

otat

iona

l se

man

tics

Line

ar lo

gic

17:0

0

17:3

0

18:0

0

CSL

bus

ines

s m

eetin

g18

:30

19:0

0

Wel

com

e re

cept

ion

- Mus

eum

Re

gard

s de

Pro

venc

e

19:3

0

20:0

0

Banq

uet -

Res

taur

ant L

es

Arce

naul

x… H

eure

de

débu

t

09:00

Dur

ée

30min

Computer Science Logic 2016 The CSL 2016 conference is located in the Amphithéâtre Sciences Naturelles.

Monday August 29 9:00 – 10:00 Invited talk. Libor Barto, Infinite domain constraint satisfaction problem.

10:00 – 10:30 Coffee break

10:30 – 12:30 Algebra

Akihisa Yamada, René Thiemann, Christian Sternagel and Keiichirou Kusakari: AC Dependency Pairs Revisited Hans Leiß: The Matrix Ring of a mu-Continuous Chomsky Algebra is mu- Continuous Jérémy Dubut, Eric Goubault and Jean Goubault-Larrecq: The Directed Homotopy Hypothesis Sebastian Enqvist, Fatemeh Seifan and Yde Venema: Completeness for coalgebraic fixpoint logic

12:30 – 14:00 Lunch

14:00 – 16:00 Verification, finite models Moses Ganardi, Stefan Göller and Markus Lohrey: On the Parallel Complexity of Bisimulation over Finite Systems Paulo Tabuada and Daniel Neider: Robust Linear Temporal Logic Paweł Parys and Szymon Toruńczyk: Models of λ-Calculus and the Weak MSO Logic Tomer Kotek, Helmut Veith and Florian Zuleger: Monadic second order finite satisfiability and unbounded tree-width

16:00 – 16:30 Coffee break

16:30 – 18:00 CSP Albert Atserias and Szymon Toruńczyk: Non-homogenizable classes of finite structures Hubie Chen and Peter Mayr: Quantified Constraint Satisfaction on Monoids Lauri Hella and Phokion Kolaitis: Dependence Logic vs. Constraint Satisfaction

19:00 – 23:00 Welcome reception

Tuesday August 30 9:00 – 10:00 Invited talk. Anca Muscholl, Automated synthesis: going distributed.

!5 !5CSL 2016

10:00 – 10:30 Coffee break

10:30 – 12:30 Finite models, Descriptive complexity Arnaud Durand, Anselm Haak, Juha Kontinen and Heribert Vollmer: Descriptive Complexity of #AC0 Functions Kord Eickmeyer and Ken-Ichi Kawarabayashi: Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs Michael Elberfeld: Context-Free Graph Properties via Definable Decompositions Svenja Schalthöfer, Wied Pakusa and Aziz Erkal Selman: Definability of Cai-Fürer- Immerman Problems in Choiceless Polynomial Time

12:30 – 14:00 Lunch

14:00 – 16:00 Homotopy type theory Kuen-Bang Hou (Favonia) and Michael Shulman: The Seifert-van Kampen Theorem in Homotopy Type Theory Ian Orton and Andrew Pitts: Axioms for Modelling Cubical Type Theory in a Topos Lars Birkedal, Aleš Bizjak, Ranald Clouston, Hans Bugge Grathwohl, Bas Spitters and Andrea Vezzosi: Guarded Cubical Type Theory: Path Equality for Guarded Recursion Thorsten Altenkirch, Paolo Capriotti and Nicolai Kraus: Extending Homotopy Type Theory with Strict Equality

16:00 – 16:30 Coffee break

16:30 – 18:00 Realisability, denotationnal semantics James Laird: Polymorphic Game Semantics for Dynamic Binding Jean-Louis Krivine: Bar recursion in classical realizability: dependent choice and continuum hypothesis Ulrich Berger: Extracting nondeterministic concurrent programs

18:00 – 20:00 CSL business meeting

Wednesday August 31 9:00 – 10:00 Invited talk. Agata Ciabattoni, Analytic calculi for non-classical logics: theory and applications

10:00 – 10:30 Coffee break

10:30 – 12:30 Verification Alexander Weinert and Martin Zimmermann: Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs Paul Hunter, Guillermo Perez and Jean-Francois Raskin: Minimizing Regret in Discounted-Sum Games

!6 !6CSL 2016

Rajeev Alur, Marco Faella, Sampath Kannan and Nimit Singhania: Hedging bets in Markov decision processes Shaull Almagor and Orna Kupferman: High-Quality Synthesis Against Stochastic Environments

12:30 – 14:00 Lunch

14:00 – 15:00 Ackermann Award

16:00 – 19:00 Excursion 20:00 – 23:00 Banquet

Thursday September 1 9:00 – 10:00 Invited talk. Alexandra Silva, Coalgebraic learning

10:00 – 10:30 Coffee break

10:30 – 12:30 Modal logic David Baelde, Simon Lunel and Sylvain Schmitz: A Sequent Calculus for a Modal Logic on Finite Data Trees Erich Grädel and Stefan Hegselmann: Counting in Team Semantics Gergei Bana and Mitsuhiro Okada: Semantics for “Enough-Certainty” and Fitting’s Embedding of Classical Logic in S4 Martin Lück: Axiomatizations for Propositional and Modal Team Logic

12:30 – 14:00 Lunch

14:00 – 16:00 Complexity and decision for logical theories Emanuel Kieronski: One Dimensional Logic over Words Ian Pratt-Hartmann, Wiesław Szwast and Lidia Tendera: Quine’s Fluted Fragment is Non-elementary Leszek Kołodziejczyk, Henryk Michalewski, Pierre Pradic and Michał Skrzypczak: The logical strength of the Büchi’s decidability theorem Prateek Karandikar and Philippe Schnoebelen: The height of piecewise-testable languages with applications in logical complexity

16:00 – 16:30 Coffee break

16:30 – 18:00 Linear logic Anupam Das and Patrick Baillot: Free-cut elimination in linear logic and an application to a feasible arithmetic Daniel de Carvalho: The relational model is injective for Multiplicative Exponential Linear Logic David Baelde, Amina Doumane and Alexis Saurin: Infinitary proof theory : the multiplicative additive case

!7 !7CSL 2016

Workshops Workshops are located in Amphithéâtre Physique (CRECOGI and QSLC), Amphithéâtre Sciences Naturelles (PLRR) and Amphithéâtre Chimie (LCC).

CRECOGI Sunday August 28 (Amphithéâtre Physique) 09:00 – 10:00 Ichiro Hasuo: Healthiness from Duality Flavien Breuvart: From hard work to trickery: A systematic approach of probabilistic rewriting 10:00 – 10:25 Coffee Break 10:25 – 12:00 Naohiko Hoshino: Geometry of interaction and coherence spaces Paul-André Mellies: A fibrational account of local states and beyond Yann Hamdaoui: A parallel GoI for a concurrent effectful lambda calculus Soichiro Fujii: Graded Monads and Effect-Annotated Computational Effects Akira Yoshimizu: The Geometry of Probabilistic Parallelism 12:30 – 14:30 Lunch 14:30 – 16:00 Shin-ya Katsumata: On graded coalgebras of graded linear exponential comonad Ryo Tanaka: Token Machines for Multiport Interaction Combinators Francesco Gavazzo: Bisimulations for Algebraic Effects: Some Preliminary Results Koko Muroya: Dynamic GoI machines

16:00 – 16:30 Coffee break 16:30 – 18:00 Discussion

PLRR Friday September 2 (Amphithéâtre Sciences Naturelles) 09:00 – 10:00 Invited talk. Neil Ghani: TBA 10:00 – 10:30 Coffee break 10:30 – 12:15 Daniil Frumin and Benno van den Berg: A homotopy-theoretic model of function extensionality in the effective topos Paolo Pistone: Parametric polymorphism and the completeness of type theory Federico Orsanigo: Bifibrational Parametricity 12:15 – 14:30 Lunch break 14:30 – 15:30 Invited talk. Nick Benton: TBA 15:30 – 16:00 Richard Statman: The Completeness of BCD for an Operational Semantics 16:00 – 16:30 Coffee break 16:30 – 17:30 Rodolphe Lepigre: TBA Christophe Raffalli: Realization of a weak ultrafilter axiom

!8 !8CSL 2016

QSLC (Amphithéâtre Physique) Friday September 2 10:00 – 10:30 Welcome and coffee 10:30 – 11:30 Invited talk. Shinya Katsumata: Graded monads and the semantics of effect systems 11:30 – 12:30 Invited talk. Marco Gaboardi: Program Logics for Reasoning about Confidence Intervals 12:30 – 14:00 Lunch 14:00 – 14:45 Invited talk. Christine Tasson: Probabilistic Call By Push Value 14:45 – 15:30 Invited talk. Thomas Ehrhard: TBA 15:30 – 16:00 Invited talk. Michele Pagani: The Free Exponential Modality in Probabilistic Coherence Spaces 16:00 – 16:30 Coffee break 16:30 – 17:00 Invited talk. Jim Laird: Qualitative to quantitative semantics by change of base 17:00 – 17:30 Invited talk. Thomas Seiller: Interaction Graphs: A Quantitative Geometry of Interaction

Saturday September 3 09:00 – 10:00 Invited talk. Radu Mardare: Mathematical Foundations of Quantitative Semantics for Markov Processes 10:00 – 10:30 Coffee break 10:30 – 11:30 Invited talk. Sam Staton: TBA 11:30 – 12:00 Invited talk. Thomas Leventis: Separability in probabilistic lambda- calculus 12:00 – 12:30 Invited talk. Giulio Manzonetto: Böhm Theorem for resource lambda- calculus 12:30 – 14:00 Lunch 14:00 – 14:30 Invited talk. Ugo Dal Lago: Context Equivalences and Metrics in Probabilistic Lambda-Calculi 14:30 – 15:00 Invited talk. Marie Kerjean: Mackey-complete spaces and power series : a topological model of Differential Linear logic 15:00 – 15:30 Invited talk. Damiano Mazza: Parsimonious Logic and Computational Complexity 15:30 – 16:00 Invited talk. Lionel Vaux: Normalisation of Taylor-expansion, in a non- uniform setting 16:00 – 19:00 Coffee break, free discussion and adieux

!9 !9CSL 2016

LCC (Amphithéâtre Chimie) Friday September 2 8:55 – 09:00 Welcome 9:00 – 10:00 Invited talk. Hugo Férée: Game Semantics Approach to Higher-Order Complexity 10:00 – 10:30 Coffee Break 10:30 – 12:30 Contributed session Jose Divasón, Sebastiaan Joosten, Ondřej Kunčar, René Thiemann and Akihisa Yamada: Certifying Exact Complexity Bounds for Matrix Interpretations Daniel de Carvalho and Jakob Grue Simonsen: An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting Marc Bagnol: Distributive Traced Categories 12:30 – 14:00 Lunch 14:00 – 16:00 Invited talks Emanuel Kieroński: Two-Variable Logics with Equivalence Relations: From NP to 2NExpTime and Undecidability Anupam Das: Proof Complexity of Deep Inference: a Survey 16:00 – 16:30 Coffee Break 16:30 – 17:50 Contributed session Ulrich Berger: Computational Efficiency of Coinduction Damiano Mazza: On Time and Space in Higher Order Boolean Circuits

Saturday September 3 9:00 – 10:00 Invited talk. Yevgeny Kazakov: Towards Practical Algorithms with Optimal Complexity for Description Logics 10:00 – 10:30 Coffee Break 10:30 – 12:30 Contributed session Lucy Ham: A dichotomy for Boolean robust satisfiability Marcel Jackson: Flexible satisfaction Marco Voigt: The Complexity of Satisfiability in the Separated Fragment - A Journey Through ELEMENTARY and Beyond 12:30 – 14:00 Lunch

!10 !10CSL 2016

Invited talks

Libor Barto, Charles University in Prague Infinite domain constraint satisfaction problem The computational and descriptive complexity of finite domain fixed template constraint satisfaction problem (CSP) is a well developed topic that combines several areas in mathematics and computer science. Allowing the domain to be infinite provides a way larger playground which covers many more computational problems and requires further mathematical tools. I will talk about some of the research challenges and recent progress on them.

Agata Ciabattoni, Technische Universität Wien Analytic calculi for non-classical logics: theory and applications The possession of a suitable proof-calculus is the starting point for many investigations into a logic, including decidability and complexity, computational interpretations and automated theorem proving. By suitable proof-calculus we mean a calculus whose proofs exhibit some notion of subformula property (`analyticity'). In this talk we describe a method for the algorithmic introduction of analytic sequent-style calculi for a wide range of

non-classical logics starting from Hilbert systems. To demonstrate the widespread applicability of this method, we discuss how to use the introduced calculi for proving various results ranging from Curry-Howard isomorphism to new interpretative tools for Indology.

Anca Muscholl, Université Bordeaux & Institut Universitaire de France Automated synthesis: going distributed Synthesis is particularly challenging for concurrent programs. At the same time it is a very promising approach, since concurrent programs are difficult to get right, or to analyze with traditional verification techniques. The talk provides an introduction to distributed synthesis in the setting of Mazurkiewicz traces, and its applications to decentralized runtime monitoring.

Alexandra Silva, University College London Coalgebraic learning The area of automata learning was pioneered by Angluin in the 80's. Her original algorithm, which applied to regular languages and deterministic automata, has been extended to various types of automata and used in software and hardware verification. In this talk, we will take an abstract perspective at automata learning. We show how the correctness of the original algorithm and many extensions can be

captured in one proof using coalgebraic techniques. We also show that a novel algorithm for nominal automata can be derived from the abstract framework.

!11 !11CSL 2016

Sponsors

The conference CSL 2016 is supported by:

Aix-Marseille Université, hosting institution

Laboratoire d’Informatique Fondamentale de Marseille (LIF)

Institut de Mathématiques de Marseille (I2M)

European Association for Computer Science Logic

Centre National de la Recherche Scientifique

Laboratoire d’Excellence Archimède

Fédération de Recherche en Informatique et Interactions d’Aix-Marseille

Faculté des Sciences d’Aix-Marseille Université