Program

PRELIMINARY PROGRAM

9:00-10:00

Catuscia Palamidessi, Director of Researc, INRIA and Leader of the equipe Comète

Differential Privacy and Applications to Location Privacy

10:00-10:30 Ilina Stoilkovska, A Framework for Automated Verification of Synchronous Fault-Tolerant Distributed Algorithms

10:30-11:00 coffee

11:00-11:30 Silvia Steila, A combinatorial bound for a restricted form of the Termination Theorem

11:30-12:00 Yuting (Kino) Zhao, A model theoretic discussion of statistical learning

12:00-12:30 Alice Pavaux. Inductive and Functional Types in Ludics

12:30-13:00 Rehana Patel, Computability of algebraic and definable closure

13:00-14:00 lunch

14:00-15:00

Claudia Nalon, Professor at University of Brasilia, Brazil

Strategies for Modal Theorem-Proving

15:00-15:30 Andrea Aler Tubella, Subatomic Proof Systems

15:30-16:00 Madalina Erascu. Computational Logic and Quantifier Elimination Techniques for Optimal Numerical Algorithms

16:00-16:30 coffee

16:30-17:00 Giselle Reis, Translations from Resolution to Sequent Calculus

17:00-17:30 Line Line Jakubiec-Jamet, Natural Language Processing and Coq: a case-study

17:30-18:00 Maria Emilia Descotte, Axiomatizations for Downward XPath

18:00-onwards PARTY!!! Celebrating WiL, our Host Anna and her Achievements!

NOTE:

Our workshop will be held in room M1.02.

You can find the location at

on page 3.

PAPERS ACCEPTED