Arnaud Carayol

and

J. Log. Algebr. Meth. Program., 2017

Counting branches in trees using games.

(DOI)

and

Inf. Comput., 2017

Preface.

(DOI)

David Baelde

Ralph Matthes

and

Igor Walukiewicz

Fundam. Inform., 2017

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

(DOI)

and

CoRR, 2017

On Long Words Avoiding Zimin Patterns.

(DOI)

and

Stefan Göller

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

2016

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

(DOI)

and

Inf. Process. Lett., 2016

Algebraic Synchronization Trees and Processes.

(DOI)

Luca Aceto

and

Anna Ingólfsdóttir

CoRR, 2016

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

(DOI)

Christof Löding

and

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

An Analysis of the Equational Properties of the Well-Founded Fixed Point.

(DOI)

and

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

2015

Erratum for "Randomization in Automata on Infinite Trees".

(DOI)

Axel Haddad

and

ACM Trans. Comput. Log., 2015

Marking Shortest Paths On Pushdown Graphs Does Not Preserve MSO Decidability.

(DOI)

and

CoRR, 2015

Pure Strategies in Imperfect Information Stochastic Games.

(DOI)

Christof Löding

and

CoRR, 2015

Counting Branches in Trees Using Games.

(DOI)

Axel Haddad

and

CoRR, 2015

An analysis of the equational properties of the well-founded fixed point.

(DOI)

and

CoRR, 2015

How Good Is a Strategy in a Game with Nature?

(DOI)

and

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014

Randomization in Automata on Infinite Trees.

(DOI)

Axel Haddad

and

ACM Trans. Comput. Log., 2014

Saturation algorithms for model-checking pushdown systems.

(DOI)

and

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Regular Strategies in Pushdown Reachability Games.

(DOI)

and

Proceedings of the Reachability Problems - 8th International Workshop, 2014

2013

The FC-rank of a context-free language.

(DOI)

and

Inf. Process. Lett., 2013

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

(DOI)

and

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

2012

The FC-rank of a context-free language

(DOI)

and

CoRR, 2012

Distribution of the number of accessible states in a random deterministic automaton.

(DOI)

and

Cyril Nicaud

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

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

(DOI)

and

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

A Context-Free Linear Ordering with an Undecidable First-Order Theory.

(DOI)

and

Proceedings of the Theoretical Computer Science, 2012

A Saturation Method for Collapsible Pushdown Systems.

(DOI)

and

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

Algebraic Synchronization Trees and Processes.

(DOI)

Luca Aceto

and

Anna Ingólfsdóttir

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

2011

Qualitative Tree Languages.

(DOI)

Axel Haddad

and

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

2010

Recursion Schemes and Logical Reflection.

(DOI)

C.-H. Luke Ong

and

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

Linear Orders in the Pushdown Hierarchy.

(DOI)

Laurent Braud

and

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2008

Positional Strategies for Higher-Order Pushdown Parity Games.

(DOI)

and

Michaela Slaats

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Winning Regions of Higher-Order Pushdown Games.

(DOI)

C.-H. Luke Ong

and

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

2007

Linearly bounded infinite graphs

(DOI)

and

CoRR, 2007

MSO on the Infinite Binary Tree: Choice and Order.

(DOI)

and

Christof Löding

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006

Automates infinis, logiques et langages.

(DOI)

PhD thesis, 2006

Context-Sensitive Languages, Rational Graphs and Determinism.

(DOI)

and

Logical Methods in Computer Science, 2006

Context-Sensitive Languages, Rational Graphs and Determinism

(DOI)

and

CoRR, 2006

Linearly bounded infinite graphs.

(DOI)

and

Acta Inf., 2006

The Kleene Equality for Graphs.

(DOI)

and

Didier Caucal

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

On Rational Trees.

(DOI)

and

Christophe Morvan

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005

On the representation of McCarthy's amb in the Pi-calculus.

(DOI)

Daniel Hirschkoff

and

Davide Sangiorgi

Theor. Comput. Sci., 2005

Linearly Bounded Infinite Graphs.

(DOI)

and

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Regular Sets of Higher-Order Pushdown Stacks.

(DOI)

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004

On the Representation of McCarthy's amb in the -calculus.

(DOI)

Daniel Hirschkoff

and

Davide Sangiorgi

Electr. Notes Theor. Comput. Sci., 2004

2003

On Equivalent Representations of Infinite Structures.

(DOI)

and

Thomas Colcombet

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata.

(DOI)