Program

Note: each talk will be of 30 minutes, including 5 minutes for questions.

Wednesday, September 14

REGISTRATION 8:30 - 9:00
INVITED TALK
     Luca Bortolussi (University of Trieste, Italy)
     Machine learning meets formal verification 		9:00 - 10:00
COFFEE BREAK 10:00 - 10:30
FORMAL LANGUAGES
  1. Milka Hutagalung, Martin Lange, Norbert Hundeshagen, Dietrich Kuske, and Etienne Lozes. Multi-Buffer Simulations for Trace Language Inclusion
  2. Yoshiki Nakamura. The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities
 10:30 - 11:30
GAME THEORY
  1. Patricia Bouyer, Nicolas Markey, and Daniel Stan. Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games
  2. Stephane Le Roux and Arno Pauly. A semi-potential for finite and infinite sequential games
 11:30 - 12:30
LUNCH 12:30 - 14:30
PARITY GAMES
  1. Patrick Ah-Fat and Michael Huth. Partial solvers for parity games: effective polynomial-time composition
  2. Massimo Benerecetti, Daniele Dell'Erba, and Fabio Mogavero. A delayed promotion policy for parity games
  3. Véronique Bruyère, Quentin Hautem, and Mickael Randour. Window parity games: an alternative approach toward parity games with time bounds
 14:30 - 16:00
COFFEE BREAK 16:00 - 16:30
GUIDED TOUR OF THE HISTORIC CENTER OF CATANIA 18:00 - 21:00

Thursday, September 15

INVITED TALK
     Joanna Golinska-Pilarek (Institute of Philosophy, University of Warsaw, Poland)
     Relational decision procedures with their applications to nonclassical logics
          The talk of Joanna Golinska-Pilarek will be presented by Michał Zawidzki (University of Lodz, Poland)
 9:00 - 10:00
COFFEE BREAK 10:00 - 10:30
MODAL and DYNAMIC LOGIC
  1. Miika Hannula, Juha Kontinen, Martin Lück, and Jonni Virtema. On quantified propositional logics and the exponential time hierarchy
  2. Carlos Areces, Raul Fervari, Guillaume Hoffmann, and Mauricio Martel. Relation-changing logics as fragments of hybrid logics
  3. Nick Bezhanishvili and Clemens Kupke. Games for topological fixpoint logic
  4. Florian Bruse, Daniel Kernberger, and Martin Lange. A canonical model construction for iteration-free PDL with intersection
 10:30 - 12:30
LUNCH 12:30 - 14:30
PROOF THEORY
  1. Tomer Libal and Marco Volpe. Certification of prefixed tableau proofs for modal logic
  2. Mark Reynolds. A new rule for LTL tableaux
 14:30 - 15:30
AUTOMATA
  1. Pierre Ganty and Damir Valput. Bounded-oscillation pushdown automata
 15:30 - 16:00
COFFEE BREAK 16:00 - 16:30
EXPRESSIVENESS
  1. Davide Bresolin, Emilio Muñoz-Velasco, and Guido Sciavicco. On the expressive power of sub-propositional fragments of modal logic
  2. Manfred Droste and George Rahonis. Weighted linear dynamic logic
  3. Florian Bruse. Alternation is strict for higher-order modal fixpoint logic
 16:30 - 18:00
SOCIAL DINNER 20:30 - 00:00

Friday, September 16

INVITED TALK
     Arnaud Sangnier (Laboratoire IRIF, Université Paris Diderot, France)
     Fixpoints in VASS: Results and applications 		9:00 - 10:00
COFFEE BREAK 10:00 - 10:30
TEMPORAL LOGIC, MODEL CHECKING, and SYNTHESIS
  1. Swen Jacobs, Leander Tentrup, and Martin Zimmermann. Distributed PROMPT-LTL synthesis
  2. Leander Tentrup, Alexander Weinert, and Martin Zimmermann. Approximating optimal bounds in PROMPT-LTL realizability in doubly-exponential time
  3. Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, and Pietro Sala. Model checking the logic of Allen's relations meets and started-by is P^NP-complete
  4. Gaelle Fontaine, Fabio Mogavero, Aniello Murano, Giuseppe Perelli, and Loredana Sorrentino. Cycle detection in computation tree logic
 10:30 - 12:30
LUNCH 12:30 - 14:30