Jean-Marc Talbot

Publication Activity (10 Years)

Years Active: 1996-2022
Publications (10 Years): 13

Top Topics

Regular Expressions

Monte Carlo Search

Decision Problems

Top Venues

Developments in Language Theory

J. Comput. Syst. Sci.

Publications

Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, Jean-Marc Talbot
Weighted Automata and Expressions over Pre-Rational Monoids. CSL (2022)
Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, Jean-Marc Talbot
Weighted Automata and Expressions over Pre-Rational Monoids. CoRR (2021)
Théodore Lopez, Benjamin Monmege, Jean-Marc Talbot
Determinisation of Finitely-Ambiguous Copyless Cost Register Automata. MFCS (2019)
Luc Dartois, Emmanuel Filiot, Jean-Marc Talbot
Two-Way Parikh Automata with a Visibly Pushdown Stack. FoSSaCS (2019)
Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
Visibly pushdown transducers. J. Comput. Syst. Sci. 97 (2018)
Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot
Decision problems of tree transducers with origin. Inf. Comput. 261 (2018)
Luc Dartois, Emmanuel Filiot, Pierre-Alain Reynier, Jean-Marc Talbot
Two-Way Visibly Pushdown Automata and Transducers. LICS (2016)
Pierre-Alain Reynier, Jean-Marc Talbot
Visibly Pushdown Transducers with Well-Nested Outputs. Int. J. Found. Comput. Sci. 27 (2) (2016)
Clara Bertolissi, Jean-Marc Talbot, Didier Villevalois
Analysis of access control policy updates through narrowing. PPDP (2016)
Laure Daviaud, Pierre-Alain Reynier, Jean-Marc Talbot
A Generalised Twinning Property for Minimisation of Cost Register Automata. LICS (2016)
Luc Dartois, Emmanuel Filiot, Pierre-Alain Reynier, Jean-Marc Talbot
Two-Way Visibly Pushdown Automata and Transducers. CoRR (2016)
Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot
Trimming visibly pushdown automata. Theor. Comput. Sci. 578 (2015)
Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot
Decision Problems of Tree Transducers with Origin. ICALP (2) (2015)
Pierre-Alain Reynier, Jean-Marc Talbot
Visibly Pushdown Transducers with Well-Nested Outputs. Developments in Language Theory (2014)
Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot
Trimming Visibly Pushdown Automata. CIAA (2013)
Mathieu Caralp, Emmanuel Filiot, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
Expressiveness of Visibly Pushdown Transducers. TTATT (2013)
Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot
Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness. Developments in Language Theory (2012)
Séverine Fratani, Jean-Marc Talbot
An Accurate Type System for Information Flow in Presence of Arrays. FMOODS/FORTE (2011)
Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
Properties of Visibly Pushdown Transducers. MFCS (2010)
Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
On Functionality of Visibly Pushdown Transducers CoRR (2010)
Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
Tree Automata with Global Constraints. Int. J. Found. Comput. Sci. 21 (4) (2010)
Dorina Ghindici, Isabelle Simplot-Ryl, Jean-Marc Talbot
A Sound Analysis for Secure Information Flow Using Abstract Memory Graphs. FSEN (2009)
Françoise Gire, Jean-Marc Talbot
Nested Sibling Tree Automata. RAIRO Theor. Informatics Appl. 43 (2) (2009)
Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
Tree Automata with Global Constraints. Developments in Language Theory (2008)
Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison
Polynomial time fragments of XPath with variables. PODS (2007)
Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
Satisfiability of a Spatial Logic with Tree Variables. CSL (2007)
Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison
Composing Monadic Queries in Trees. PLAN-X (2006)
Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison
N-Ary Queries by Tree Automata. DBPL (2005)
Iovka Boneva, Jean-Marc Talbot
Automata and Logics for Unranked and Unordered Trees. RTA (2005)
Iovka Boneva, Jean-Marc Talbot
When ambients cannot be opened. Theor. Comput. Sci. 333 (1-2) (2005)
Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison
N-ary Queries by Tree Automata. Foundations of Semistructured Data (2005)
Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos
Monotone AC-Tree Automata. LPAR (2005)
Iovka Boneva, Jean-Marc Talbot, Sophie Tison
Expressiveness of a Spatial Logic for Trees. LICS (2005)
Iovka Boneva, Jean-Marc Talbot
On Complexity of Model-Checking for the TQL Logic. IFIP TCS (2004)
Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot
Model checking mobile ambients. Theor. Comput. Sci. 308 (1-3) (2003)
Iovka Boneva, Jean-Marc Talbot
When Ambients Cannot Be Opened. FoSSaCS (2003)
Witold Charatonik, Jean-Marc Talbot
Atomic Set Constraints with Projection. RTA (2002)
Witold Charatonik, Andrew D. Gordon, Jean-Marc Talbot
Finite-Control Mobile Ambients. ESOP (2002)
Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot
The Complexity of Model Checking Mobile Ambients. FoSSaCS (2001)
Witold Charatonik, Jean-Marc Talbot
The Decidability of Model Checking Mobile Ambients. CSL (2001)
Jean-Marc Talbot, Philippe Devienne, Sophie Tison
Generalized Definite Set Constraints. Constraints An Int. J. 5 (1/2) (2000)
Jean-Marc Talbot
-hard. Inf. Process. Lett. 74 (1-2) (2000)
Witold Charatonik, Andreas Podelski, Jean-Marc Talbot
Paths vs. Trees in Set-Based Program Analysis. POPL (2000)
Jean-Marc Talbot
On the Alternation-Free Horn Mu-calculus. LPAR (2000)
Joachim Niehren, Martin Müller, Jean-Marc Talbot
Entailment of Atomic Set Constraints is PSPACE-Complete. LICS (1999)
Philippe Devienne, Jean-Marc Talbot, Sophie Tison
Co-definite Set Constraints with Membership Expressions. IJCSLP (1998)
Philippe Devienne, Jean-Marc Talbot, Sophie Tison
Solving Classes of Set Constraints with Tree Automata. CP (1997)
Jean-Marc Talbot, Sophie Tison, Philippe Devienne
Set-Based Analysis for Logic Programming and Tree Automata. SAS (1997)
Nirina Andrianarivelo, Wadoud Bousdira, Jean-Marc Talbot
On Theorem-Proving in Horn Theories with Built-in Algebras. AISMC (1996)