BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × China
1 × Denmark
1 × Poland
1 × Russia
1 × Switzerland
1 × Taiwan
1 × United Kingdom
2 × Italy
2 × USA
3 × France
3 × Japan
Collaborated with:
S.Tison W.Charatonik P.Reynier E.Filiot I.Boneva M.Caralp P.Devienne J.Niehren A.D.Gordon A.Podelski M.Müller C.Bertolissi Didier Villevalois S.Maneth S.Dal-Zilio S.Mukhopadhyay
Talks about:
tree (8) automata (7) constraint (5) set (5) pushdown (4) ambient (4) visibl (4) logic (4) analysi (3) mobil (3)

Person: Jean-Marc Talbot

DBLP DBLP: Talbot:Jean=Marc

Facilitated 1 volumes:

CSL 2016Ed

Contributed to:

ICALP (2) 20152015
DLT 20142014
CIAA 20132013
CIAA 20132015
DLT 20122012
DLT 20082008
DLT 20082010
CSL 20072007
PODS 20072007
LICS 20052005
RTA 20052005
FoSSaCS 20032003
ESOP 20022002
RTA 20022002
CSL 20012001
FoSSaCS 20012001
POPL 20002000
LICS 19991999
JICSLP 19981998
SAS 19971997
PPDP 20162016

Wrote 21 papers:

ICALP-v2-2015-FiliotMRT #problem #transducer
Decision Problems of Tree Transducers with Origin (EF, SM, PAR, JMT), pp. 209–221.
DLT-2014-ReynierT #automaton #transducer
Visibly Pushdown Transducers with Well-Nested Outputs (PAR, JMT), pp. 129–141.
CIAA-2013-CaralpRT #automaton
Trimming Visibly Pushdown Automata (MC, PAR, JMT), pp. 84–96.
CIAA-J-2013-CaralpRT15 #automaton
Trimming visibly pushdown automata (MC, PAR, JMT), pp. 13–29.
DLT-2012-CaralpRT #automaton #bound #multi
Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness (MC, PAR, JMT), pp. 226–238.
DLT-2008-FiliotTT #automaton #constraints
Tree Automata with Global Constraints (EF, JMT, ST), pp. 314–326.
DLT-J-2008-FiliotTT10 #automaton #constraints
Tree Automata with Global Constraints (EF, JMT, ST), pp. 571–596.
CSL-2007-FiliotTT #logic #satisfiability
Satisfiability of a Spatial Logic with Tree Variables (EF, JMT, ST), pp. 130–145.
PODS-2007-FiliotNTT #polynomial #xpath
Polynomial time fragments of XPath with variables (EF, JN, JMT, ST), pp. 205–214.
LICS-2005-BonevaTT #logic
Expressiveness of a Spatial Logic for Trees (IB, JMT, ST), pp. 280–289.
RTA-2005-BonevaT #automaton #logic
Automata and Logics for Unranked and Unordered Trees (IB, JMT), pp. 500–515.
FoSSaCS-2003-BonevaT
When Ambients Cannot Be Opened (IB, JMT), pp. 169–184.
ESOP-2002-CharatonikGT #mobile
Finite-Control Mobile Ambients (WC, ADG, JMT), pp. 295–313.
RTA-2002-CharatonikT #constraints #set
Atomic Set Constraints with Projection (WC, JMT), pp. 311–325.
CSL-2001-CharatonikT #decidability #mobile #model checking
The Decidability of Model Checking Mobile Ambients (WC, JMT), pp. 339–354.
FoSSaCS-2001-CharatonikDGMT #complexity #mobile #model checking
The Complexity of Model Checking Mobile Ambients (WC, SDZ, ADG, SM, JMT), pp. 152–167.
POPL-2000-CharatonikPT #program analysis
Paths vs. Trees in Set-Based Program Analysis (WC, AP, JMT), pp. 330–337.
LICS-1999-NiehrenMT #constraints #set
Entailment of Atomic Set Constraints is PSPACE-Complete (JN, MM, JMT), pp. 285–294.
JICSLP-1998-DevienneTT #constraints #set
Co-definite Set Constraints with Membership Expressions (PD, JMT, ST), pp. 25–39.
SAS-1997-TalbotTD #analysis #automaton #logic programming
Set-Based Analysis for Logic Programming and Tree Automata (JMT, ST, PD), pp. 127–140.
PPDP-2016-BertolissiTV #analysis #data access #policy
Analysis of access control policy updates through narrowing (CB, JMT, DV), pp. 62–75.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.