default search action
Pierre Réty
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j6]Nirina Andrianarivelo, Pierre Réty:
Modular termination of prefix-constrained term rewrite systems. Inf. Process. Lett. 174: 106207 (2022)
2010 – 2019
- 2019
- [j5]Yohan Boichut, Jacques Chabin, Pierre Réty:
Towards more precise rewriting approximations. J. Comput. Syst. Sci. 104: 131-148 (2019) - 2018
- [c26]Nirina Andrianarivelo, Pierre Réty:
Confluence of Prefix-Constrained Rewrite Systems. FSCD 2018: 6:1-6:15 - [c25]Yohan Boichut, Vivien Pelletier, Pierre Réty:
Approximating Any Logic Program by a CS-Program. WRLA@ETAPS 2018: 245-260 - 2017
- [c24]Nirina Andrianarivelo, Vivien Pelletier, Pierre Réty:
Transforming Prefix-constrained or Controlled Rewrite Systems. SCSS 2017: 49-62 - 2016
- [c23]Yohan Boichut, Vivien Pelletier, Pierre Réty:
Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems. WRLA 2016: 64-81 - 2015
- [c22]Yohan Boichut, Jacques Chabin, Pierre Réty:
Towards More Precise Rewriting Approximations. LATA 2015: 652-663 - [c21]Nirina Andrianarivelo, Pierre Réty:
Over-Approximating Terms Reachable by Context-Sensitive Rewriting. RP 2015: 128-139 - 2014
- [c20]Joshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari Alves, Pierre Réty:
A ToolBox for Conservative XML Schema Evolution and Document Adaptation. DEXA (1) 2014: 299-307 - [i1]Joshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari Alves, Pierre Réty:
A ToolBox for Conservative XML Schema Evolution and Document Adaptation. CoRR abs/1406.1423 (2014) - 2013
- [j4]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: 65-94 (2013) - [c19]Yohan Boichut, Jacques Chabin, Pierre Réty:
Over-approximating Descendants by Synchronized Tree Languages. RTA 2013: 128-142 - 2012
- [c18]Joshua Amavi, Jacques Chabin, Pierre Réty:
Weak Inclusion for Recursive XML Types. CIAA 2012: 78-89 - 2011
- [c17]Joshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari Alves, Pierre Réty:
Weak Inclusion for XML Types. CIAA 2011: 30-41 - 2010
- [c16]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: 60-75
2000 – 2009
- 2007
- [c15]Jacques Chabin, Pierre Réty:
Visibly Pushdown Languages and Term Rewriting. FroCoS 2007: 252-266 - 2005
- [j3]Pierre Réty, Julie Vuotto:
Tree automata for rewrite strategies. J. Symb. Comput. 40(1): 749-794 (2005) - 2002
- [c14]Pierre Réty, Julie Vuotto:
Regular Sets of Descendants by Some Rewrite Strategies. RTA 2002: 129-143 - [c13]Benoit Lecland, Pierre Réty:
TTSLI: An Implementation of Tree-Tuple Synchronized Languages. RTA 2002: 376-379 - [c12]Pierre Réty, Julie Vuotto:
Regular Sets of Descendants by Leftmost Strategy. WRS 2002: 176-195 - 2001
- [c11]Valérie Gouranton, Pierre Réty, Helmut Seidl:
Synchronized Tree Languages Revisited and New Applications. FoSSaCS 2001: 214-229 - [c10]Sébastien Limet, Pierre Réty, Helmut Seidl:
Weakly Regular Relations and Applications. RTA 2001: 185-200
1990 – 1999
- 1999
- [c9]Pierre Réty:
Regular Sets of Descendants for Constructor-Based Rewrite Systems. LPAR 1999: 148-160 - [c8]Sébastien Limet, Pierre Réty:
A New Result about the Decidability of the Existential One-Step Rewriting Theory. RTA 1999: 118-132 - 1998
- [c7]Sébastien Limet, Pierre Réty:
Solving Disequations Modulo Some Class of Rewrite Systems. RTA 1998: 121-135 - 1997
- [j2]Sébastien Limet, Pierre Réty:
E-unification by means of tree tuple synchronized grammars. Discret. Math. Theor. Comput. Sci. 1(1): 69-98 (1997) - [c6]Sébastien Limet, Pierre Réty:
E-Unification by Means of Tree Tuple Synchronized Grammars. TAPSOFT 1997: 429-440 - 1996
- [c5]Sébastien Limet, Pierre Réty:
Conditional Directed Narrowing. AMAST 1996: 637-640 - 1995
- [c4]Sébastien Limet, Pierre Réty:
An Attempt of Integration of LSE Narrowing and Directed Narrowing. UNIF 1995: 34-37 - 1991
- [c3]Jacques Chabin, Pierre Réty:
Narrowing Directed by a Graph of Terms. RTA 1991: 112-123
1980 – 1989
- 1989
- [j1]Werner Nutt, Pierre Réty, Gert Smolka:
Basic Narrowing Revisited. J. Symb. Comput. 7(3/4): 295-317 (1989) - 1987
- [c2]Pierre Réty:
Improving Basic Narrowing Techniques. RTA 1987: 228-241 - 1985
- [c1]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: 141-157
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint