Our seminars are usually on Thursdays. Some of them are shared with the LIMD team of the LAMA laboratory, and are located in Chambéry. About once a month, the seminar is held as a meeting of the Choco ANR project.

Next Events

• Thursady 18th January, 4pm, salle B1:
  Frédéric Prost (CAPP, LIG, Grenoble)
  Enforcing Dynamic Interference Policy.
  
  Non-Interference is the mathematical basis for confidentiality analyses. The idea is to ensure that private data are not observable at public level. Understood in a strict way non-interference is a too strong property. Standard every day life examples like password checks or message encryption formally break the non-interference property. In this work we propose a framework in which it is possible to define an interference policy allowing intentional information downgrading in the form of a rewrite system. Moreover, this policy is dynamic, i.e. the confidentiality level of data may evolve during computation: think at policies in which you want to express that a user has a limited number of guesses or to the sending of a pay-per-view information. We develop a notion of program safety with relation to a dynamic interference policy and give an algorithm, an abstract evaluation of the program, to check that a program is safe with relation to a dynamic interference policy.

Past Events (since September 2010)

Since January 2011

• Tuesday 6th September, 2pm:
  Ichiro Hasuo (Dept. of Computer Science, University of Tokyo)
  Semantics of Higher-Order Quantum Computation via Geometry of Interaction
  (joint work with Naohiko Hoshino, RIMS, Kyoto University).

• Thursday 30th June:
  Stefan Hetzl (PPS)
  First-Order Proofs as Tree Languages

• Monday 30th May:
  Daniel Leivant (Indiana University (USA) & Loria (Nancy))
  The Comprehension Cube

• Thursday 19th May:
  Marcello Bonsangue (CWI, Amsterdam)
  Three coalgebraic characterizations of context free languages
  (joint work with J. Rutten and J. Winter).

• Wednesday 18th May:
  
  CoGip meets CWI
  • Damien Pous (CNRS, SARDES, LIG)
    A Tutorial on Bisimulation Up-To
  
  
  • Filippo Bonchi (CNRS, PLUME, LIP) & Jan Rutten (CWI, Amsterdam)
    A Coalgebraic Perspective on Linear Weighted Automata
    Filippo Bonchi: part 1 ; Jan Rutten: part 2.
  
  
  • Alexandra Silva (CWI, Amsterdam)
    Sound and complete axiomatizations of coalgebraic language equivalence

• Thursday 21st April:
  Lionel Nguyen Van Thé (LATP, Marseille)
  (LIMD seminar).

• Thursday 14th April:
  Tom Hirschowitz (LIMD, LAMA)
  (LIMD seminar).

• From Monday 4th to Thursday 7th April:
  
  Choco Party & Differential Linear Logic course
  Final meeting of the Choco ANR project.

• Thursday 31th March:
  Peter G. Hancock (University of Strathclyde, UK)
  (LIMD seminar).

• Thursday 17th March:
  Jacques Duparc (Université de Lausanne).
  Games to Look into (Topological) Complexity.
  An Application to Automata Theory: The Wagner Hierarchy

• Thursday 10th March:
  Xavier Urbain (ENSIIE & CEDRIC, CNAM).
  
  Démonstration automatique : techniques, outils et certification

• Thursday 3rd March:
  Arnaud Carayol (IGM, Université Paris Est & CNRS).
  
  Structures defined by higher-order recursion schemes

• Thursday 24th February:
  Federico Aschieri (Torino University, Italy).
  
  Classical Logic, Learning and Realizability

• Monday 21st February:
  Masahiro Hamano (PRESTO, Japan Science and Technology Agency (JST))
  
  A Geometry of Interaction for Polarized Linear Logic

• From Monday 14th February to Friday 18th February:
  
  Rule-based modelling and application to biomolecular networks
  (winter school ER 06 of the Computer Science Department).

• Thursday 10th February:
  Jacques Jayez (L2C2, Lyon)
  
  Projection, attachement et logique épistémique

• From Monday 31st January to Friday 4th February:
  
  Separation logics and applications
  (winter school ER 04 of the Computer Science Department).

• Thursday 27th January:
  Choco seminar.

• Thursday 20th January:
  Pierre Hyvernat (LIMD, LAMA)
  (LIMD seminar).

• Monday 17th January:
  Ugo Dal Lago (Université de Bologne & INRIA Sophia Antipolis)
  
  Linear Dependent Types and Relative Completeness.

• Thursday 13th January:
  Thomas Seiller (IML, Marseille)
  (LIMD seminar).

• Thursday 6th January:
  Danko Ilik,
  Constructive proofs of completeness, extra-intuitionistic principles, and delimited control operators
  [slides].

Since September 2010

• Thursday 9th December:
  Choco seminar.

• Thursday 25th November:
  Sylvain Salvati (INRIA Bordeaux Sud-Ouest & LaBRI),
  Extending Recognizability to the Simply Typed lambda-Calculus.

• Friday 19th November:
  Seminar of the COMPLICE ANR project.

• Thursday 18th November:
  Denis Cousineau (MSR-INRIA),
  An algebraic view of reducibility candidates.

• Wednesday 10th November:
  Jean-Louis Krivine (PPS, Paris 7),
  New models of ZF
  [slides].

• Thursday 4th November:
  Choco seminar.

• Tuesday 26th Ocotber:
  Ulrich Berger (Swansea),
  Program extraction from proofs using induction and coinduction.

• Thursday 21fst October:
  Giulio Manzonetto (Nijmegen),
  Full Abstraction for Resource Calculus with Tests.

• Thursday 7th October:
  Choco seminar.

• Friday 1st October:
  Amir Ben Amram (Tel-Aviv),
  An Introduction to Size-Change Termination Analysis
  (join seminar with the Compsys team).

• Thursday 16th September:
  Tom Hirschowitz (LIMD, LAMA),
  Cartesian closed 2-categories and higher-order rewriting
  (LIMD seminar).

• Tuesday 7th September:
  Jean-Yves Girard (IML, Marseille),
  La Normativité Logique.