|
Search the dblp DataBase
Antoine Meyer:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani
A Logic of Reachable Patterns in Linked Data-Structures. [Citation Graph (0, 0)][DBLP] FoSSaCS, 2006, pp:94-110 [Conf]
- Antoine Meyer
On Term Rewriting Systems Having a Rational Derivation. [Citation Graph (0, 0)][DBLP] FoSSaCS, 2004, pp:378-392 [Conf]
- Ahmed Bouajjani, Antoine Meyer
Symbolic Reachability Analysis of Higher-Order Context-Free Processes. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:135-147 [Conf]
- Arnaud Carayol, Antoine Meyer
Linearly Bounded Infinite Graphs. [Citation Graph (0, 0)][DBLP] MFCS, 2005, pp:180-191 [Conf]
- Arnaud Carayol, Antoine Meyer
Linearly bounded infinite graphs. [Citation Graph (0, 0)][DBLP] Acta Inf., 2006, v:43, n:4, pp:265-292 [Journal]
- Arnaud Carayol, Antoine Meyer
Context-Sensitive Languages, Rational Graphs and Determinism. [Citation Graph (0, 0)][DBLP] Logical Methods in Computer Science, 2006, v:2, n:2, pp:- [Journal]
- Antoine Meyer
Traces of Term-Automatic Graphs. [Citation Graph (0, 0)][DBLP] MFCS, 2007, pp:489-500 [Conf]
- Arnaud Carayol, Antoine Meyer
Linearly bounded infinite graphs [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Greta Yorsh, Alexander Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani
A Logic of Reachable Patterns in Linked Data-Structures [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Ahmed Bouajjani, Antoine Meyer
Symbolic Reachability Analysis of Higher-Order Context-Free Processes [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Antoine Meyer
On Term Rewriting Systems Having a Rational Derivation [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Arnaud Carayol, Antoine Meyer
Context-Sensitive Languages, Rational Graphs and Determinism [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
- Greta Yorsh, Alexander Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani
A logic of reachable patterns in linked data-structures. [Citation Graph (0, 0)][DBLP] J. Log. Algebr. Program., 2007, v:73, n:1-2, pp:111-142 [Journal]
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. [Citation Graph (, )][DBLP]
Counting CTL. [Citation Graph (, )][DBLP]
Winning Regions of Higher-Order Pushdown Games. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|