Irène Durand

Publication Activity (10 Years)

Years Active: 1985-2022
Publications (10 Years): 9

Top Topics

Regular Expressions

Top Venues

Theor. Comput. Sci.

J. Symb. Comput.

Publications

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