Pierre Réty

Publication Activity (10 Years)

Years Active: 1985-2022
Publications (10 Years): 6

Top Topics

Rewrite Systems

Top Venues

J. Comput. Syst. Sci.

Publications

Nirina Andrianarivelo, Pierre Réty
Modular termination of prefix-constrained term rewrite systems. Inf. Process. Lett. 174 (2022)
Yohan Boichut, Jacques Chabin, Pierre Réty
Towards more precise rewriting approximations. J. Comput. Syst. Sci. 104 (2019)
Yohan Boichut, Vivien Pelletier, Pierre Réty
Approximating Any Logic Program by a CS-Program. WRLA@ETAPS (2018)
Nirina Andrianarivelo, Pierre Réty
Confluence of Prefix-Constrained Rewrite Systems. FSCD (2018)
Nirina Andrianarivelo, Vivien Pelletier, Pierre Réty
Transforming Prefix-constrained or Controlled Rewrite Systems. SCSS (2017)
Yohan Boichut, Vivien Pelletier, Pierre Réty
Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems. WRLA (2016)
Yohan Boichut, Jacques Chabin, Pierre Réty
Towards More Precise Rewriting Approximations. LATA (2015)
Nirina Andrianarivelo, Pierre Réty
Over-Approximating Terms Reachable by Context-Sensitive Rewriting. RP (2015)
Joshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari Alves, Pierre Réty
A ToolBox for Conservative XML Schema Evolution and Document Adaptation. CoRR (2014)
Joshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari Alves, Pierre Réty
A ToolBox for Conservative XML Schema Evolution and Document Adaptation. DEXA (1) (2014)
Jacques Chabin, Mirian Halfeld Ferrari Alves, Martin A. Musicante, Pierre Réty
Conservative Type Extensions for XML Data. Trans. Large Scale Data Knowl. Centered Syst. 9 (2013)
Yohan Boichut, Jacques Chabin, Pierre Réty
Over-approximating Descendants by Synchronized Tree Languages. RTA (2013)
Joshua Amavi, Jacques Chabin, Pierre Réty
Weak Inclusion for Recursive XML Types. CIAA (2012)
Joshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari Alves, Pierre Réty
Weak Inclusion for XML Types. CIAA (2011)
Jacques Chabin, Mirian Halfeld Ferrari Alves, Martin A. Musicante, Pierre Réty
Minimal Tree Language Extensions: A Keystone of XML Type Compatibility and Evolution. ICTAC (2010)
Jacques Chabin, Pierre Réty
Visibly Pushdown Languages and Term Rewriting. FroCoS (2007)
Pierre Réty, Julie Vuotto
Tree automata for rewrite strategies. J. Symb. Comput. 40 (1) (2005)
Benoit Lecland, Pierre Réty
TTSLI: An Implementation of Tree-Tuple Synchronized Languages. RTA (2002)
Pierre Réty, Julie Vuotto
Regular Sets of Descendants by Leftmost Strategy. Electron. Notes Theor. Comput. Sci. 70 (6) (2002)
Pierre Réty, Julie Vuotto
Regular Sets of Descendants by Some Rewrite Strategies. RTA (2002)
Sébastien Limet, Pierre Réty, Helmut Seidl
Weakly Regular Relations and Applications. RTA (2001)
Valérie Gouranton, Pierre Réty, Helmut Seidl
Synchronized Tree Languages Revisited and New Applications. FoSSaCS (2001)
Pierre Réty
Regular Sets of Descendants for Constructor-Based Rewrite Systems. LPAR (1999)
Sébastien Limet, Pierre Réty
A New Result about the Decidability of the Existential One-Step Rewriting Theory. RTA (1999)
Sébastien Limet, Pierre Réty
Solving Disequations Modulo Some Class of Rewrite Systems. RTA (1998)
Sébastien Limet, Pierre Réty
E-unification by means of tree tuple synchronized grammars. Discret. Math. Theor. Comput. Sci. 1 (1) (1997)
Sébastien Limet, Pierre Réty
E-Unification by Means of Tree Tuple Synchronized Grammars. TAPSOFT (1997)
Sébastien Limet, Pierre Réty
Conditional Directed Narrowing. AMAST (1996)
Sébastien Limet, Pierre Réty
An Attempt of Integration of LSE Narrowing and Directed Narrowing. UNIF (1995)
Jacques Chabin, Pierre Réty
Narrowing Directed by a Graph of Terms. RTA (1991)
Werner Nutt, Pierre Réty, Gert Smolka
Basic Narrowing Revisited. J. Symb. Comput. 7 (3/4) (1989)
Pierre Réty
Improving Basic Narrowing Techniques. RTA (1987)
Pierre Réty, Claude Kirchner, Hélène Kirchner, Pierre Lescanne
NARROWER: A New Algorithm for Unification and Its Application to Logic Programming. RTA (1985)