Pierre Réty

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