NARROWER: A New Algorithm for Unification and Its Application to Logic Programming. - Pierre Réty; Claude Kirchner; Hélène Kirchner; Pierre Lescanne (RTA, 1985)

Improving Basic Narrowing Techniques. - Pierre Réty (RTA, 1987)

Basic Narrowing Revisited. - Werner Nutt; Pierre Réty; Gert Smolka (J. Symb. Comput., 1989)

Narrowing Directed by a Graph of Terms. - Jacques Chabin; Pierre Réty (RTA, 1991)

An Attempt of Integration of LSE Narrowing and Directed Narrowing. - Sébastien Limet; Pierre Réty (UNIF, 1995)

Conditional Directed Narrowing. - Sébastien Limet; Pierre Réty (AMAST, 1996)

E-unification by means of tree tuple synchronized grammars. - Sébastien Limet; Pierre Réty (Discret. Math. Theor. Comput. Sci., 1997)

Solving Disequations Modulo Some Class of Rewrite Systems. - Sébastien Limet; Pierre Réty (RTA, 1998)

Regular Sets of Descendants for Constructor-Based Rewrite Systems. - Pierre Réty (LPAR, 1999)

A New Result about the Decidability of the Existential One-Step Rewriting Theory. - Sébastien Limet; Pierre Réty (RTA, 1999)

Synchronized Tree Languages Revisited and New Applications. - Valérie Gouranton; Pierre Réty; Helmut Seidl (FoSSaCS, 2001)

Weakly Regular Relations and Applications. - Sébastien Limet; Pierre Réty; Helmut Seidl (RTA, 2001)

TTSLI: An Implementation of Tree-Tuple Synchronized Languages. - Benoit Lecland; Pierre Réty (RTA, 2002)

Regular Sets of Descendants by Some Rewrite Strategies. - Pierre Réty; Julie Vuotto (RTA, 2002)

Regular Sets of Descendants by Leftmost Strategy. - Pierre Réty; Julie Vuotto (WRS, 2002)

Tree automata for rewrite strategies. - Pierre Réty; Julie Vuotto (J. Symb. Comput., 2005)

Visibly Pushdown Languages and Term Rewriting. - Jacques Chabin; Pierre Réty (FroCoS, 2007)

Minimal Tree Language Extensions: A Keystone of XML Type Compatibility and Evolution. - Jacques Chabin; Mirian Halfeld Ferrari Alves; Martin A. Musicante; Pierre Réty (ICTAC, 2010)

Weak Inclusion for XML Types. - Joshua Amavi; Jacques Chabin; Mirian Halfeld Ferrari Alves; Pierre Réty (CIAA, 2011)

Weak Inclusion for Recursive XML Types. - Joshua Amavi; Jacques Chabin; Pierre Réty (CIAA, 2012)

Over-approximating Descendants by Synchronized Tree Languages. - Yohan Boichut; Jacques Chabin; Pierre Réty (RTA, 2013)

Conservative Type Extensions for XML Data. - Jacques Chabin; Mirian Halfeld Ferrari Alves; Martin A. Musicante; Pierre Réty (Trans. Large Scale Data Knowl. Centered Syst., 2013)

A ToolBox for Conservative XML Schema Evolution and Document Adaptation. - Joshua Amavi; Jacques Chabin; Mirian Halfeld Ferrari Alves; Pierre Réty (DEXA (1), 2014)

Over-Approximating Terms Reachable by Context-Sensitive Rewriting. - Nirina Andrianarivelo; Pierre Réty (RP, 2015)

Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems. - Yohan Boichut; Vivien Pelletier; Pierre Réty (WRLA, 2016)

Transforming Prefix-constrained or Controlled Rewrite Systems. - Nirina Andrianarivelo; Vivien Pelletier; Pierre Réty (SCSS, 2017)

Confluence of Prefix-Constrained Rewrite Systems. - Nirina Andrianarivelo; Pierre Réty (FSCD, 2018)

Approximating Any Logic Program by a CS-Program. - Yohan Boichut; Vivien Pelletier; Pierre Réty (WRLA@ETAPS, 2018)

Towards more precise rewriting approximations. - Yohan Boichut; Jacques Chabin; Pierre Réty (J. Comput. Syst. Sci., 2019)

Modular termination of prefix-constrained term rewrite systems. - Nirina Andrianarivelo; Pierre Réty (Inf. Process. Lett., 2022)