2017/07/04 | Quantitative Evaluation of Systems via Weighted Logics and Weighted Automata | GT SDA2 (Marseille) |
2017/05/19 | Optimal Reachability in Divergent Weighted Games | Seminar of Centre Fédéré en Vérification (Brussels) |
2015/03/30 | Metric Interval Temporal Logic Revisited | Seminar MOVE (Marseille) |
2016/09/08 | Real-Time Synthesis is Hard! | Highlights Conference (Brussels) |
2016/05/02 | To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games | LACL Seminar (Créteil) |
2016/02/04 | Logics for Weighted Automata and Transducers | LDP-MOVE Seminar (Marseille) |
2015/12/19 | Efficient Reactive Synthesis of MITL Properties | AVeRTS Workshop (Bangalore) |
2015/12/17 | Simple Priced Timed Games Are Not That Simple | 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Bangalore) |
2015/12/15 | Logics for Weighted Automata and Transducers | Infinity Workshop (Bangalore) |
2015/11/26 | Interval Iteration Algorithm for MDPs and IMDPs | Seminar MOVE (Marseille) |
2015/09/17 | To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games | Seminar MOVE (Marseille) |
2015/09/02 | To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games | 26th International Conference on Concurrency Theory CONCUR (Madrid) |
2015/02/05 | Why Negatively-Priced Timed Games are Hard? | Workshop Non-Zero-Sum Games and Control (Dagstuhl) |
2014/10/30 | Reachability in MDPs: Refining Convergence of Value Iteration | Fourth Cassting Meeting (Aachen) |
2014/09/22 | Reachability in MDPs: Refining Convergence of Value Iteration | 8th International Workshop on Reachability Problems (Oxford) |
2014/09/03 | Adding Negative Prices to Priced Timed Games | Highlights Conference (Paris) |
2014/07/15 | Logical Characterization of Weighted Pebble Automata Navigating over Graphs | Joint meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (Vienna) |
2014/05/21 | Priced Timed Games with Negative Costs | Third Cassting Meeting (Bruxelles) |
2014/05/05 | Logical Characterization of Weighted Pebble Automata Navigating over Graphs | 7th International Workshop Weighted Automata, Theory and Applications (Leipzig) |
2014/04/12 | Weighted Timed Games: Positive Results with Negative Costs | 1st Cassting Workshop ETAPS 2014 (Grenoble) |
2014/01/29 | Spécification et vérification de propriétés quantitatives | Journées Nationales du Groupe de Recherche Informatique et Mathématiques (Paris) |
2014/01/23 | Weighted Hybrid Logics | Workshop Quantitative Models: Expressiveness, Analysis and New Applications (Dagstuhl) |
2013/12/05 | Specification and Verification of Quantitative Properties: Expressions, Logics, and Automata | Séminaire LIF MoVe (Marseille) |
2013/10/24 | Specification and Verification of Quantitative Properties: Expressions, Logics, and Automata | PhD Defense (Cachan) |
2013/07/02 | Specification of Quantitative Properties: Logics, Automata, Expressions | Séminaire LaBRI Graphes et Logique (Bordeaux) |
2013/06/20 | A Fresh Approach to Learning Register Automata | DLT 2013 (Marne la Vallée) |
2013/06/12 | A Fresh Approach to Learning Register Automata | GdT Mexico/Tempo (Cachan) |
2013/03/20 | Weighted Specifications over Nested Words | FoSSaCS 2013 (Roma) |
2013/03/01 | Weighted Specifications over Nested Words | Séminaire LIAFA Automates et Applications (Paris) |
2013/01/16 | Weighted and Probabilistic Specifications: Efficient Computations with Pebbles | MOVES Seminar (Aachen) |
2012/12/05 | A Probabilistic Kleene Theorem | PhD School Movep 2012 (Marseille) |
2012/11/19 | Machine Learning | PhD Seminar LSV (Cachan) |
2012/10/06 | A Probabilistic Kleene Theorem | ATVA 2012 (Trivandrum (Inde)) |
2012/07/12 | Efficient Computations with Pebbles | Seminar ISP (Lübeck) |
2012/05/31 | A Probabilistic Kleene Theorem | Workshop WATA 2012 (Dresden) |
2012/03/07 | Analytic Combinatorics | PhD Seminar LSV (Cachan) |
2011/10/13 | Weighted Expressions and Pebble Automata over Nested Words and Trees | Séminaire Modélisation et Vérification LaBRI (Bordeaux) |
2011/02/03 | Weighted Depth-First-Search Automata | Quasimodo Meeting (Saarbrücken) |
2010/11/30 | Parikh Images of Grammars: Complexity and Applications | Working group Infini LSV (Cachan) |
2010/07/10 | Pebble weighted automata and transitive closure | ICALP 2010 (Bordeaux) |