default search action
Irène Durand
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c28]Robert Strandh, Irène Durand:
A CLOS protocol for lexical environments. ELS 2022: 20-26 - 2020
- [c27]Irène Durand:
Bidirectional leveled enumerators. ELS 2020: 33-40 - [i5]Bruno Courcelle, Irène Durand, Michael Raskin:
A unified algorithm for colouring graphs of bounded clique-width. CoRR abs/2008.07468 (2020)
2010 – 2019
- 2019
- [c26]Irène Durand, Robert Strandh:
MAKE-METHOD-LAMBDA Revisited. ELS 2019: 20-23 - [c25]Irène Durand, Robert Strandh:
Bootstrapping Common Lisp Using Common Lisp. ELS 2019: 56-63 - 2018
- [c24]Irène Durand, Robert Strandh:
Incremental Parsing of Common Lisp Code. ELS 2018: 16-22 - [c23]Irène Durand, Robert Strandh:
Partial Inlining Using Local Graph Rewriting. ELS 2018: 102-109 - 2017
- [c22]Irène Durand, Robert Strandh:
Fast, Maintainable, and Portable Sequence Functions. ELS 2017: 64-71 - [c21]Irène Durand, Robert Strandh:
Removing Redundant Tests by Replicating Control Paths. ELS 2017: 106-112 - 2016
- [j8]Bruno Courcelle
, Irène Durand:
Computations by fly-automata beyond monadic second-order logic. Theor. Comput. Sci. 619: 32-67 (2016) - [e1]Irène Durand:
Proceedings of the 9th European Lisp Symposium (ELS 2016), Kraków, Poland, May 9-10, 2016. ELSAA 2016, ISBN 978-2-9557474-0-7 [contents] - [r1]Bruno Courcelle, Irène Durand:
Model Checking with Fly-Automata. Encyclopedia of Algorithms 2016: 1341-1346 - 2015
- [j7]Irène Durand, Géraud Sénizergues:
Bottom-up rewriting for words and terms. J. Symb. Comput. 67: 93-121 (2015) - [c20]Irène Durand, Robert Strandh:
Processing Lisp Elements in Reverse Order. ELS 2015: 39-46 - 2014
- [i4]Bruno Courcelle, Irène Durand:
Fly-automata, model-checking and recognizability. CoRR abs/1409.5368 (2014) - 2013
- [c19]Bruno Courcelle, Irène Durand:
Model-Checking by Infinite Fly-Automata. CAI 2013: 211-222 - [c18]Irène Durand, Bruno Courcelle:
Infinite Transducers on Terms Denoting Graphs. ELS 2013: 47-58 - [i3]Bruno Courcelle, Irène Durand:
Computations by fly-automata beyond monadic second-order logic. CoRR abs/1305.7120 (2013) - 2012
- [j6]Bruno Courcelle, Irène Durand:
Automata for the verification of monadic second-order graph properties. J. Appl. Log. 10(4): 368-409 (2012) - [c17]Irène Durand:
Object Enumeration. ELS 2012: 43-57 - 2011
- [c16]Irène Durand:
Implementing Huge Term Automata. ELS 2011: 18-27 - [c15]Irène Durand, Marc Sylvestre:
Left-linear Bounded TRSs are Inverse Recognizability Preserving. RTA 2011: 361-376 - [c14]Bruno Courcelle, Irène Durand:
Fly-Automata, Their Properties and Applications. CIAA 2011: 264-272 - 2010
- [c13]Bruno Courcelle, Irène Durand:
Verifying Monadic Second Order Graph Properties with Tree Automata. ELS 2010: 7-21 - [c12]Irène Durand, Géraud Sénizergues, Marc Sylvestre:
Termination of linear bounded term rewriting systems. RTA 2010: 341-356
2000 – 2009
- 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
- [j5]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): 3282-3306 (2008) - [c11]Irène Durand, Sylviane R. Schwer:
Reasoning about qualitative temporal information with S-words and S-languages. ELS 2008: 1-16 - 2007
- [c10]Irène Durand, Géraud Sénizergues:
Bottom-Up Rewriting Is Inverse Recognizability Preserving. RTA 2007: 107-121 - 2005
- [b1]Irène Durand:
Call by need computations in orthogonal term rewriting systems. University of Bordeaux, France, 2005 - [j4]Irène Durand, Aart Middeldorp
Decidable call-by-need computations in term rewriting. Inf. Comput. 196(2): 95-126 (2005) - 2004
- [c9]Irène Durand:
A Tool for Term Rewrite Systems and Tree Automata. WRS 2004: 29-49 - 2002
- [c8]Irène Durand:
Autowrite: A Tool for Checking Properties of Term Rewriting Systems. RTA 2002: 371-375 - 2001
- [c7]Irène Durand, Aart Middeldorp:
On the Modularity of Deciding Call-by-Need. FoSSaCS 2001: 199-213
1990 – 1999
- 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 J. Sherman
Optimization of Equational Programs Using Partial Evaluation. PEPM 1991: 72-82 - [c4]Irène Durand, David J. Sherman, Robert Strandh:
Partial Evaluation of an Intermediate Language for Equational Programs. JTASPEFT/WSA 1991: 98-106
1980 – 1989
- 1987
- [c3]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: 126-139 - 1986
- [c2]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: 553-570 - 1985
- [c1]Christian Percebois, Irène Durand, Catherine Simon:
COALA: un réseau d'acteurs pour une architecture multiprocesseur Prolog. SPLT 1985
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 00:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: