Jean-Marc Talbot

55 papers A* 6A 2B 13C 6Journal 15Unranked 12
YearRankTypeTitle / Venue / Authors
2026 B conf
Reasoning About Quality in Hyperproperties.
CSL
Samuel Graepler, Benjamin Monmege, Jean-Marc Talbot
2025 J jnl
Reasoning about Quality in Hyperproperties.
CoRR
Samuel Graepler, Benjamin Monmege, Jean-Marc Talbot
2025 J jnl
Regular D-length: A tool for improved prefix-stable forward Ramsey factorisations.
Inf. Process. Lett.
Théodore Lopez, Benjamin Monmege, Jean-Marc Talbot
2024 C conf
Solving Access Control Conflicts in Multi-User Systems.
SECRYPT
Alba Martinez Anton, Clara Bertolissi, Jean-Marc Talbot
2022 B conf
Weighted Automata and Expressions over Pre-Rational Monoids.
CSL
Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, Jean-Marc Talbot
2021 J jnl
Weighted Automata and Expressions over Pre-Rational Monoids.
CoRR
Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, Jean-Marc Talbot
2019 B conf
Determinisation of Finitely-Ambiguous Copyless Cost Register Automata.
MFCS
Théodore Lopez, Benjamin Monmege, Jean-Marc Talbot
2019 B conf
Two-Way Parikh Automata with a Visibly Pushdown Stack.
FoSSaCS
Luc Dartois, Emmanuel Filiot, Jean-Marc Talbot
2018 J jnl
Decision problems of tree transducers with origin.
Inf. Comput.
Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot
2018 J jnl
Visibly pushdown transducers.
J. Comput. Syst. Sci.
Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
2016 B ed.
25th EACSL Annual Conference on Computer Science Logic, CSL 2016, Marseille, France, August 29 - September 1, 2016
CSL
Jean-Marc Talbot, Laurent Regnier
2016 A* conf
A Generalised Twinning Property for Minimisation of Cost Register Automata.
LICS
Laure Daviaud, Pierre-Alain Reynier, Jean-Marc Talbot
2016 C conf
Analysis of access control policy updates through narrowing.
PPDP
Clara Bertolissi, Jean-Marc Talbot, Didier Villevalois
2016 A* conf
Two-Way Visibly Pushdown Automata and Transducers.
LICS
Luc Dartois, Emmanuel Filiot, Pierre-Alain Reynier, Jean-Marc Talbot
2016 J jnl
Two-Way Visibly Pushdown Automata and Transducers.
CoRR
Luc Dartois, Emmanuel Filiot, Pierre-Alain Reynier, Jean-Marc Talbot
2016 J jnl
Visibly Pushdown Transducers with Well-Nested Outputs.
Int. J. Found. Comput. Sci.
Pierre-Alain Reynier, Jean-Marc Talbot
2015 — conf
Decision Problems of Tree Transducers with Origin.
ICALP (2)
Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot
2015 J jnl
Trimming visibly pushdown automata.
Theor. Comput. Sci.
Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot
2014 C conf
Visibly Pushdown Transducers with Well-Nested Outputs.
Developments in Language Theory
Pierre-Alain Reynier, Jean-Marc Talbot
2013 — conf
Expressiveness of Visibly Pushdown Transducers.
TTATT
Mathieu Caralp, Emmanuel Filiot, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
2013 C conf
Trimming Visibly Pushdown Automata.
CIAA
Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot
2012 C conf
Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness.
Developments in Language Theory
Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot
2011 — conf
An Accurate Type System for Information Flow in Presence of Arrays.
FMOODS/FORTE
Séverine Fratani, Jean-Marc Talbot
2010 J jnl
On Functionality of Visibly Pushdown Transducers
CoRR
Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
2010 B conf
Properties of Visibly Pushdown Transducers.
MFCS
Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
2010 J jnl
Tree Automata with Global Constraints.
Int. J. Found. Comput. Sci.
Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
2009 — conf
A Sound Analysis for Secure Information Flow Using Abstract Memory Graphs.
FSEN
Dorina Ghindici, Isabelle Simplot-Ryl, Jean-Marc Talbot
2009 J jnl
Nested Sibling Tree Automata.
RAIRO Theor. Informatics Appl.
Françoise Gire, Jean-Marc Talbot
2008 C conf
Tree Automata with Global Constraints.
Developments in Language Theory
Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
2007 A* conf
Polynomial time fragments of XPath with variables.
PODS
Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison
2007 B conf
Satisfiability of a Spatial Logic with Tree Variables.
CSL
Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
2006 — conf
Composing Monadic Queries in Trees.
PLAN-X
Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison
2005 — conf
Automata and Logics for Unranked and Unordered Trees.
RTA
Iovka Boneva, Jean-Marc Talbot
2005 A* conf
Expressiveness of a Spatial Logic for Trees.
LICS
Iovka Boneva, Jean-Marc Talbot, Sophie Tison
2005 — book
Model-checking pour les ambients : des algèbres de processus aux données semi-structurées.
Jean-Marc Talbot
2005 B conf
Monotone AC-Tree Automata.
LPAR
Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos
2005 — conf
N-Ary Queries by Tree Automata.
DBPL
Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison
2005 — conf
N-ary Queries by Tree Automata.
Foundations of Semistructured Data
Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison
2005 J jnl
When ambients cannot be opened.
Theor. Comput. Sci.
Iovka Boneva, Jean-Marc Talbot
2004 — conf
On Complexity of Model-Checking for the TQL Logic.
IFIP TCS
Iovka Boneva, Jean-Marc Talbot
2003 J jnl
Model checking mobile ambients.
Theor. Comput. Sci.
Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot
2003 B conf
When Ambients Cannot Be Opened.
FoSSaCS
Iovka Boneva, Jean-Marc Talbot
2002 — conf
Atomic Set Constraints with Projection.
RTA
Witold Charatonik, Jean-Marc Talbot
2002 A conf
Finite-Control Mobile Ambients.
ESOP
Witold Charatonik, Andrew D. Gordon, Jean-Marc Talbot
2001 B conf
The Complexity of Model Checking Mobile Ambients.
FoSSaCS
Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot
2001 B conf
The Decidability of Model Checking Mobile Ambients.
CSL
Witold Charatonik, Jean-Marc Talbot
2000 J jnl
Generalized Definite Set Constraints.
Constraints An Int. J.
Jean-Marc Talbot, Philippe Devienne, Sophie Tison
2000 B conf
On the Alternation-Free Horn Mu-calculus.
LPAR
Jean-Marc Talbot
2000 A* conf
Paths vs. Trees in Set-Based Program Analysis.
POPL
Witold Charatonik, Andreas Podelski, Jean-Marc Talbot
2000 J jnl
The forall-exists
Inf. Process. Lett.
Jean-Marc Talbot
1999 A* conf
Entailment of Atomic Set Constraints is PSPACE-Complete.
LICS
Joachim Niehren, Martin Müller, Jean-Marc Talbot
1998 — conf
Co-definite Set Constraints with Membership Expressions.
IJCSLP
Philippe Devienne, Jean-Marc Talbot, Sophie Tison
1997 B conf
Set-Based Analysis for Logic Programming and Tree Automata.
SAS
Jean-Marc Talbot, Sophie Tison, Philippe Devienne
1997 A conf
Solving Classes of Set Constraints with Tree Automata.
CP
Philippe Devienne, Jean-Marc Talbot, Sophie Tison
1996 — conf
On Theorem-Proving in Horn Theories with Built-in Algebras.
AISMC
Nirina Andrianarivelo, Wadoud Bousdira, Jean-Marc Talbot