Date | Orateur | Titre |
---|---|---|

mardi 13 décembre 2016 | Anca Muscholl (LaBRI) | Sound negotiations and static analysis |

jeudi 01 décembre 2016 | Mahesh Viswanathan (University of Illinois) | Translating LTL to Probabilistic Automata |

mardi 29 novembre 2016 | Petr Jancar (Technical University of Ostrava) | Deciding semantic finiteness of first-order grammars w.r.t. bisimulation equivalence |

mardi 22 novembre 2016 | Georg Zetzsche (ENS Cachan) | Subword Based Abstractions of Formal Languages |

mardi 15 novembre 2016 | Igor Walukiewicz (LaBRI) | Systems with Parametric Thread Creation |

mardi 08 novembre 2016 | Paulin Fournier (LaBRI) | Parameterized verification of networks of many identical processes |

mardi 25 octobre 2016 | David Janin (LaBRI) | Semantics models for timed programing languages |

mardi 18 octobre 2016 | Nicolas Perrin (Institut des Systèmes Intelligents et de Robotique (ISIR) ) | Humanoid robotics and motion abstractions |

mardi 11 octobre 2016 | Hubie Chen (Universidad del País Vasco) | Walking the Boundary Between Tractability and Intractability |

mardi 04 octobre 2016 | Bruno Courcelle (LaBRI) | Evaluations de requêtes au moyen d'automates programmés (Query evaluations by fly-automata) |

mardi 12 juillet 2016 | Mark Lawson (Heriot Watt University) | Non commutative booléen algebras |

mardi 05 juillet 2016 | Valia Mitsou (MTA SZTAKI) | Double-exponential and triple-exponential bounds for choosability problems parameterized by treewidth |

mardi 28 juin 2016 | M. Praveen (CMI Chennai) | Nesting Depth of Operators in Graph DatabaseQueries: Expressiveness vs. Evaluation Complexity |

mardi 07 juin 2016 | Aiswarya Cyriac (CMI Chennai) | Data Communicating Processes with Unreliable Channels |

mardi 31 mai 2016 | John Fearnley (University of Liverpool) | The Complexity of All-switches Strategy Improvement |

mercredi 18 mai 2016 | Narayan Kumar (CMI Chennai) | Regular Abstractions of One Counter Languages |

mardi 10 mai 2016 | Edon Kelmendi (LaBRI) | Deciding Maxmin Reachability in Half-Blind Stochastic Games |

mardi 03 mai 2016 | Diego Figueira (CNRS / LaBRI) | Semantic acyclicity of conjunctive queries |

mardi 19 avril 2016 | Ranko Lazic (Warwick University) | Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete |

jeudi 14 avril 2016 | Hubie Chen (Ikerbasque) | The Logic of Counting Query Answers: A Study via Existential Positive Queries |

mardi 12 avril 2016 | Hubie Chen (Ikerbasque) | One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries |

mardi 05 avril 2016 | Nathan Lhote (LaBRI) | Towards an algebraic theory of rational word functions |

mardi 29 mars 2016 | David Janin (LaBRI) | Programmation réactive par tuilage |

mardi 22 mars 2016 | Mikolaj Bojanczyk (University of Warsaw) | For graphs of bounded tree width, recognisability equals definability in MSO. |

mardi 08 mars 2016 | Sylvain Schmitz (LSV - ENS Cachan) | The Complexity of Coverability in nu-Petri Nets |

mardi 01 mars 2016 | Paul Gastin (LSV - ENS Cachan) | Reasoning about distributed systems: WYSIWYG |

mardi 16 février 2016 | Denis Kuperberg (TU Munich) | Sensing cost for automata and synthesis |

mardi 09 février 2016 | Laure Daviaud (LIP - ENS Lyon) | A Generalised Twinning Property for Minimisation of Cost Register Automata. |

mardi 02 février 2016 | Hugo Gimbert (CNRS / LaBRI) | A Class of Zielonka Automata with a Decidable Controller Synthesis Problem |

mardi 12 janvier 2016 | Laura Ciobanu (University of Neuchâtel, Switzerland) | The language complexity of solutions of equations in free semigroups and free groups |