Skip to Main content

Keywords

Researcher identifiers

Export Publications

Export the displayed publications:
Number of documents

45

Ma liste de publications


Journal articles16 documents

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

Book sections1 document

Conference papers23 documents

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

Preprints, Working Papers, ...2 documents

  • Bastien Maubert, Aniello Murano, Olivier Serre. Reasoning about strategies on collapsible pushdown arenas with imperfect information. 2020. ⟨hal-03014438⟩
  • Benjamin Aminof, Axel Legay, Aniello Murano, Olivier Serre, Moshe Vardi. Pushdown Module Checking with Imperfect Information. 2010. ⟨hal-00479839v2⟩

Reports1 document

  • Sophie Pinchinat, Olivier Serre. Emptiness Of Alternating Parity Tree Automata Using Games With Imperfect Information. [Research Report] PI-1992, 2012, pp.6. ⟨hal-00700334⟩

Theses1 document

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

Habilitation à diriger des recherches1 document

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