( en | de | ru )

 

Disambiguation of "Durand, Irène"

Author of the publication

copydeleteadd this publication to your clipboard
Automata for the verification of monadic second-order graph properties.

, and . J. Appl. Log., 10 (4): 368-409 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jacques Durand

Yves Durand

Jacques Durand

Guillaume Durand

Sylvain Durand

 

Other publications of authors with the same name

Autowrite: A Tool for Checking Properties of Term Rewriting Systems.. RTA, volume 2378 of Lecture Notes in Computer Science, page 371-375. Springer, (2002)A unified algorithm for colouring graphs of bounded clique-width., , and . (2020)http://arxiv.org/abs/2008.07468.Termination of linear bounded term rewriting systems., , and . RTA, volume 6 of LIPIcs, page 341-356. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Verifying Monadic Second Order Graph Properties with Tree Automata., and . ELS, page 7-21. ELSAA, (2010)Model-Checking by Infinite Fly-Automata., and . CAI, volume 8080 of Lecture Notes in Computer Science, page 211-222. Springer, (2013)Decidable Call by Need Computations in term Rewriting (Extended Abstract)., and . CADE, volume 1249 of Lecture Notes in Computer Science, page 4-18. Springer, (1997)Incremental Parsing of Common Lisp Code., and . ELS, page 16-22. ELSAA, (2018)Résolution parallèle de sous-buts indépendants dans le graphe de connexion de R. Kowalski., , , , and . SPLT, page 553-570. (1986)Computations by fly-automata beyond monadic second-order logic, and . CoRR, (2013)On the Modularity of Deciding Call-by-Need., and . FoSSaCS, volume 2030 of Lecture Notes in Computer Science, page 199-213. Springer, (2001)