Volgen
Irène Durand
Irène Durand
Geverifieerd e-mailadres voor u-bordeaux.fr - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Decidable call by need computations in term rewriting
I Durand, A Middeldorp
International Conference on Automated Deduction, 4-18, 1997
551997
Bounded, strongly sequential and forward-branching term rewriting systems
I Durand
Journal of Symbolic Computation 18 (4), 319-352, 1994
341994
Automata for the verification of monadic second-order graph properties
B Courcelle, I Durand
Journal of applied logic 10 (4), 368-409, 2012
332012
Verifying Monadic Second Order Graph Properties with Tree Automata.
B Courcelle, I Durand
ELS, 7-21, 2010
262010
Autowrite: A tool for term rewrite systems and tree automata
I Durand
Electronic Notes in Theoretical Computer Science 124 (2), 29-49, 2005
252005
Optimization of equational programs using partial evaluation
D Sherman, R Strandh, I Durand
Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and …, 1991
231991
Bottom-up rewriting is inverse recognizability preserving
I Durand, G Sénizergues
International Conference on Rewriting Techniques and Applications, 107-121, 2007
212007
Computations by fly-automata beyond monadic second-order logic
B Courcelle, I Durand
Theoretical Computer Science 619, 32-67, 2016
202016
Decidable call-by-need computations in term rewriting
I Durand, A Middeldorp
Information and Computation 196 (2), 95-126, 2005
162005
A Tool for Reasoning about Qualitative Temporal Information: the Theory of S-languages with a Lisp Implementation.
I Durand, SR Schwer
J. Univers. Comput. Sci. 14 (20), 3282-3306, 2008
152008
Constructor equivalent term rewriting systems
I Durand, B Salinier
Information Processing Letters 47 (3), 131-137, 1993
151993
Left-linear bounded trss are inverse recognizability preserving
I Durand, M Sylvestre
22nd International Conference on Rewriting Techniques and Applications (RTA'11), 2011
112011
Prism: A testbed for parallel control
ME Giuliano, M Kohli, J Minker, I Durand
Parallel Algorithms for Machine Intelligence and Vision, 182-231, 1990
111990
Autowrite: A tool for checking properties of term rewriting systems
I Durand
International Conference on Rewriting Techniques and Applications, 371-375, 2002
92002
Fly-automata, their properties and applications
B Courcelle, IA Durand
International Conference on Implementation and Application of Automata, 264-272, 2011
82011
Constructor equivalent term rewriting systems are strongly sequential: a direct proof
I ene Durand, B Salinier
Information Processing Letters 52, 137-145, 1994
81994
Tractable constructions of finite automata from monadic second-order formulas
B Courcelle, I Durand
Workshop on Logical Approaches to Barriers in Computing and Complexity, 2010
72010
On the complexity of deciding call-by-need
I Durand, A Middeldorp
arXiv preprint arXiv:0901.0869, 2009
72009
A case study of the convergence of mildly context-sensitive formalisms for natural language syntax: from minimalist grammars to multiple context-free grammars
B Mery, M Amblard, I Durand, C Retoré
INRIA, 2006
72006
On the modularity of deciding call-by-need
I Durand, A Middeldorp
International Conference on Foundations of Software Science and Computation …, 2001
72001
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20