On Theorem-Proving in Horn Theories with Built-in Algebras. - Nirina Andrianarivelo; Wadoud Bousdira; Jean-Marc Talbot (AISMC, 1996)

Solving Classes of Set Constraints with Tree Automata. - Philippe Devienne; Jean-Marc Talbot; Sophie Tison (CP, 1997)

Set-Based Analysis for Logic Programming and Tree Automata. - Jean-Marc Talbot; Sophie Tison; Philippe Devienne (SAS, 1997)

Co-definite Set Constraints with Membership Expressions. - Philippe Devienne; Jean-Marc Talbot; Sophie Tison (IJCSLP, 1998)

Entailment of Atomic Set Constraints is PSPACE-Complete. - Joachim Niehren; Martin Müller 001; Jean-Marc Talbot (LICS, 1999)

On the Alternation-Free Horn Mu-calculus. - Jean-Marc Talbot (LPAR, 2000)

Paths vs. Trees in Set-Based Program Analysis. - Witold Charatonik; Andreas Podelski; Jean-Marc Talbot (POPL, 2000)

Generalized Definite Set Constraints. - Jean-Marc Talbot; Philippe Devienne; Sophie Tison (Constraints An Int. J., 2000)

The forall-exists2 fragment of the first-order theory of atomic set constraints is Pi01-hard. - Jean-Marc Talbot (Inf. Process. Lett., 2000)

The Decidability of Model Checking Mobile Ambients. - Witold Charatonik; Jean-Marc Talbot (CSL, 2001)

The Complexity of Model Checking Mobile Ambients. - Witold Charatonik; Silvano Dal-Zilio; Andrew D. Gordon 001; Supratik Mukhopadhyay; Jean-Marc Talbot (FoSSaCS, 2001)

Finite-Control Mobile Ambients. - Witold Charatonik; Andrew D. Gordon 001; Jean-Marc Talbot (ESOP, 2002)

Atomic Set Constraints with Projection. - Witold Charatonik; Jean-Marc Talbot (RTA, 2002)

Model checking mobile ambients. - Witold Charatonik; Silvano Dal-Zilio; Andrew D. Gordon 001; Supratik Mukhopadhyay; Jean-Marc Talbot (Theor. Comput. Sci., 2003)

On Complexity of Model-Checking for the TQL Logic. - Iovka Boneva; Jean-Marc Talbot (IFIP TCS, 2004)

Model-checking pour les ambients : des algèbres de processus aux données semi-structurées. - Jean-Marc Talbot (2005)

N-Ary Queries by Tree Automata. - Joachim Niehren; Laurent Planque; Jean-Marc Talbot; Sophie Tison (DBPL, 2005)

Expressiveness of a Spatial Logic for Trees. - Iovka Boneva; Jean-Marc Talbot; Sophie Tison (LICS, 2005)

Monotone AC-Tree Automata. - Hitoshi Ohsaki; Jean-Marc Talbot; Sophie Tison; Yves Roos (LPAR, 2005)

Automata and Logics for Unranked and Unordered Trees. - Iovka Boneva; Jean-Marc Talbot (RTA, 2005)

When ambients cannot be opened. - Iovka Boneva; Jean-Marc Talbot (Theor. Comput. Sci., 2005)

Composing Monadic Queries in Trees. - Emmanuel Filiot; Joachim Niehren; Jean-Marc Talbot; Sophie Tison (PLAN-X, 2006)

Satisfiability of a Spatial Logic with Tree Variables. - Emmanuel Filiot; Jean-Marc Talbot; Sophie Tison (CSL, 2007)

Polynomial time fragments of XPath with variables. - Emmanuel Filiot; Joachim Niehren; Jean-Marc Talbot; Sophie Tison (PODS, 2007)

A Sound Analysis for Secure Information Flow Using Abstract Memory Graphs. - Dorina Ghindici; Isabelle Simplot-Ryl; Jean-Marc Talbot (FSEN, 2009)

Nested Sibling Tree Automata. - Françoise Gire; Jean-Marc Talbot (RAIRO Theor. Informatics Appl., 2009)

Properties of Visibly Pushdown Transducers. - Emmanuel Filiot; Jean-François Raskin; Pierre-Alain Reynier; Frédéric Servais; Jean-Marc Talbot (MFCS, 2010)

On Functionality of Visibly Pushdown Transducers - Emmanuel Filiot; Jean-François Raskin; Pierre-Alain Reynier; Frédéric Servais; Jean-Marc Talbot (CoRR, 2010)

Tree Automata with Global Constraints. - Emmanuel Filiot; Jean-Marc Talbot; Sophie Tison (Int. J. Found. Comput. Sci., 2010)

An Accurate Type System for Information Flow in Presence of Arrays. - Séverine Fratani; Jean-Marc Talbot (FMOODS/FORTE, 2011)

Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness. - Mathieu Caralp; Pierre-Alain Reynier; Jean-Marc Talbot (Developments in Language Theory, 2012)

Expressiveness of Visibly Pushdown Transducers. - Mathieu Caralp; Emmanuel Filiot; Pierre-Alain Reynier; Frédéric Servais; Jean-Marc Talbot (TTATT, 2013)

Trimming visibly pushdown automata. - Mathieu Caralp; Pierre-Alain Reynier; Jean-Marc Talbot (Theor. Comput. Sci., 2015)

Two-Way Visibly Pushdown Automata and Transducers. - Luc Dartois; Emmanuel Filiot; Pierre-Alain Reynier; Jean-Marc Talbot (LICS, 2016)

A Generalised Twinning Property for Minimisation of Cost Register Automata. - Laure Daviaud; Pierre-Alain Reynier; Jean-Marc Talbot (LICS, 2016)

Analysis of access control policy updates through narrowing. - Clara Bertolissi; Jean-Marc Talbot; Didier Villevalois (PPDP, 2016)

Visibly Pushdown Transducers with Well-Nested Outputs. - Pierre-Alain Reynier; Jean-Marc Talbot (Int. J. Found. Comput. Sci., 2016)

Decision problems of tree transducers with origin. - Emmanuel Filiot; Sebastian Maneth; Pierre-Alain Reynier; Jean-Marc Talbot (Inf. Comput., 2018)

Visibly pushdown transducers. - Emmanuel Filiot; Jean-François Raskin; Pierre-Alain Reynier; Frédéric Servais; Jean-Marc Talbot (J. Comput. Syst. Sci., 2018)

Two-Way Parikh Automata with a Visibly Pushdown Stack. - Luc Dartois; Emmanuel Filiot; Jean-Marc Talbot (FoSSaCS, 2019)

Determinisation of Finitely-Ambiguous Copyless Cost Register Automata. - Théodore Lopez; Benjamin Monmege; Jean-Marc Talbot (MFCS, 2019)

Weighted Automata and Expressions over Pre-Rational Monoids. - Nicolas Baudru; Louis-Marie Dando; Nathan Lhote; Benjamin Monmege; Pierre-Alain Reynier; Jean-Marc Talbot (CSL, 2022)

Solving Access Control Conflicts in Multi-User Systems. - Alba Martinez Anton; Clara Bertolissi; Jean-Marc Talbot (SECRYPT, 2024)

Regular D-length: A tool for improved prefix-stable forward Ramsey factorisations. - Théodore Lopez; Benjamin Monmege; Jean-Marc Talbot (Inf. Process. Lett., 2025)