Pierre Réty

According to our database, Pierre Réty authored at least 30 papers between 1985 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

Modular termination of prefix-constrained term rewrite systems.

Nirina Andrianarivelo, Pierre Réty

Inf. Process. Lett., 2022

2019

Towards more precise rewriting approximations.

Yohan Boichut, Jacques Chabin, Pierre Réty

J. Comput. Syst. Sci., 2019

2018

Approximating Any Logic Program by a CS-Program.

Yohan Boichut, Vivien Pelletier, Pierre Réty

Proceedings of the Rewriting Logic and Its Applications - 12th International Workshop, 2018

Confluence of Prefix-Constrained Rewrite Systems.

Nirina Andrianarivelo, Pierre Réty

Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

2017

Transforming Prefix-constrained or Controlled Rewrite Systems.

Nirina Andrianarivelo, Vivien Pelletier, Pierre Réty

Proceedings of the SCSS 2017, 2017

2016

Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems.

Yohan Boichut, Vivien Pelletier, Pierre Réty

Proceedings of the Rewriting Logic and Its Applications - 11th International Workshop, 2016

2015

Over-Approximating Terms Reachable by Context-Sensitive Rewriting.

Nirina Andrianarivelo, Pierre Réty

Proceedings of the Reachability Problems - 9th International Workshop, 2015

2014

A ToolBox for Conservative XML Schema Evolution and Document Adaptation.

Joshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari Alves, Pierre Réty

Proceedings of the Database and Expert Systems Applications, 2014

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

Over-approximating Descendants by Synchronized Tree Languages.

Yohan Boichut, Jacques Chabin, Pierre Réty

Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

2012

Weak Inclusion for Recursive XML Types.

Joshua Amavi, Jacques Chabin, Pierre Réty

Proceedings of the Implementation and Application of Automata, 2012

2011

Weak Inclusion for XML Types.

Joshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari Alves, Pierre Réty

Proceedings of the Implementation and Application of Automata, 2011

2010

Minimal Tree Language Extensions: A Keystone of XML Type Compatibility and Evolution.

Jacques Chabin, Mirian Halfeld Ferrari Alves, Martin A. Musicante, Pierre Réty

Proceedings of the Theoretical Aspects of Computing, 2010

2007

Visibly Pushdown Languages and Term Rewriting.

Jacques Chabin, Pierre Réty

Proceedings of the Frontiers of Combining Systems, 6th International Symposium, 2007

2005

Tree automata for rewrite strategies.

Pierre Réty, Julie Vuotto

J. Symb. Comput., 2005

2002

Regular Sets of Descendants by Leftmost Strategy.

Pierre Réty, Julie Vuotto

Proceedings of the 2nd International Workshop on Reduction Strategies in Rewriting and Programming, 2002

Regular Sets of Descendants by Some Rewrite Strategies.

Pierre Réty, Julie Vuotto

Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

TTSLI: An Implementation of Tree-Tuple Synchronized Languages.

Benoit Lecland, Pierre Réty

Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

2001

Weakly Regular Relations and Applications.

Sébastien Limet, Pierre Réty, Helmut Seidl

Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

Synchronized Tree Languages Revisited and New Applications.

Valérie Gouranton, Pierre Réty, Helmut Seidl

Proceedings of the Foundations of Software Science and Computation Structures, 2001

1999

A New Result about the Decidability of the Existential One-Step Rewriting Theory.

Sébastien Limet, Pierre Réty

Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

Regular Sets of Descendants for Constructor-Based Rewrite Systems.

Pierre Réty

Proceedings of the Logic Programming and Automated Reasoning, 6th International Conference, 1999

1998

Solving Disequations Modulo Some Class of Rewrite Systems.

Sébastien Limet, Pierre Réty

Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

1997

E-unification by means of tree tuple synchronized grammars.

Sébastien Limet, Pierre Réty

Discret. Math. Theor. Comput. Sci., 1997

1996

Conditional Directed Narrowing.

Sébastien Limet, Pierre Réty

Proceedings of the Algebraic Methodology and Software Technology, 1996

1995

An Attempt of Integration of LSE Narrowing and Directed Narrowing.

Sébastien Limet, Pierre Réty

Proceedings of the 9th International Workshop on Unification, 1995

1991

Narrowing Directed by a Graph of Terms.

Jacques Chabin, Pierre Réty

Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1989

Basic Narrowing Revisited.

Werner Nutt, Pierre Réty, Gert Smolka

J. Symb. Comput., 1989

1987

Improving Basic Narrowing Techniques.

Pierre Réty

Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987

1985

NARROWER: A New Algorithm for Unification and Its Application to Logic Programming.

Pierre Réty, Claude Kirchner, Hélène Kirchner, Pierre Lescanne

Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985