Olivier Serre

Identifiants chercheurs

IdHAL :

olivier-serre

ORCID :

0000-0001-5936-240X

IdRef :

089054407

Présentation

Publications

Ouvrages (2)

Games on Graphs Nathanaël Fijalkow,Nathalie Bertrand,Patricia Bouyer,Romain Brenguier,Arnaud Carayolet al. pp.1-491, In press, ⟨10.48550/arXiv.2305.10546⟩ Ouvrages hal-04273394v1
Les décodeuses du numérique Léa Castor,Célia Esnoult,Laure Thiébault,Ali Charara,Olivier Serreet al. CNRS Editions, 2021, 2271139481 Ouvrages hal-03661197v1

Article dans une revue (16)

Lower Bounds for Arithmetic Circuits via the Hankel Matrix Nathanaël Fijalkow,Guillaume Lagarde,Pierre Ohlmann,Olivier Serre Computational Complexity, 2021, 30 (2), ⟨10.1007/s00037-021-00214-1⟩ Article dans une revue hal-03383188v1
Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties Christopher H. Broadbent,Arnaud Carayol,C. -H. Luke Ong,Olivier Serre ACM Transactions on Computational Logic, 2021, 22 (2), ⟨10.1145/3452917⟩ Article dans une revue hal-03014425v1
Collapsible Pushdown Parity Games Christopher H. Broadbent,Arnaud Carayol,Matthew Hague,Andrzej S. Murawski,C. -H. Luke Onget al. ACM Transactions on Computational Logic, 2021, 22 (3), pp.16:1-16:51. ⟨10.1145/3457214⟩ Article dans une revue hal-03014435v1
How Good Is a Strategy in a Game with Nature? Arnaud Carayol,Olivier Serre ACM Transactions on Computational Logic, 2020, 21 (3), pp.21:1-21:39. ⟨10.1145/3377137⟩ Article dans une revue hal-02487233v1
Alternating Tree Automata with Qualitative Semantics Raphaël Berthon,Nathanaël Fijalkow,Emmanuel Filiot,Shibashis Guha,Bastien Maubertet al. ACM Transactions on Computational Logic, 2020, 22 (1), ⟨10.1145/3431860⟩ Article dans une revue hal-02533936v1
Pure Strategies in Imperfect Information Stochastic Games Arnaud Carayol,Christof Löding,Olivier Serre Fundamenta Informaticae, 2018, 160 (4), pp.361-384. ⟨10.3233/FI-2018-1687⟩ Article dans une revue hal-01831546v1
Collapsible Pushdown Automata and Recursion Schemes Matthew Hague,Andrzej S Murawski,C.-H. Luke Ong,Olivier Serre ACM Transactions on Computational Logic, 2017 Article dans une revue hal-01563202v2
Counting Branches in Trees Using Games Arnaud Carayol,Olivier Serre Information and Computation, 2017, 252, pp.221-242. ⟨10.1016/j.ic.2016.11.005⟩ Article dans une revue hal-01563189v1
Marking shortest paths on pushdown graphs does not preserve MSO decidability Arnaud Carayol,Olivier Serre Information Processing Letters, 2016, 116 (10), pp.638-643. ⟨10.1016/j.ipl.2016.04.015⟩ Article dans une revue hal-01362289v1
Randomisation in Automata on Infinite Trees Arnaud Carayol,Axel Haddad,Olivier Serre ACM Transactions on Computational Logic, 2014, 15 (3), pp.24. ⟨10.1145/2629336⟩ Article dans une revue hal-01260669v1
Pushdown Module Checking with Imperfect Information Benjamin Aminof,Axel Legay,Aniello Murano,Olivier Serre,Moshe Vardi Information and Computation, 2013, 223, pp.18. ⟨10.1016/j.ic.2012.11.005⟩ Article dans une revue hal-01260664v1
Parity Games on Undirected Graphs Dietmar Berwanger,Olivier Serre Information Processing Letters, 2012, 112 (23), pp.5. ⟨10.1016/j.ipl.2012.08.021⟩ Article dans une revue hal-01260646v1
Propositional Dynamic Logic with Recursive Programs Christof Loeding,Carsten Lutz,Olivier Serre Journal of Logic and Algebraic Programming, 2007, 73 (1-2), pp.51-69. ⟨10.1016/j.jlap.2006.11.003⟩ Article dans une revue hal-00153571v1
Games with Winning Conditions of High Borel Complexity Olivier Serre Theoretical Computer Science, 2006, 350 (2-3), pp.345-372. ⟨10.1016/j.tcs.2005.10.024⟩ Article dans une revue hal-00012136v1
Vectorial Languages and Linear Temporal Logic Olivier Serre Theoretical Computer Science, 2004, 310/1-3, pp.79-116. ⟨10.1016/S0304-3975(03)00346-3⟩ Article dans une revue hal-00012658v1
Note on winning positions on pushdown games with omega-regular winning conditions Olivier Serre Information Processing Letters, 2003, 85, pp.285-291. ⟨10.1016/S0020-0190(02)00445-3⟩ Article dans une revue hal-00009319v1

Chapitre d'ouvrage (1)

Higher-order recursion schemes and their automata models Arnaud Carayol,Olivier Serre Jean-Éric Pin. Handbook of Automata Theory, 2, European Mathematical Society, pp.1295-1341, 2021, 978-3-98547-006-8 Chapitre d'ouvrage hal-03176662v1

Communication dans un congrès (23)

Lower Bounds for Arithmetic Circuits via the Hankel Matrix Nathanaël Fijalkow,Guillaume Lagarde,Pierre Ohlmann,Olivier Serre 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Mar 2020, Montpellier, France. pp.24:1-24:17, ⟨10.4230/LIPIcs.STACS.2020.24⟩ Communication dans un congrès hal-02440692v1
Two-Way Two-Tape Automata Olivier Carton,Léo Exibard,Olivier Serre Developments in Language Theory - 21st International Conference (DLT 2017), Aug 2017, Liège, Belgium. pp.147-159 Communication dans un congrès hal-02112626v1
Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings Arnaud Carayol,Christof Löding,Olivier Serre LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2016, New York, United States. pp.227-236, ⟨10.1145/2933575.2934504⟩ Communication dans un congrès hal-01804545v1
Streaming Property Testing of Visibly Pushdown Languages * Nathanaël François,Frédéric Magniez,Michel de Rougemont,Olivier Serre 24th Annual European Symposium on Algorithms (ESA 2016), Aug 2016, Aarhus, Denmark. pp.17, ⟨10.4230/LIPIcs.ESA.2016.43⟩ Communication dans un congrès hal-01362276v1
How Good Is a Strategy in a Game with Nature? Arnaud Carayol,Olivier Serre 30th Annual IEEE Symposium on Logic in Computer Science (LiCS 2015), 2015, Kyoto, Japan. pp.12, ⟨10.1109/LICS.2015.62⟩ Communication dans un congrès hal-01260696v1
Emptiness Of Alternating Tree Automata Using Games With Imperfect Information Nathanaël Fijalkow,Sophie Pinchinat,Olivier Serre 33rd International Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS 2013), 2013, Guwahati, India. pp.13, ⟨10.4230/LIPIcs.FSTTCS.2013.299⟩ Communication dans un congrès hal-01260682v2
C-SHORe: a collapsible approach to higher-order verification Christopher H. Broadbent,Arnaud Carayol,Matthew Hague,Olivier Serre ACM SIGPLAN International Conference on Functional Programming (ICFP'13), Sep 2013, Boston, MA, United States. pp.13-24, ⟨10.1145/2500365.2500589⟩ Communication dans un congrès hal-00865155v1
Collapsible pushdown automata and labeled recursion schemes. equivalence, safety and effective selection Arnaud Carayol,Olivier Serre LICS 2012, Jun 2012, Dubrovnik, Croatia. pp.165-174, ⟨10.1109/LICS.2012.73⟩ Communication dans un congrès hal-00733467v1
A Saturation Method for Collapsible Pushdown Systems Christopher Broadbent,Arnaud Carayol,Matthew Hague,Olivier Serre Automata, Languages and Programming, 39th International Colloquium, ICALP 2012, 2012, Warwick, United Kingdom. pp.165-176, ⟨10.1007/978-3-642-31585-5_18⟩ Communication dans un congrès hal-00694991v1
Qualitative Tree Languages Arnaud Carayol,Axel Haddad,Olivier Serre Twenty-Sixth Annual IEEE Symposium on Logic in Computer Science (LICS 2011), 2011, Toronto, Canada. pp.13-22, ⟨10.1109/LICS.2011.28⟩ Communication dans un congrès hal-00616304v1
Recursion Schemes and Logical Reflection Christopher Broadbent,Arnaud Carayol,Luke Ong,Olivier Serre Twenty-Fifth Annual IEEE Symposium on Logic in Computer Science (LICS 2010), 2010, Edinburgh, United Kingdom. pp.120-129 Communication dans un congrès hal-00479818v1
Qualitative Concurrent Stochastic Games with Imperfect Information Vincent Gripon,Olivier Serre Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Jul 2009, Rhodes, Greece. pp.200-211 Communication dans un congrès hal-00360857v3
μ-Calculus Pushdown Module Checking with Imperfect State Information Benjamin Aminof,Axel Legay,Aniello Murano,Olivier Serre Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC1, Foundations of Computer Science, Sep 2008, Milano, Italy. pp.333-348 Communication dans un congrès hal-00345948v1
Winning regions of higher-order pushdown games Arnaud Carayol,Matthew Hague,Antoine Meyer,Luke Ong,Olivier Serre Twenty-Third Annual IEEE Symposium on Logic in Computer Science (LICS 2008), Jun 2008, Pittsburgh, United States. pp.193-204 Communication dans un congrès hal-00345939v1
Tree Pattern Rewriting Systems Blaise Genest,Anca Muscholl,Olivier Serre,Marc Zeitoun Automated Technology for Verification and Analysis, 2008, Séoul, South Korea. pp.332-346, ⟨10.1007/978-3-540-88387-6_29⟩ Communication dans un congrès hal-00344551v1
Collapsible Pushdown Automata and Recursion Schemes Matthew Hague,Andrzej Murawski,Luke Ong,Olivier Serre Twenty-Third Annual IEEE Symposium on Logic in Computer Science (LICS 2008), Jun 2008, Pittsburgh, United States. pp.452-461 Communication dans un congrès hal-00345945v1
Regularity Problems for Visibly Pushdown Languages Vince Bárány,Christof Loeding,Olivier Serre 23rd International Symposium on Theoretical Aspects of Computer Science, STACS 2006, 2006, Marseille, France. pp.420-431 Communication dans un congrès hal-00016661v1
Propositional Dynamic Logic with Recursive Programs Christof Loeding,Olivier Serre FOSSACS 2006: Foundations of Software Science and Computation Structures, 2006, Vienna, Austria. pp.292-306 Communication dans un congrès hal-00016667v1
Parity games played on transition graphs of one-counter processes Olivier Serre FOSSACS 2006: Foundations of Software Science and Computation Structures, 2006, Vienna, Austria. pp.337-351 Communication dans un congrès hal-00016665v1
Games with Winning Conditions of High Borel Complexity Olivier Serre Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004, 2004, Turku, Finland. pp.1150-1162 Communication dans un congrès hal-00012134v1
Visibly Pushdown Games Christof Loeding,Parthasarathy Madhusudan,Olivier Serre FST TCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th Conference, 2004, Chennai, India. pp.408-420 Communication dans un congrès hal-00012137v1
Pushdown games with unboundedness and regular conditions Alexis-Julien Bouquet,Olivier Serre,Igor Walukiewicz FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, 2003, Mumbai, India. pp.88-99 Communication dans un congrès hal-00012141v1
Vectorial Languages and Linear Temporal Logic Olivier Serre 2nd IFIP International Conference Theoretical Computer Science (TCS@2002), 2002, Montreal, Canada. pp.576-587 Communication dans un congrès hal-00012656v1

Pré-publication, Document de travail (2)

Reasoning about strategies on collapsible pushdown arenas with imperfect information Bastien Maubert,Aniello Murano,Olivier Serre 2020 Pré-publication, Document de travail hal-03014438v1
Pushdown Module Checking with Imperfect Information Benjamin Aminof,Axel Legay,Aniello Murano,Olivier Serre,Moshe Vardi 2010 Pré-publication, Document de travail hal-00479839v2

Rapport (1)

Emptiness Of Alternating Parity Tree Automata Using Games With Imperfect Information Sophie Pinchinat,Olivier Serre [Research Report] PI-1992, 2012, pp.6 Rapport (rapport de recherche) hal-00700334v1

Thèse (1)

Contribution à l'étude des jeux sur des graphes de processus à pile Olivier Serre Autre [cs.OH]. Université Paris VIII Vincennes-Saint Denis, 2004. Français. ⟨NNT : ⟩ Thèse tel-00011326v1

HDR (1)

Playing with Trees and Logic Olivier Serre Logic in Computer Science [cs.LO]. Université Paris Diderot — Paris 7, 2015 HDR tel-01260775v1