Mots-clés

Identifiants chercheur

Nombre de documents

34

Ma liste de publications


Article dans une revue10 documents

Communication dans un congrès20 documents

  • Nathanaël François, Frédéric Magniez, Michel De Rougemont, Olivier Serre. Streaming Property Testing of Visibly Pushdown Languages *. Piotr Sankowski and Christos Zaroliagis. 24th Annual European Symposium on Algorithms (ESA 2016), Aug 2016, Aarhus, Denmark. Leibniz International Proceedings in Informatics (LIPIcs), 57, pp.17, Proceedings of the 24th Annual European Symposium on Algorithms (ESA 2016). 〈http://esa-symposium.org/index.php〉. 〈10.4230/LIPIcs.ESA.2016.43〉. 〈hal-01362276〉
  • 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, 2015, Proceedings of the 30th Annual IEEE Symposium on Logic in Computer Science (LiCS 2015). 〈10.1109/LICS.2015.62〉. 〈hal-01260696〉
  • 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. LLIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 24, pp.13, Proceedings of the 33rd International Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS 2013). 〈10.4230/LIPIcs.FSTTCS.2013.299〉. 〈hal-01260682〉
  • 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. ACM, pp.13-24, 2013, Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming (ICFP 2013). 〈10.1145/2500365.2500589〉. 〈hal-00865155〉
  • Arnaud Carayol, Olivier Serre. Collapsible pushdown automata and labeled recursion schemes. equivalence, safety and effective selection. 27th IEEE Symposium on Logic in Computer Science (LICS 2012), Jun 2012, Dubrovnik, Croatia. Logic in Computer Science (LICS), 2012 27th Annual IEEE Symposium on pp.165-174, 2012, 〈10.1109/LICS.2012.73〉. 〈hal-00733467〉
  • 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. Springer, 7392, pp.165-176, 2012, Lecture Notes in Computer Science. 〈10.1007/978-3-642-31585-5_18〉. 〈hal-00694991〉
  • 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, 2011, 〈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, 2010. 〈hal-00479818〉
  • Vincent Gripon, Olivier Serre. Qualitative Concurrent Stochastic Games with Imperfect Information. Susanne Albers and Alberto Marchetti-Spaccamela and Yossi Matias and Sotiris E. Nikoletseas and Wolfgang Thomas. Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Jul 2009, Rhodes, Greece. Springer, 5556, pp.200-211, 2009, Lecture Notes in Computer Science. 〈hal-00360857v3〉
  • 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. IEEE Computer Society, pp.452-461, 2008. 〈hal-00345945〉
  • Benjamin Aminof, Axel Legay, Aniello Murano, Olivier Serre. μ-Calculus Pushdown Module Checking with Imperfect State Information. Giorgio Ausiello, Juhani Karhumaki, Giancarlo Mauri and C.-H. Luke Ong. Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC1, Foundations of Computer Science, Sep 2008, Milano, Italy. Springer, 273, pp.333-348, 2008, IFIP. 〈hal-00345948〉
  • 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. IEEE Computer Society, pp.193-204, 2008. 〈hal-00345939〉
  • Blaise Genest, Anca Muscholl, Olivier Serre, Marc Zeitoun. Tree Pattern Rewriting Systems. Automated Technology for Verification and Analysis, 2008, Séoul, South Korea. 5311, pp.332-346, 2008, Lecture Notes in Computer Science. 〈10.1007/978-3-540-88387-6_29〉. 〈hal-00344551〉
  • Christof Loeding, Olivier Serre. Propositional Dynamic Logic with Recursive Programs. L. Aceto and A. Ingolfsdottir. FOSSACS 2006: Foundations of Software Science and Computation Structures, 2006, Vienna, Austria. Springer Verlag, pp.292-306, 2006, LNCS 3921. 〈hal-00016667〉
  • Vince Bárány, Christof Loeding, Olivier Serre. Regularity Problems for Visibly Pushdown Languages. Brunaud Durand and Wolfgang Thomas. 23rd International Symposium on Theoretical Aspects of Computer Science, STACS 2006, 2006, Marseille, France. Springer Verlag, pp.420-431, 2006, LNCS. 〈hal-00016661〉
  • Olivier Serre. Parity games played on transition graphs of one-counter processes. L. Aceto and A. Ingolfsdottir. FOSSACS 2006: Foundations of Software Science and Computation Structures, 2006, Vienna, Austria. Springer Verlag, pp.337-351, 2006, LNCS 3921. 〈hal-00016665〉
  • Olivier Serre. Games with Winning Conditions of High Borel Complexity. Josep Diaz and Juhani Karhumaki and Arto Lepisto and Donald Sannella. Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004, 2004, Turku, Finland. Springer Verlag, pp.1150-1162, 2004, Volume 3142 of Lecture Notes in Computer Sciences. 〈hal-00012134〉
  • Christof Loeding, Parthasarathy Madhusudan, Olivier Serre. Visibly Pushdown Games. Kamal Lodaya, Meena Mahajan. FST TCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th Conference, 2004, Chennai, India. Springer Verlag, pp.408-420, 2004, Volume 3328 of Lecture Notes in Computer Sciences. 〈hal-00012137〉
  • Alexis-Julien Bouquet, Olivier Serre, Igor Walukiewicz. Pushdown games with unboundedness and regular conditions. Paritosh K. Pandya, Jaikumar Radhakrishnan. FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, 2003, Mumbai, India. Springer Verlag, pp.88-99, 2003, Volume 2914 of Lecture Notes in Computer Sciences, pages 88-99. 〈hal-00012141〉
  • Olivier Serre. Vectorial Languages and Linear Temporal Logic. Kluwer Academic. 2nd IFIP International Conference Theoretical Computer Science (TCS@2002), 2002, Montreal, Canada. Kluwer, pp.576-587, 2002, volume 223 of IFIP Conference Proceedings. 〈hal-00012656〉

Pré-publication, Document de travail1 document

  • Benjamin Aminof, Axel Legay, Aniello Murano, Olivier Serre, Moshe Vardi. Pushdown Module Checking with Imperfect Information. 2010. 〈hal-00479839v2〉

Rapport1 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〉

Thèse1 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〉

HDR1 document

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