Olivier Serre

C.-H. Luke Ong

ACM Trans. Comput. Log., 2021

Collapsible Pushdown Parity Games.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2021

Alternating Tree Automata with Qualitative Semantics.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2021

Lower Bounds for Arithmetic Circuits via the Hankel Matrix.

[BibT_eX]

[DOI]

Comput. Complex., 2021

Higher-order recursion schemes and their automata models.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Automata Theory., 2021

2020

How Good Is a Strategy in a Game with Nature?

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2020

Reasoning about strategies on collapsible pushdown arenas with imperfect information.

[BibT_eX]

[DOI]

Bastien Maubert

Aniello Murano

CoRR, 2020

2018

Pure Strategies in Imperfect Information Stochastic Games.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2018

Emptiness of Stack Automata is NEXPTIME-complete: A Correction.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Collapsible Pushdown Automata and Recursion Schemes.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2017

Counting branches in trees using games.

[BibT_eX]

[DOI]

Inf. Comput., 2017

C-SHORe: Higher-Order Verification via Collapsible Pushdown System Saturation.

[BibT_eX]

[DOI]

CoRR, 2017

Two-Way Two-Tape Automata.

[BibT_eX]

[DOI]

Olivier Carton

Léo Exibard

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2016

Marking shortest paths on pushdown graphs does not preserve MSO decidability.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015

Erratum for "Randomization in Automata on Infinite Trees".

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2015

Streaming Property Testing of Visibly Pushdown Languages.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2015

Counting Branches in Trees Using Games.

[BibT_eX]

[DOI]

CoRR, 2015

Playing with Trees and Logic.

[BibT_eX]

[DOI]

, 2015

2014

Randomization in Automata on Infinite Trees.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2014

2013

Introduction.

[BibT_eX]

[DOI]

Dietmar Berwanger

Tech. Sci. Informatiques, 2013

Pushdown module checking with imperfect information.

[BibT_eX]

[DOI]

Inf. Comput., 2013

C-SHORe: a collapsible approach to higher-order verification.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

Emptiness Of Alternating Tree Automata Using Games With Imperfect Information.

[BibT_eX]

[DOI]

Nathanaël Fijalkow

Sophie Pinchinat

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012

Parity games on undirected graphs.

[BibT_eX]

[DOI]

Dietmar Berwanger

Inf. Process. Lett., 2012

Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

A Saturation Method for Collapsible Pushdown Systems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Qualitative Tree Languages.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010

Recursion Schemes and Logical Reflection.

[BibT_eX]

[DOI]

C.-H. Luke Ong

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009

Qualitative Concurrent Games with Imperfect Information

[BibT_eX]

[DOI]

Vincent Gripon

CoRR, 2009

Qualitative Concurrent Stochastic Games with Imperfect Information.

[BibT_eX]

[DOI]

Vincent Gripon

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008

Winning Regions of Higher-Order Pushdown Games.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

µ-calculus Pushdown Module Checking with Imperfect State Information.

[BibT_eX]

[DOI]

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Tree Pattern Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2008

2007

Propositional dynamic logic with recursive programs.

[BibT_eX]

[DOI]

Carsten Lutz

J. Log. Algebraic Methods Program., 2007

2006

Games with winning conditions of high Borel complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Regularity Problems for Visibly Pushdown Languages.

[BibT_eX]

[DOI]

Vince Bárány

Proceedings of the STACS 2006, 2006

Parity Games Played on Transition Graphs of One-Counter Processes.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2006

Propositional Dynamic Logic with Recursive Programs.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2006

2004

Contribution à l'étude des jeux sur des graphes de processus à pile. (Contribution to pushdown games studies).

[BibT_eX]

[DOI]

PhD thesis, 2004

Vectorial languages and linear temporal logic.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Visibly Pushdown Games.

[BibT_eX]

[DOI]

P. Madhusudan

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003

Note on winning positions on pushdown games with [omega]-regular conditions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Pushdown Games with Unboundedness and Regular Conditions.

[BibT_eX]

[DOI]

Alexis-Julien Bouquet