2008 |
15 | EE | Nutan Limaye,
Meena Mahajan,
Antoine Meyer:
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata.
CSR 2008: 240-251 |
14 | EE | Arnaud Carayol,
Matthew Hague,
Antoine Meyer,
C.-H. Luke Ong,
Olivier Serre:
Winning Regions of Higher-Order Pushdown Games.
LICS 2008: 193-204 |
2007 |
13 | EE | Antoine Meyer:
Traces of Term-Automatic Graphs.
MFCS 2007: 489-500 |
12 | EE | Arnaud Carayol,
Antoine Meyer:
Linearly bounded infinite graphs
CoRR abs/0705.3487: (2007) |
11 | EE | Greta Yorsh,
Alexander Moshe Rabinovich,
Mooly Sagiv,
Antoine Meyer,
Ahmed Bouajjani:
A Logic of Reachable Patterns in Linked Data-Structures
CoRR abs/0705.3610: (2007) |
10 | EE | Ahmed Bouajjani,
Antoine Meyer:
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
CoRR abs/0705.3888: (2007) |
9 | EE | Antoine Meyer:
On Term Rewriting Systems Having a Rational Derivation
CoRR abs/0705.4064: (2007) |
8 | EE | Greta Yorsh,
Alexander Moshe Rabinovich,
Mooly Sagiv,
Antoine Meyer,
Ahmed Bouajjani:
A logic of reachable patterns in linked data-structures.
J. Log. Algebr. Program. 73(1-2): 111-142 (2007) |
2006 |
7 | EE | Greta Yorsh,
Alexander Moshe Rabinovich,
Mooly Sagiv,
Antoine Meyer,
Ahmed Bouajjani:
A Logic of Reachable Patterns in Linked Data-Structures.
FoSSaCS 2006: 94-110 |
6 | EE | Arnaud Carayol,
Antoine Meyer:
Linearly bounded infinite graphs.
Acta Inf. 43(4): 265-292 (2006) |
5 | EE | Arnaud Carayol,
Antoine Meyer:
Context-Sensitive Languages, Rational Graphs and Determinism
CoRR abs/cs/0606053: (2006) |
4 | EE | Arnaud Carayol,
Antoine Meyer:
Context-Sensitive Languages, Rational Graphs and Determinism.
Logical Methods in Computer Science 2(2): (2006) |
2005 |
3 | EE | Arnaud Carayol,
Antoine Meyer:
Linearly Bounded Infinite Graphs.
MFCS 2005: 180-191 |
2004 |
2 | EE | Ahmed Bouajjani,
Antoine Meyer:
Symbolic Reachability Analysis of Higher-Order Context-Free Processes.
FSTTCS 2004: 135-147 |
1 | EE | Antoine Meyer:
On Term Rewriting Systems Having a Rational Derivation.
FoSSaCS 2004: 378-392 |