Irène Durand

According to our database1, Irène Durand authored at least 38 papers between 1985 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Bootstrapping Common Lisp Using Common Lisp.
Proceedings of the 12th European Lisp Symposium (ELS 2019), 2019

MAKE-METHOD-LAMBDA Revisited.
Proceedings of the 12th European Lisp Symposium (ELS 2019), 2019

2018
Partial Inlining Using Local Graph Rewriting.
Proceedings of the 11th European Lisp Symposium (ELS 2018), 2018

Incremental Parsing of Common Lisp Code.
Proceedings of the 11th European Lisp Symposium (ELS 2018), 2018

2017
Removing Redundant Tests by Replicating Control Paths.
Proceedings of the 10th European Lisp Symposium (ELS 2017), 2017

Fast, Maintainable, and Portable Sequence Functions.
Proceedings of the 10th European Lisp Symposium (ELS 2017), 2017

2016
Model Checking with Fly-Automata.
Encyclopedia of Algorithms, 2016

Computations by fly-automata beyond monadic second-order logic.
Theor. Comput. Sci., 2016

2015
Bottom-up rewriting for words and terms.
J. Symb. Comput., 2015

Processing Lisp Elements in Reverse Order.
Proceedings of the 8th European Lisp Symposium (ELS 2015), 2015

2014
Fly-automata, model-checking and recognizability.
CoRR, 2014

2013
Infinite Transducers on Terms Denoting Graphs.
Proceedings of ELS 2013 - 6th European Lisp Symposium, Madrid, Spain, June 3-4, 2013., 2013

Model-Checking by Infinite Fly-Automata.
Proceedings of the Algebraic Informatics - 5th International Conference, 2013

2012
Automata for the verification of monadic second-order graph properties.
J. Appl. Log., 2012

Object Enumeration.
Proceedings of ELS 2012 - 5th European Lisp Symposium, Zadar, Croatia, April 30, 2012

2011
Fly-Automata, Their Properties and Applications.
Proceedings of the Implementation and Application of Automata, 2011

Left-linear Bounded TRSs are Inverse Recognizability Preserving.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

Implementing Huge Term Automata.
Proceedings of ELS 2011 - 4th European Lisp Symposium, Hamburg, Germany, March 31, 2011

2010
Termination of linear bounded term rewriting systems.
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Verifying Monadic Second Order Graph Properties with Tree Automata.
Proceedings of the 3rd European Lisp Symposium (ELS 2010), 2010

2009
On the Complexity of Deciding Call-by-Need
CoRR, 2009

2008
A Tool for Reasoning about Qualitative Temporal Information: the Theory of S-languages with a Lisp Implementation.
J. UCS, 2008

Reasoning about qualitative temporal information with S-words and S-languages.
Proceedings of the 1st European Lisp Symposium (ELS'08), 2008

2007
Bottom-Up Rewriting Is Inverse Recognizability Preserving.
Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

2005
Decidable call-by-need computations in term rewriting.
Inf. Comput., 2005

A Tool for Term Rewrite Systems and Tree Automata.
Electr. Notes Theor. Comput. Sci., 2005

Call by need computations in orthogonal term rewriting systems.
, 2005

2002
Autowrite: A Tool for Checking Properties of Term Rewriting Systems.
Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

2001
On the Modularity of Deciding Call-by-Need.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

1997
Decidable Call by Need Computations in term Rewriting (Extended Abstract).
Proceedings of the Automated Deduction, 1997

1994
Bounded, Strongly Sequential and Forward-Branching Term Rewriting Systems.
J. Symb. Comput., 1994

Constructor Equivalent Term Rewriting Systems are Strongly Sequential: A Direct Proof.
Inf. Process. Lett., 1994

1993
Constructor Equivalent Term Rewriting Systems.
Inf. Process. Lett., 1993

1991
Partial Evaluation of an Intermediate Language for Equational Programs.
Proceedings of the Actes JTASPEFL'91 (Bordeaux, 1991

Optimization of Equational Programs Using Partial Evaluation.
Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1991

1987
Simulation Results of a Multiprocessor Prolog Architecture Based on a Distributed and/or Graph.
Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

1986
Résolution parallèle de sous-buts indépendants dans le graphe de connexion de R. Kowalski.
Proceedings of the SPLT'86, 1986

1985
COALA: un réseau d'acteurs pour une architecture multiprocesseur Prolog.
Proceedings of the SPLT'85, 1985


  Loading...