Le séminaire MF a lieu salle **178** presque tous les mardis à 14H.

Pour proposer un séminaire, le calendrier vous aidera à choisir une date disponible.

Pour s'abonner ou se désabonner de la liste de diffusion.

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

mardi 18 mai 2021 | Wojciech Czerwinski
(the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics of the University of Warsaw)
| Reachability in Vector Addition Systems is Ackermann-complete |

mardi 01 juin 2021 | Alexandra Silva
(University College London)
| TBA |

mardi 15 juin 2021 | Georg Zetzsche
(Max Planck Institute for Software Systems)
| TBA |

mardi 29 juin 2021 | Joost-Pieter Katoen
( RWTH Aachen University and University of Twente)
| TBA |

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

mardi 04 mai 2021 | Andrzej Murawski (University of Oxford) | Verifying higher-order concurrency with data automata |

mardi 27 avril 2021 | Mahsa Shirmohammadi (IRIF) | Cyclotomic Identity Testing and Application |

mardi 13 avril 2021 | Jan Kretinsky (Technical University of Munich) | Learning-based LTL synthesis |

mardi 30 mars 2021 | Thomas Zeume (Ruhr University Bochum) | Register Automata with Extrema Constraints, and an Application to Two-Variable Logic |

mardi 23 mars 2021 | Peter Hines (Université de York) | Shuffles, Operads, and Associahedra in Theoretical Computer Science |

mardi 16 mars 2021 | Dmitry Chistikov (The University of Warwick) | Subcubic Certificates for CFL Reachability |

mardi 02 mars 2021 | Nofar Carmeli (ENS) | The Complexity of Answering Unions of Conjunctive Queries |

mardi 02 février 2021 | Stefan Göller (Universität Kassel) | Bisimulation Finiteness of Pushdown Systems Is Elementary |

mardi 15 décembre 2020 | Engel Lefaucheux (Max-Planck Institute for Software Systems) | Reachability in dynamical systems with rounding |

mardi 08 décembre 2020 | Miguel Romero Orth (Universidad Adolfo Ibáñez) | On monotonic determinacy and rewritability for recursive queries and views |

mardi 01 décembre 2020 | Antonio Casares (LaBRI) | Optimal transformations of Muller conditions |

mardi 24 novembre 2020 | Maud Szusterman (IMJ-PRG) | Monotone ABPs complexity vs. monotone rank of some explicit polynomials |

mardi 17 novembre 2020 | Joël Ouaknine (Max Planck Institute for Software Systems) | Holonomic Techniques, Periods, and Decision Problems |

mardi 03 novembre 2020 | Nathanaël Fijalkow (LaBRI - CNRS) | DeepSynth, two years later: what have we learned about program synthesis? |

mardi 20 octobre 2020 | Richard Combes (Supelec) | Solving Random Parity Games in Polynomial Time |

mardi 06 octobre 2020 | Igor Konnov (INRIA Nancy) | Using TLA+ and Apalache to specify and check the Tendermint light client |

mardi 29 septembre 2020 | Mikael Monet (Millenium Instititute for Foundational Research on Data) | Title: Counting Problems over Incomplete Databases |

mardi 15 septembre 2020 | Damien Busatto-Gaston (ULB) | Monte Carlo Tree Search guided by Symbolic Advice for MDPs |

mardi 08 septembre 2020 | Guillermo A. Perez (University of Antwerp) | Safe Learning for Near Optimal Scheduling |

mardi 30 juin 2020 | Helmut Seidl (TUM) | When Is a Bottom-up Deterministic Tree Transducer Top-down Deterministic? |

mardi 23 juin 2020 | Elena Gutierrez (IMDEA Software Institute) | A Congruence-based Perspective on Automata Minimization Algorithms |

mardi 02 juin 2020 | Ana Ozaki (University of Bergen) | Learning Description Logic Ontologies |

mardi 26 mai 2020 | Abhishek De (IRIF) | A parallel syntax for non-wellfounded proof theory |

mardi 19 mai 2020 | Antoine Amarilli (Télécom Paris) | Query evaluation on probabilistic data: a story of dichotomies |

mardi 05 mai 2020 | Thibault Godin (Université de Montpellier, Université de Lorraine) | Order problem for automaton semigroups |

mardi 21 avril 2020 | Filip Mazowiecki (Max Planck Institute for Software Systems) | On polynomial recursive sequences |

mardi 14 avril 2020 | Pierre Ohlmann (IRIF) | Controlling a random population |

mardi 31 mars 2020 | Jérôme Leroux (CNRS, LaBRI) | Reachability in fixed dimension vector addition systems with states |

mardi 24 mars 2020 | Abhishek De (IRIF) | A parallel syntax for non-wellfounded proof theory |

mardi 17 mars 2020 | André Nies (University of Auckland ) | Finite automata presentable groups |

mardi 10 mars 2020 | Florent Capelli (Université de Lille) | An introduction to Knowledge compilation |

vendredi 28 février 2020 | Howard Straubing (Boston College) | Two Variable Logic with a Between Relation |

mardi 18 février 2020 | Janusz Schmude (MIMUW, University of Warsaw) | An algebraic approach to equivalence of MSO transductions of graphs of bounded treewidth |

mardi 11 février 2020 | Paul-Elliot Anglès Auriac (Institut Camille Jordan, Lyon) | The reverse mathematics of Hindman's theorem |

jeudi 06 février 2020 | Maribel Fernandez (King's College London) | Semantics and applications of PORGY - an interactive modelling framework based on strategic graph rewriting |

mardi 04 février 2020 | Jérôme Leroux (CNRS, LaBRI) | Reachability in fixed dimension vector addition systems with states |

mardi 28 janvier 2020 | Sylvain Lombardy (LaBRI) | A separation result on min-plus and max-plus automata |

mardi 21 janvier 2020 | Denis Kuperberg (CNRS, ENS Lyon) | Computational content of circular proof systems |

mardi 14 janvier 2020 | Guillaume Lagarde (LaBRI) | Lempel-Ziv: A "one-bit catastrophe" but not a tragedy |

mardi 07 janvier 2020 | Raphaël Berthon (ULB) | Mixing sure, almost sure, exist and probable objectives in MDPs |

mardi 17 décembre 2019 | Mateusz Skomra (ENS Lyon) | Using tropical geometry to obtain condition numbers of stochastic mean payoff games |

mardi 10 décembre 2019 | Edwin Hamel-De Le Court (Université de Rouen) | Algebraic tools for state complexity |

mardi 03 décembre 2019 | Christine Tasson (IRIF, Paris 7) | Semantics of Functional Probabilistic Programs |

mardi 26 novembre 2019 | Sebastian Junges (RWTH Aachen) | Parameter Synthesis in Markov Models: An Overview |

mardi 19 novembre 2019 | Nathanaël Fijalkow (CNRS, LaBRI) | Learning probabilistic context-free grammars |

mardi 12 novembre 2019 | Bartek Klin (MIMUW, University of Warsaw) | Monadic monadic second order logic |

mardi 05 novembre 2019 | David Janin (LaBRI) | An equational modeling of asynchronous concurrent programming |

mardi 22 octobre 2019 | Daniel Hausmann (Friedrich-Alexander University of Erlangen and Nürnberg) | Computing Nested Fixpoints in Quasipolynomial Time |

mardi 15 octobre 2019 | Engel Lefaucheux (MPI SWS) | Simple Priced Timed Games are not That Simple |

mardi 08 octobre 2019 | Guillaume Lagarde (LaBRI) | Tradeoff between size and degree in Polynomial Calculus Resolution |

mardi 01 octobre 2019 | Hugo Gimbert (CNRS, LaBRI) | Les algorithmes de Parcoursup |

mardi 24 septembre 2019 | Bruno Courcelle et Yves Métivier (LaBRI) | Arbres infinis réguliers et revêtements universels de graphes finis |

mardi 10 septembre 2019 | Anantha Padmanabha (IMSC, Chennai) | Two variable fragment of Term Modal logic |

mardi 09 juillet 2019 | Loïc Paulevé (CNRS, LaBRI) | Most permissive semantics of Boolean networks |

mardi 02 juillet 2019 | Sreejith A V (IIT Goa) | Block products for algebras over countable words |

mardi 25 juin 2019 | Yann Strozecki (Université de Versailles Saint-Quentin) | Solving Simple Stochastic Games with few RandomNodes faster using Bland’s Rule |

mardi 18 juin 2019 | Matthew Hague (University of London) | Generic and Complete Algorithms for Straight-Line String Constraints |

mardi 11 juin 2019 | Anca Muscholl (LaBRI) | The many facets of string transducers |

mardi 04 juin 2019 | Igor Walukiewicz (LaBRI) | LambdaY-calculus with priorities |

mardi 28 mai 2019 | Karoliina Lehtinen (University of Liverpool) | Parity, Buchi, Weak |

mardi 21 mai 2019 | Tobias Kappé (University College London) | Kleene Algebras |

mardi 14 mai 2019 | Joanna Ochremiak (CNRS, LaBRI) | On the power of symmetric linear programs |

mardi 07 mai 2019 | Charles Paperman (Université de Lille) | Topological Sorting under Regular Constraints |

mardi 30 avril 2019 | Pierre Clairambault (CNRS, ENS Lyon) | Linearity in Higher-Order Recursion Schemes |

mardi 16 avril 2019 | Uri Zwick (Tel Aviv University) | Faster k-SAT algorithms using biased-PPSZ |

mardi 09 avril 2019 | Donald Stull (Université de Lorraine, LORIA) | Selection, Divergence, and Dichotomy |

mardi 02 avril 2019 | Sarah Winter (RWTH Aachen) | Parameterized synthesis of sequential transducers from rational relations over finite words |

mardi 26 mars 2019 | Grégoire Sutre (LaBRI) | Reachability for Two-Counter Machines with One Test and One Reset |

mardi 19 mars 2019 | Vaishnavi Sundararajan (IRISA, Rennes) | A theory of assertions for Dolev-Yao models |

mardi 12 mars 2019 | Nathanaël Fijalkow (CNRS, LaBRI) | The complexity of mean payoff games using universal graphs |

mardi 05 mars 2019 | Bruno Courcelle (LaBRI) | Betweenness in order-theoretical trees |

mardi 12 février 2019 | Marc Noy (Universitat Politècnica de Catalunya) | Logic and random graphs |

lundi 11 février 2019 | Paul-Elliot Angles d'Auriac (Institut Camille Jordan, Lyon) | TBA |

mardi 05 février 2019 | Nathan Grosshans (ENS Paris) | The power of programs over monoids taken from some small varieties of finite monoids |

mardi 29 janvier 2019 | Meghyn Bienvenu (LaBRI) | Ontology-Mediated Query Answering with OWL 2 QL Ontologies: Combined Complexity and Succinctness of Rewritings |

mardi 22 janvier 2019 | Vincent Penelle (LaBRI) | On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems |

mardi 15 janvier 2019 | Marie van den Bogaard (Université Libre de Bruxelles) | Beyond admissibility: Dominance between chains of strategies |

mardi 08 janvier 2019 | Gabriele Puppis (LaBRI) | Unambiguous Register Automata |

mardi 18 décembre 2018 | David Carral (TU Dresden) | Reasoning over Existential Rules with Acyclicity Notions |

mardi 11 décembre 2018 | Filip Mazowiecki (LaBRI) | When are Emptiness and Containment Decidable for Probabilistic Automata? |

mardi 04 décembre 2018 | Nathanaël Fijalkow (LaBRI) | Data generation for programme synthesis |

mardi 20 novembre 2018 | Laurent Bienvenu (LaBRI) | Optimal bounds for single-source Kolmogorov extractors |

mardi 13 novembre 2018 | Sylvain Schmitz (LSV, ENS Cachan) | Complexity bounds for bisimulation equivalence in first-order grammars |

mardi 06 novembre 2018 | Jérôme Leroux (LaBRI) | The Reachability Problem for Petri Nets is Not Elementary |

mardi 23 octobre 2018 | Cristian Riveros (Pontificia Universidad Catolica de Chile) | Foundations of Complex Event Processing |

mardi 09 octobre 2018 | Marie Fortin (LSV, ENS Cachan) | It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before" |

mardi 02 octobre 2018 | A. V. Sreejith (IIT Goa) | Languages over countable linear orderings |

mardi 25 septembre 2018 | María Emilia Descotte (LaBRI) | Closure properties of synchronized relations |

mardi 03 juillet 2018 | Filip Murlak (University of Warsaw) | Ontology-mediated query answering for expressive description logics, or yet another family of (potentially) decidable fragments of first-order logic |

mardi 26 juin 2018 | Sébastien Labbé (LaBRI) | On Jeandel-Rao aperiodic tilings |

mardi 19 juin 2018 | František Blahoudek (Masaryk University) | Semi-deterministic automata: How to obtain and complement them |

mardi 12 juin 2018 | Bruno Guillon (University of Milan) | Undecidability of MSO+“ultimately periodic” |

mardi 05 juin 2018 | Laure Daviaud (University of Warwick) | A pseudo-quasi-polynomial algorithm for mean-payoff parity games |

mardi 22 mai 2018 | K. Narayan Kumar (Chennai Mathematical Institute) | Verification of Asynchronous Programs with Nested Locks |

mardi 15 mai 2018 | Madhavan Mukund (Chennai Mathematical Institut) | Modelling replicated data stores with multiple correctness levels |

mardi 24 avril 2018 | Armin Weiß (Stuttgart University) | The isomorphism problem for virtually free group |

mardi 17 avril 2018 | Pierre Ohlmann (IRIF, Paris 7) | Arithmetic circuits as automata, and applications |

mardi 10 avril 2018 | Nathanaël Fijalkow (LaBRI) | The State Complexity of Alternating Automata |

mardi 03 avril 2018 | Louis-Marie Dando (LaBRI) | On Rotating Q-Automata |

mardi 27 mars 2018 | Valia Mitsou (Université Paris Diderot, IRIF) | Limitations of treewidth for problems beyond NP. |

mardi 20 mars 2018 | Dominik Velan (Masaryk University) | Asymptotic Bounds on Termination Time in VASS |

mardi 13 mars 2018 | Jérôme Leroux (LaBRI) | Polynomial Vector Addition Systems With States |

mardi 06 mars 2018 | Pierre Casteran (LaBRI) | The hydra and the rooster |

mardi 27 février 2018 | María Emilia Descotte (LaBRI) | Resynchronizing Classes of Word Relations |

mardi 13 février 2018 | Michael Raskin (LaBRI) | Complementing the languages of unambigous automata |

mardi 06 février 2018 | Lukas Fleischer (Stuttgart University) | The Complexity of Decision Problems for Recognizing Morphisms |

mardi 30 janvier 2018 | David Janin (LaBRI) | Animation 3D et produit semi-direct |

mardi 23 janvier 2018 | Filip Mazowiecki (LaBRI) | Pumping lemmas for weighted automata |

mardi 09 janvier 2018 | Philippe Duchon (LaBRI) | Simulabilité à mémoire finie de lois de probabilités continues |

mardi 12 décembre 2017 | Cyril Gavoille (LaBRI) | La coloration de graphe dans le modèle LOCAL - Partie II |

mardi 05 décembre 2017 | Cyril Gavoille (LaBRI) | La coloration de graphe dans le modèle LOCAL - Partie I |

mardi 28 novembre 2017 | Ranko Lazic (Warwick University) | Succinct progress measures and solving parity games in quasi-polynomial time |

mardi 21 novembre 2017 | Angelo Montanari (University of Udine) | Model Checking: the Interval Way |

mardi 14 novembre 2017 | MF (LaBRI) | Reunion d'equipe MF |

mardi 07 novembre 2017 | Loïc Paulevé (LRI - Paris Sud) | Formal methods for capturing dynamics of biological networks |

mardi 31 octobre 2017 | Vincent Penelle (LaBRI) | Rewriting Higher-order Stack Trees |

mardi 24 octobre 2017 | Amina Doumane (LIP - ENS Lyon) | Constructive completeness for the linear-time mu-calculus |

mardi 17 octobre 2017 | David Janin (LaBRI) | Timed domains: an appetizer |

mardi 10 octobre 2017 | Miguel Romero (Oxford University) | The complexity of graph query languages |

mardi 03 octobre 2017 | Joanna Ochremiak (IRIF) | Proof complexity of constraint satisfaction problems |

mardi 26 septembre 2017 | Vincent Penelle (LaBRI) | Which classes of origin graph are generated by transducers? |

mardi 04 juillet 2017 | Stefan GRUNER (University of Pretoria, South Africa) | SAT-based Bounded Model Checking for 3-Valued Abstractions - Part II |

mardi 27 juin 2017 | Stefan GRUNER (University of Pretoria, South Africa) | SAT-based Bounded Model Checking for 3-Valued Abstractions |

mardi 13 juin 2017 | Emilia Descotte (UBA, Argentine) | Axiomatizations for downward XPath on Data Trees |

mardi 30 mai 2017 | Victor Marsault (University of Liège) | An efficient algorithm to decide the periodicity of b-recognisable sets using MSDF convention |

mardi 23 mai 2017 | Michael Raskin (LaBRI) | A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model |

mardi 16 mai 2017 | Igor Walukiewicz (LaBRI) | Proving safety of concurrent programs |

mardi 09 mai 2017 | Alain Finkel (LSV, ENS Cachan) | WBTS: the new class of WSTS without WQO. |

mardi 25 avril 2017 | Nathan Lhote (LaBRI) | On Reversible Transducers |

mardi 04 avril 2017 | Andrzej Murawski (University of Warwick) | Automata theory and game semantics of higher-order computation |

mardi 28 mars 2017 | David Janin (LaBRI) | Time domain (for time denotational semantics) |

mardi 21 mars 2017 | Laurent Bienvenu (LIRMM Montpellier) | Learning probability measures |

mardi 14 mars 2017 | Gabriele Puppis (LaBRI) | On the decomposition of finite-valued streaming string transducers |

mardi 07 mars 2017 | Charles Grellois (University of Bologna) | Verifying properties of functional programs: from the deterministic to the probabilistic case |

mardi 28 février 2017 | Emmanuel Fleury (LaBRI) | Digital Currencies |

mardi 14 février 2017 | Hugo Gimbert (LaBRI) | Emptiness of nonzero automata is decidable |

mardi 24 janvier 2017 | Rasmus Ibsen-Jensen (IST Austria) | Faster algorithms for program analysis |

mardi 10 janvier 2017 | B Srivathsan (CMI Chennai) | Why liveness for timed automata is hard, and what we can do about it |

- Méthodes Formelles 2016-....
- Graphes et Logique 2010-2015.
- Modélisation et Vérification 2010-2015.
- MVTsi 2009-2010.
- MVTsi 2008-2009.
- MVTsi 2007-2008.
- MVTsi 2006-2007.
- MVTsi 2005-2006.
- MVTsi 2004-2005.
- MVTsi 2003-2004.
- MVTsi 2002-2003.
- MVTsi 2001-2002.
- MVTsi 2000-2001.
- MVTsi 1999-2000.
- MVTsi 1998-1999.
- MVTsi 1997-1998.
- MVTsi 1996-1997.
- MVTsi 1995-1996.
- Sémantique du parallélisme 1994-1995.
- Sémantique du parallélisme 1993-1994.
- Sémantique du parallélisme 1992-1993.