Jean-Marc Talbot

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Two-Way Parikh Automata with a Visibly Pushdown Stack.

[BibT_eX]

[DOI]

Luc Dartois

Emmanuel Filiot

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

2018

Visibly pushdown transducers.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Decision problems of tree transducers with origin.

[BibT_eX]

[DOI]

Inf. Comput., 2018

2016

Visibly Pushdown Transducers with Well-Nested Outputs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2016

Analysis of access control policy updates through narrowing.

[BibT_eX]

[DOI]

Clara Bertolissi

Didier Villevalois

Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, 2016

A Generalised Twinning Property for Minimisation of Cost Register Automata.

[BibT_eX]

[DOI]

Laure Daviaud

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

Two-Way Visibly Pushdown Automata and Transducers.

[BibT_eX]

[DOI]

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

2015

Trimming visibly pushdown automata.

[BibT_eX]

[DOI]

Mathieu Caralp

Theor. Comput. Sci., 2015

2013

Expressiveness of Visibly Pushdown Transducers.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Second International Workshop on Trends in Tree Automata and Tree Transducers, 2013

2012

Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness.

[BibT_eX]

[DOI]

Mathieu Caralp

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011

An Accurate Type System for Information Flow in Presence of Arrays.

[BibT_eX]

[DOI]

Séverine Fratani

Proceedings of the Formal Techniques for Distributed Systems, 2011

2010

Tree Automata with Global Constraints.

[BibT_eX]

[DOI]

Emmanuel Filiot

Int. J. Found. Comput. Sci., 2010

On Functionality of Visibly Pushdown Transducers

[BibT_eX]

[DOI]

CoRR, 2010

Properties of Visibly Pushdown Transducers.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

Nested Sibling Tree Automata.

[BibT_eX]

[DOI]

Françoise Gire

RAIRO Theor. Informatics Appl., 2009

A Sound Analysis for Secure Information Flow Using Abstract Memory Graphs.

[BibT_eX]

[DOI]

Dorina Ghindici

Isabelle Simplot-Ryl

Proceedings of the Fundamentals of Software Engineering, 2009

2007

Polynomial time fragments of XPath with variables.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Satisfiability of a Spatial Logic with Tree Variables.

[BibT_eX]

[DOI]

Emmanuel Filiot

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

2006

Composing Monadic Queries in Trees.

[BibT_eX]

Proceedings of the PLAN-X 2006 Informal Proceedings, 2006

2005

When ambients cannot be opened.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Automata and Logics for Unranked and Unordered Trees.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

Monotone AC-Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2005

Expressiveness of a Spatial Logic for Trees.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

N-ary Queries by Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Semistructured Data, 6.-11. February 2005, 2005

Model-checking pour les ambients : des algèbres de processus aux données semi-structurées.

[BibT_eX]

[DOI]

, 2005

2004

On Complexity of Model-Checking for the TQL Logic.

[BibT_eX]

[DOI]

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003

Model checking mobile ambients.

[BibT_eX]

[DOI]

Silvano Dal-Zilio

Andrew D. Gordon

Supratik Mukhopadhyay

Theor. Comput. Sci., 2003

2002

Atomic Set Constraints with Projection.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

Finite-Control Mobile Ambients.

[BibT_eX]

[DOI]

Andrew D. Gordon

Proceedings of the Programming Languages and Systems, 2002

2001

The Complexity of Model Checking Mobile Ambients.

[BibT_eX]

[DOI]

Silvano Dal-Zilio

Andrew D. Gordon

Supratik Mukhopadhyay

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

The Decidability of Model Checking Mobile Ambients.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000

The forall-exists2 fragment of the first-order theory of atomic set constraints is Pi01-hard.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Generalized Definite Set Constraints.

[BibT_eX]

[DOI]

Constraints An Int. J., 2000

Paths vs. Trees in Set-Based Program Analysis.

[BibT_eX]

[DOI]

Andreas Podelski

Proceedings of the POPL 2000, 2000

On the Alternation-Free Horn Mu-calculus.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming and Automated Reasoning, 2000

1999

Entailment of Atomic Set Constraints is PSPACE-Complete.

[BibT_eX]

[DOI]

Joachim Niehren

Martin Müller

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998

Co-definite Set Constraints with Membership Expressions.

[BibT_eX]

Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, 1998

1997

Set-Based Analysis for Logic Programming and Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 4th International Symposium, 1997

Solving Classes of Set Constraints with Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

1996

On Theorem-Proving in Horn Theories with Built-in Algebras.

[BibT_eX]

[DOI]

Nirina Andrianarivelo

Wadoud Bousdira