Irène Durand

45 papers A 1B 1C 2Journal 14Unranked 24
YearRankTypeTitle / Venue / Authors
2026 J jnl
On using SAT solvers for graph computations.
Discret. Appl. Math.
Bruno Courcelle, Irène Durand
2022 — conf
A CLOS protocol for lexical environments.
ELS
Robert Strandh, Irène Durand
2020 J jnl
A unified algorithm for colouring graphs of bounded clique-width.
CoRR
Bruno Courcelle, Irène Durand, Michael Raskin
2020 — conf
Bidirectional leveled enumerators.
ELS
Irène Durand
2019 — conf
Bootstrapping Common Lisp Using Common Lisp.
ELS
Irène Durand, Robert Strandh
2019 — conf
MAKE-METHOD-LAMBDA Revisited.
ELS
Irène Durand, Robert Strandh
2018 — conf
Incremental Parsing of Common Lisp Code.
ELS
Irène Durand, Robert Strandh
2018 — conf
Partial Inlining Using Local Graph Rewriting.
ELS
Irène Durand, Robert Strandh
2017 — conf
Fast, Maintainable, and Portable Sequence Functions.
ELS
Irène Durand, Robert Strandh
2017 — conf
Removing Redundant Tests by Replicating Control Paths.
ELS
Irène Durand, Robert Strandh
2016 J jnl
Computations by fly-automata beyond monadic second-order logic.
Theor. Comput. Sci.
Bruno Courcelle, Irène Durand
2016 — ch.
Model Checking with Fly-Automata.
Encyclopedia of Algorithms
Bruno Courcelle, Irène Durand
2016 — ed.
Proceedings of the 9th European Lisp Symposium (ELS 2016), Kraków, Poland, May 9-10, 2016.
ELS
Irène Durand
2015 J jnl
Bottom-up rewriting for words and terms.
J. Symb. Comput.
Irène Durand, Géraud Sénizergues
2015 — conf
Processing Lisp Elements in Reverse Order.
ELS
Irène Durand, Robert Strandh
2014 J jnl
Fly-automata, model-checking and recognizability.
CoRR
Bruno Courcelle, Irène Durand
2013 J jnl
Computations by fly-automata beyond monadic second-order logic
CoRR
Bruno Courcelle, Irène Durand
2013 — conf
Infinite Transducers on Terms Denoting Graphs.
ELS
Irène Durand, Bruno Courcelle
2013 — conf
Model-Checking by Infinite Fly-Automata.
CAI
Bruno Courcelle, Irène Durand
2012 J jnl
Automata for the verification of monadic second-order graph properties.
J. Appl. Log.
Bruno Courcelle, Irène Durand
2012 — conf
Object Enumeration.
ELS
Irène Durand
2011 C conf
Fly-Automata, Their Properties and Applications.
CIAA
Bruno Courcelle, Irène Durand
2011 — conf
Implementing Huge Term Automata.
ELS
Irène Durand
2011 — conf
Left-linear Bounded TRSs are Inverse Recognizability Preserving.
RTA
Irène Durand, Marc Sylvestre
2010 — conf
Termination of linear bounded term rewriting systems.
RTA
Irène Durand, Géraud Sénizergues, Marc Sylvestre
2010 — conf
Verifying Monadic Second Order Graph Properties with Tree Automata.
ELS
Bruno Courcelle, Irène Durand
2009 J jnl
Bottom-up rewriting for words and terms
CoRR
Irène Durand, Géraud Sénizergues
2009 J jnl
On the Complexity of Deciding Call-by-Need
CoRR
Irène Durand, Aart Middeldorp
2008 J jnl
A Tool for Reasoning about Qualitative Temporal Information: the Theory of S-languages with a Lisp Implementation.
J. Univers. Comput. Sci.
Irène Durand, Sylviane R. Schwer
2008 — conf
Reasoning about qualitative temporal information with S-words and S-languages.
ELS
Irène Durand, Sylviane R. Schwer
2007 — conf
Bottom-Up Rewriting Is Inverse Recognizability Preserving.
RTA
Irène Durand, Géraud Sénizergues
2005 — book
Call by need computations in orthogonal term rewriting systems.
Irène Durand
2005 J jnl
Decidable call-by-need computations in term rewriting.
Inf. Comput.
Irène Durand, Aart Middeldorp
2004 — conf
A Tool for Term Rewrite Systems and Tree Automata.
WRS
Irène Durand
2002 — conf
Autowrite: A Tool for Checking Properties of Term Rewriting Systems.
RTA
Irène Durand
2001 B conf
On the Modularity of Deciding Call-by-Need.
FoSSaCS
Irène Durand, Aart Middeldorp
1997 A conf
Decidable Call by Need Computations in term Rewriting (Extended Abstract).
CADE
Irène Durand, Aart Middeldorp
1994 J jnl
Bounded, Strongly Sequential and Forward-Branching Term Rewriting Systems.
J. Symb. Comput.
Irène Durand
1994 J jnl
Constructor Equivalent Term Rewriting Systems are Strongly Sequential: A Direct Proof.
Inf. Process. Lett.
Irène Durand, Bruno Salinier
1993 J jnl
Constructor Equivalent Term Rewriting Systems.
Inf. Process. Lett.
Irène Durand, Bruno Salinier
1991 C conf
Optimization of Equational Programs Using Partial Evaluation.
PEPM
David J. Sherman, Robert Strandh, Irène Durand
1991 — conf
Partial Evaluation of an Intermediate Language for Equational Programs.
JTASPEFT/WSA
Irène Durand, David J. Sherman, Robert Strandh
1987 — conf
Simulation Results of a Multiprocessor Prolog Architecture Based on a Distributed and/or Graph.
TAPSOFT, Vol.2
Christian Percebois, Ivan Futó, Irène Durand, Catherine Simon, Brigitte Bonhoure
1986 — conf
Résolution parallèle de sous-buts indépendants dans le graphe de connexion de R. Kowalski.
SPLT
Christian Percebois, Ivan Futó, Irène Durand, Catherine Simon, Brigitte Bonhoure
1985 — conf
COALA: un réseau d'acteurs pour une architecture multiprocesseur Prolog.
SPLT
Christian Percebois, Irène Durand, Catherine Simon