( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Removing Redundant Tests by Replicating Control Paths.

, и . ELS, стр. 106-112. ELSAA, (2017)

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.

Jacques Durand

Yves Durand

Jacques Durand

Guillaume Durand

Sylvain Durand

 

Другие публикации лиц с тем же именем

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