DROPS

Document

DOI: 10.4230/LIPIcs.RTA.2015.177

Reachability Analysis of Innermost Rewriting

Authors: Thomas Genet and Yann Salmon

Published in: LIPIcs, Volume 36, 26th International Conference on Rewriting Techniques and Applications (RTA 2015)

Abstract

We consider the problem of inferring a grammar describing the output of a functional program given a grammar describing its input. Solutions to this problem are helpful for detecting bugs or proving safety properties of functional programs and, several rewriting tools exist for solving this problem. However, known grammar inference techniques are not able to take evaluation strategies of the program into account. This yields very imprecise results when the evaluation strategy matters. In this work, we adapt the Tree Automata Completion algorithm to approximate accurately the set of terms reachable by rewriting under the innermost strategy. We prove that the proposed technique is sound and precise w.r.t. innermost rewriting. The proposed algorithm has been implemented in the Timbuk reachability tool. Experiments show that it noticeably improves the accuracy of static analysis for functional programs using the call-by-value evaluation strategy.

Cite as

Thomas Genet and Yann Salmon. Reachability Analysis of Innermost Rewriting. In 26th International Conference on Rewriting Techniques and Applications (RTA 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 36, pp. 177-193, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@InProceedings{genet_et_al:LIPIcs.RTA.2015.177,
  author =	{Genet, Thomas and Salmon, Yann},
  title =	{{Reachability Analysis of Innermost Rewriting}},
  booktitle =	{26th International Conference on Rewriting Techniques and Applications (RTA 2015)},
  pages =	{177--193},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-85-9},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{36},
  editor =	{Fern\'{a}ndez, Maribel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2015.177},
  URN =		{urn:nbn:de:0030-drops-51968},
  doi =		{10.4230/LIPIcs.RTA.2015.177},
  annote =	{Keywords: term rewriting systems, strategy, innermost strategy, tree automata, functiona l program, static analysis}
}

Search Results

Documents authored by Salmon, Yann

Reachability Analysis of Innermost Rewriting

Abstract

Cite as

Thanks for your feedback!

Could not send message