Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems. - Yohan Boichut; Vivien Pelletier; Pierre Réty (WRLA, 2016)

Transforming Prefix-constrained or Controlled Rewrite Systems. - Nirina Andrianarivelo; Vivien Pelletier; Pierre Réty (SCSS, 2017)

Sur-approximations non régulières et terminaison pour l'analyse d'accessibilité. (Non-regular over-approximations and termination for reachability analysis). - Vivien Pelletier (2017)

Approximating Any Logic Program by a CS-Program. - Yohan Boichut; Vivien Pelletier; Pierre Réty (WRLA@ETAPS, 2018)