Pierre Réty's Publications (since 1995)


Journal Papers       Conference Papers       Workshop Papers       Research Reports


Habilitation Dissertation (an overview of my work on tree synchronized languages)

       Langages Synchronisés d'Arbres et Applications
In french, 60 pages (2001)
       abstract        bibtex entry        postcript file


Journal Papers

       Tree Automata for Rewrite Strategies
with Julie Vuotto
Journal of Symbolic Computation (2004)
       abstract        bibtex entry        pdf file

Regular Sets of Descendants by Leftmost Strategy
with Julie Vuotto
(Extended and improved version of the proceedings of WRS'2002)
Electronic Notes in Theoretical Computer Science, vol 70 no 6, (2002)
       abstract        bibtex entry        postcript file

E-Unification by Means of Tree Tuple Synchronized Grammars
with Sébastien Limet
Discrete Math and Theoretical Computer Sciences, vol 1 (1997)
       abstract        bibtex entry       


Conference Papers © Springer-Verlag

       Weak Inclusion for XML Types
with Joshua Amavi, Jacques Chabin and Mirian Halfeld-Ferrari
In proc. of the 16th International Conference on Implementation and Application of Automata (CIAA 2011)
       abstract        bibtex entry        pdf file

Minimal tree language extensions : a keystone of XML type compatibility and evolution
with Jacques Chabin, Mirian Halfeld Ferrari Alves and Martin A. Musicante
In proc. of the 7th International Colloquium on Theoretical Aspects of Computing (ICTAC 2010)
       abstract        bibtex entry        pdf file

Visibly Pushdown Languages and Term Rewriting
with Jacques Chabin
In proc. of the 6th International Symposium on Frontiers of Combining Systems (2007)
       abstract        bibtex entry        postcript file

Regular Sets of Descendants by Some Rewrite Strategies
with Julie Vuotto
In proc. of the 13th Conf. on rewrite Techniques and Applications (2002)
       abstract        bibtex entry        postcript file

TTSLI: an Implementation of Tree-Tuple Synchronized Languages
with Benoit Lecland
In proc. of the 13th Conf. on rewrite Techniques and Applications (2002)
       abstract        bibtex entry        postcript file

Weakly Regular Relations and Applications
with Sébastien Limet and Helmut Seidl
In proc. of the 12th Conf. on rewrite Techniques and Applications (2001)
       abstract        bibtex entry        postcript file

Synchronized Tree Languages Revisited and New Applications
with Valérie Gouranton and Helmut Seidl
In proc. of the Conf. on Foundations of Software Science and Computation Structures (2001)
       abstract        bibtex entry        postcript file

Regular Sets of Descendants for Constructor-based Rewrite Systems
In proc. of the 6th Conf. on Logic for Programming and Automated Reasoning (1999)
       abstract        bibtex entry        postcript file

A New Result about the Decidability of the Existential One-step Rewriting Theory
with Sébastien Limet
In proc. of the 10th Conf. on rewrite Techniques and Applications (1999)
       abstract        bibtex entry        postcript file

Solving Disequations Modulo some Class of Rewrite Systems
with Sébastien Limet
In proc. of the 9th Conf. on rewrite Techniques and Applications (1998)
       abstract        bibtex entry        postcript file

E-Unification by Means of Tree Tuple Synchronized Grammars
with Sébastien Limet
In proc. of the 22nd Colloquium on Tree Algebra and Programming (1997)
       abstract        bibtex entry        postcript file

Conditional Directed Narrowing
with Sébastien Limet
In proc. of the 5th Conf. on Algebraic Methodology and Software Technology (1996)
       abstract        bibtex entry        postcript file


Workshop Papers

       R-Unification thanks to Synchronized-ContextFree Tree languages
with Jacques Chabin and Jing Chen
In proc. of the 19th Workshop on Unification (2005)
       abstract        bibtex entry        postcript file

Context-free Tree Languages for Descendants
with Julie Vuotto
In proc. of the 5th Workshop on Rule-Based Programming (2004)
Also published in ENTCS vol 124 no 1, 2005
       abstract        bibtex entry        postcript file

Regular Sets of Descendants by Leftmost Strategy
with Julie Vuotto
In proc. of the 2nd Workshop on Reduction Strategies in Rewriting and Programming (WRS'2002)
       abstract        bibtex entry        postcript file


Research Reports

       Weak Inclusion for XML Types (full version)
with Joshua Amavi, Jacques Chabin, and Mirian Halfeld Ferrari
Research Report 2011-07       

Minimal Extensions of Tree Languages: Application to XML Schema Evolution
with Jacques Chabin, Mirian Halfeld-Ferrari, and Martin A. Musicante
Research Report 2009-06       

Visibly Pushdown Languages and Term Rewriting
with Jacques Chabin
Research Report 2006-14       

Synchronized ContextFree Tree-tuple Languages
with Jacques Chabin and Jing Chen
Research Report 2006-13       

Context-free Tree Languages for Descendants
with Julie Vuotto
Research Report 2004-04       

Regular Sets of Descendants by Leftmost Strategy
with Julie Vuotto
Research Report 2002-08       

Regular Sets of Descendants by some Rewrite Strategies
with Julie Vuotto
Research Report 2002-01       

Weakly Regular Relations and Applications
with Sébastien Limet and Helmut Seidl
Research Report 2000-17       

Synchronized Tree Languages Revisited and New Applications
with Valérie Gouranton and Helmut Seidl
Research Report 2000-16       

A New Result about the Decidability of the Existential One-step Rewriting Theory
with Sébastien Limet
Research Report 98-12       

Demand-driven Search in Functional Logic Programs
with Michael Hanus
Research Report 98-08       

E-Unification by Means of Tree Tuple Synchronized Grammars
with Sébastien Limet
Research Report 96-16       

Directed Narrowing: An Optimization That More Often Terminates
with Sébastien Limet
Research Report 95-7

Conditional Directed Narrowing (including proofs)
with Sébastien Limet
Research Report 95-11


            

Back to Homepage