Antoine Meyer

According to our database, Antoine Meyer authored at least 11 papers between 2004 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2012

Counting CTL

François Laroussinie, Antoine Meyer, Eudes Petonnet

Log. Methods Comput. Sci., 2012

2010

Counting LTL.

François Laroussinie, Antoine Meyer, Eudes Petonnet

Proceedings of the TIME 2010, 2010

2009

On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata.

Nutan Limaye, Meena Mahajan, Antoine Meyer

J. Autom. Lang. Comb., 2009

2008

Traces of term-automatic graphs.

Antoine Meyer

RAIRO Theor. Informatics Appl., 2008

Winning Regions of Higher-Order Pushdown Games.

Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2007

A logic of reachable patterns in linked data-structures.

Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani

J. Log. Algebraic Methods Program., 2007

2006

Context-Sensitive Languages, Rational Graphs and Determinism.

Arnaud Carayol, Antoine Meyer

Log. Methods Comput. Sci., 2006

Linearly bounded infinite graphs.

Arnaud Carayol, Antoine Meyer

Acta Informatica, 2006

2005

Graphes infinis de présentation finie. (Finitely Presented Infinite Graphs).

Antoine Meyer

PhD thesis, 2005

2004

Symbolic Reachability Analysis of Higher-Order Context-Free Processes.

Ahmed Bouajjani, Antoine Meyer

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

On Term Rewriting Systems Having a Rational Derivation.

Antoine Meyer

Proceedings of the Foundations of Software Science and Computation Structures, 2004