License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.RTA.2013.128
URN: urn:nbn:de:0030-drops-40580
URL: http://drops.dagstuhl.de/opus/volltexte/2013/4058/
Go to the corresponding LIPIcs Volume Portal


Boichut, Yohan ; Chabin, Jacques ; Réty, Pierre

Over-approximating Descendants by Synchronized Tree Languages

pdf-format:
11.pdf (0.5 MB)


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.

BibTeX - Entry

@InProceedings{boichut_et_al:LIPIcs:2013:4058,
  author =	{Yohan Boichut and Jacques Chabin and Pierre R{\'e}ty},
  title =	{{Over-approximating Descendants by Synchronized Tree Languages}},
  booktitle =	{24th International Conference on Rewriting Techniques and Applications (RTA 2013)},
  pages =	{128--142},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-53-8},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{21},
  editor =	{Femke van Raamsdonk},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2013/4058},
  URN =		{urn:nbn:de:0030-drops-40580},
  doi =		{10.4230/LIPIcs.RTA.2013.128},
  annote =	{Keywords: rewriting systems, non-regular approximations, logic programming, tree languages, descendants}
}

Keywords: rewriting systems, non-regular approximations, logic programming, tree languages, descendants
Seminar: 24th International Conference on Rewriting Techniques and Applications (RTA 2013)
Issue Date: 2013
Date of publication: 14.06.2013


DROPS-Home | Fulltext Search | Imprint Published by LZI