Pierre Réty

VLDB 2026 Research / reviewers in the wild / expert

dblp:76/6823 · DBLP profile ↗

← Back

20ranked-venue papers

5as first author

1since 2021 · last 2022

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 19 · 5 first-author · 1 since 2021Artificial intelligence and machine learning · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 2 · 1 since 2021Software engineering, systems software and programming languages · 1

Year	Publication	Venue	Position
2022	Modular termination of prefix-constrained term rewrite systems Nirina Andrianarivelo, Pierre Réty	Inf. Process. Lett.	2
2019	Towards more precise rewriting approximations Yohan Boichut, Jacques Chabin, Pierre Réty	J. Comput. Syst. Sci.	3
2015	Towards More Precise Rewriting Approximations Yohan Boichut, Jacques Chabin, Pierre Réty	LATA	3
2014	A ToolBox for Conservative XML Schema Evolution and Document Adaptation Joshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari Alves, Pierre Réty	DEXA (1)	4
2013	Over-approximating Descendants by Synchronized Tree Languages abstract Over-approximating the descendants (successors) of a initial set of terms by a rewrite system is used in verification. The success of such verification methods depends on the quality of the approximation. To get better approximations, we are going to use non-regular languages. We present a procedure that always terminates and that computes over-approximation of descendants, using synchronized tree-(tuple) languages expressed by logic programs. Yohan Boichut, Jacques Chabin, Pierre Réty	RTA	3
2012	Weak Inclusion for Recursive XML Types Joshua Amavi, Jacques Chabin, Pierre Réty	CIAA	3
2011	Weak Inclusion for XML Types Joshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari Alves, Pierre Réty	CIAA	4
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	ICTAC	4
2005	Tree automata for rewrite strategies Pierre Réty, Julie Vuotto	J. Symb. Comput.	1
2002	TTSLI: An Implementation of Tree-Tuple Synchronized Languages Benoit Lecland, Pierre Réty	RTA	2
2002	Regular Sets of Descendants by Some Rewrite Strategies Pierre Réty, Julie Vuotto	RTA	1
2001	Synchronized Tree Languages Revisited and New Applications Valérie Gouranton, Pierre Réty, Helmut Seidl	FoSSaCS	2
2001	Weakly Regular Relations and Applications Sébastien Limet, Pierre Réty, Helmut Seidl	RTA	2
1999	Regular Sets of Descendants for Constructor-Based Rewrite Systems Pierre Réty	LPAR	1
1999	A New Result about the Decidability of the Existential One-Step Rewriting Theory Sébastien Limet, Pierre Réty	RTA	2
1998	Solving Disequations Modulo Some Class of Rewrite Systems Sébastien Limet, Pierre Réty	RTA	2
1991	Narrowing Directed by a Graph of Terms Jacques Chabin, Pierre Réty	RTA	2
1989	Basic Narrowing Revisited Werner Nutt, Pierre Réty, Gert Smolka	J. Symb. Comput.	2
1987	Improving Basic Narrowing Techniques Pierre Réty	RTA	1
1985	NARROWER: A New Algorithm for Unification and Its Application to Logic Programming Pierre Réty, Claude Kirchner, Hélène Kirchner, Pierre Lescanne	RTA	1