- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j7 |      | Bruno Courcelle, Irène Durand: Automata for the verification of monadic second-order graph properties. J. Applied Logic 10(4): 368-409 (2012) |
| 2011 | ||
| c12 | | Irène Durand, Marc Sylvestre: Left-linear Bounded TRSs are Inverse Recognizability Preserving. RTA 2011: 361-376 |
| c11 | | |
| 2010 | ||
| c10 | | Irène Durand, Géraud Sénizergues, Marc Sylvestre: Termination of linear bounded term rewriting systems. RTA 2010: 341-356 |
| 2009 | ||
| i2 | | Irène Durand, Aart Middeldorp: On the Complexity of Deciding Call-by-Need. CoRR abs/0901.0869 (2009) |
| i1 | | Irène Durand, Géraud Sénizergues: Bottom-up rewriting for words and terms. CoRR abs/0903.2554 (2009) |
| 2008 | ||
| j6 | | Irène Durand, Sylviane R. Schwer: A Tool for Reasoning about Qualitative Temporal Information: the Theory of S-languages with a Lisp Implementation. J. UCS 14(20): 3282-3306 (2008) |
| 2007 | ||
| c9 | | Irène Durand, Géraud Sénizergues: Bottom-Up Rewriting Is Inverse Recognizability Preserving. RTA 2007: 107-121 |
| 2005 | ||
| j5 | | Irène Durand: A Tool for Term Rewrite Systems and Tree Automata. Electr. Notes Theor. Comput. Sci. 124(2): 29-49 (2005) |
| j4 | | Irène Durand, Aart Middeldorp: Decidable call-by-need computations in term rewriting. Inf. Comput. 196(2): 95-126 (2005) |
| 2002 | ||
| c8 | | Irène Durand: Autowrite: A Tool for Checking Properties of Term Rewriting Systems. RTA 2002: 371-375 |
| 2001 | ||
| c7 | | |
| 1997 | ||
| c6 | | Irène Durand, Aart Middeldorp: Decidable Call by Need Computations in term Rewriting (Extended Abstract). CADE 1997: 4-18 |
| 1994 | ||
| j3 | | Irène Durand, Bruno Salinier: Constructor Equivalent Term Rewriting Systems are Strongly Sequential: A Direct Proof. Inf. Process. Lett. 52(3): 137-145 (1994) |
| j2 | | Irène Durand: Bounded, Strongly Sequential and Forward-Branching Term Rewriting Systems. J. Symb. Comput. 18(4): 319-352 (1994) |
| 1993 | ||
| j1 | | Irène Durand, Bruno Salinier: Constructor Equivalent Term Rewriting Systems. Inf. Process. Lett. 47(3): 131-137 (1993) |
| 1991 | ||
| c5 | | David Sherman, Robert Strandh, Irène Durand: Optimization of Equational Programs Using Partial Evaluation. PEPM 1991: 72-82 |
| c4 |  | Irène Durand, David Sherman, Robert Strandh: Partial Evaluation of an Intermediate Language for Equational Programs. JTASPEFT/WSA 1991: 98-106 |
| 1987 | ||
| c3 | | Christian Percebois, Ivan Futó, Irène Durand, C. Simon, B. Bonhoure: Simulation Results of a Multiprocessor Prolog Architecture Based on a Distributed and/or Graph. TAPSOFT, Vol.2 1987: 126-139 |
| 1986 | ||
| c2 | | Christian Percebois, Ivan Futó, Irène Durand, C. Simon, B. Bonhoure: Résolution parallèle de sous-buts indépendants dans le graphe de connexion de R. Kowalski. SPLT 1986: 553-570 |
| 1985 | ||
| c1 | | Christian Percebois, Irène Durand, C. Simon: COALA: un réseau d'acteurs pour une architecture multiprocesseur Prolog. SPLT 1985 |
| 1 | B. Bonhoure | |
| 2 | Bruno Courcelle | |
| 3 | Ivan Futó | |
| 4 | Aart Middeldorp | |
| 5 | Christian Percebois | |
| 6 | Bruno Salinier | |
| 7 | Sylviane R. Schwer | |
| 8 | David Sherman | |
| 9 | C. Simon | |
| 10 | Robert Strandh | |
| 11 | Marc Sylvestre | |
| 12 | Géraud Sénizergues |
Colors in the list of coauthors
Last update Fri May 24 11:32:16 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page