Irène Durand

	2011
20		Bruno Courcelle, Irène Durand: Fly-Automata, Their Properties and Applications. CIAA 2011: 264-272
19		Irène Durand, Marc Sylvestre: Left-linear Bounded TRSs are Inverse Recognizability Preserving. RTA 2011: 361-376
	2010
18		Irène Durand, Géraud Sénizergues, Marc Sylvestre: Termination of linear bounded term rewriting systems. RTA 2010: 341-356
	2009
17		Irène Durand, Aart Middeldorp: On the Complexity of Deciding Call-by-Need CoRR abs/0901.0869: (2009)
16		Irène Durand, Géraud Sénizergues: Bottom-up rewriting for words and terms CoRR abs/0903.2554: (2009)
	2008
15		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
14		Irène Durand, Géraud Sénizergues: Bottom-Up Rewriting Is Inverse Recognizability Preserving. RTA 2007: 107-121
	2005
13		Irène Durand: A Tool for Term Rewrite Systems and Tree Automata. Electr. Notes Theor. Comput. Sci. 124(2): 29-49 (2005)
12		Irène Durand, Aart Middeldorp: Decidable call-by-need computations in term rewriting. Inf. Comput. 196(2): 95-126 (2005)
	2002
11		Irène Durand: Autowrite: A Tool for Checking Properties of Term Rewriting Systems. RTA 2002: 371-375
	2001
10		Irène Durand, Aart Middeldorp: On the Modularity of Deciding Call-by-Need. FoSSaCS 2001: 199-213
	1997
9		Irène Durand, Aart Middeldorp: Decidable Call by Need Computations in term Rewriting (Extended Abstract). CADE 1997: 4-18
	1994
8		Irène Durand, Bruno Salinier: Constructor Equivalent Term Rewriting Systems are Strongly Sequential: A Direct Proof. Inf. Process. Lett. 52(3): 137-145 (1994)
7		Irène Durand: Bounded, Strongly Sequential and Forward-Branching Term Rewriting Systems. J. Symb. Comput. 18(4): 319-352 (1994)
	1993
6		Irène Durand, Bruno Salinier: Constructor Equivalent Term Rewriting Systems. Inf. Process. Lett. 47(3): 131-137 (1993)
	1991
5		Irène Durand, David Sherman, Robert Strandh: Partial Evaluation of an Intermediate Language for Equational Programs. JTASPEFT/WSA 1991: 98-106
4		David Sherman, Robert Strandh, Irène Durand: Optimization of Equational Programs Using Partial Evaluation. PEPM 1991: 72-82
	1987
3		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
2		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
1		Christian Percebois, Irène Durand, C. Simon: COALA: un réseau d'acteurs pour une architecture multiprocesseur Prolog. SPLT 1985

Coauthor Index

1	B. Bonhoure	[2] [3]
2	Bruno Courcelle	[20]
3	Ivan Futó	[2] [3]
4	Aart Middeldorp	[9] [10] [12] [17]
5	Christian Percebois	[1] [2] [3]
6	Bruno Salinier	[6] [8]
7	Sylviane R. Schwer	[15]
8	Géraud Sénizergues	[14] [16] [18]
9	David Sherman	[4] [5]
10	C. Simon	[1] [2] [3]
11	Robert Strandh	[4] [5]
12	Marc Sylvestre	[18] [19]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page