Travelled to:1 × Australia
1 × Denmark
1 × Italy
1 × Serbia
1 × USA
1 × United Kingdom
2 × France
Collaborated with:A.Middeldorp M.Sylvestre G.Sénizergues D.Sherman R.Strandh B.Courcelle ∅ C.Percebois I.Futó C.Simon B.Bonhoure
Talks about:rewrit (4) term (3) recogniz (2) properti (2) program (2) preserv (2) partial (2) system (2) linear (2) invers (2)
Person: Irène Durand
DBLP: Durand:Ir=egrave=ne
Contributed to:
2011
2011201020072002
2001
1997
1991
1991
1987Wrote 10 papers:
- CIAA-2011-CourcelleD
- Fly-Automata, Their Properties and Applications (BC, ID), pp. 264–272.
- RTA-2011-DurandS #bound #linear
- Left-linear Bounded TRSs are Inverse Recognizability Preserving (ID, MS), pp. 361–376.
- RTA-2010-DurandSS #bound #linear #term rewriting #termination
- Termination of linear bounded term rewriting systems (ID, GS, MS), pp. 341–356.
- RTA-2007-DurandS #bottom-up
- Bottom-Up Rewriting Is Inverse Recognizability Preserving (ID, GS), pp. 107–121.
- RTA-2002-Durand #named #term rewriting
- Autowrite: A Tool for Checking Properties of Term Rewriting Systems (ID), pp. 371–375.
- FoSSaCS-2001-DurandM #call-by #composition #on the
- On the Modularity of Deciding Call-by-Need (ID, AM), pp. 199–213.
- CADE-1997-DurandM #call-by #decidability #term rewriting
- Decidable Call by Need Computations in term Rewriting (ID, AM), pp. 4–18.
- PEPM-1991-ShermanSD #equation #optimisation #partial evaluation #source code #using
- Optimization of Equational Programs Using Partial Evaluation (DS, RS, ID), pp. 72–82.
- WSA-1991-DurandSS #equation #partial evaluation #source code
- Partial Evaluation of an Intermediate Language for Equational Programs (ID, DS, RS), pp. 98–106.
- CFLP-1987-PerceboisFDSB #architecture #distributed #graph #multi #prolog #simulation
- Simulation Results of a Multiprocessor Prolog Architecture Based on a Distributed and/or Graph (CP, IF, ID, CS, BB), pp. 126–139.