Genet, Thomas and Salmon, Yann - Reachability Analysis of Innermost Rewriting

lmcs:3211 - Logical Methods in Computer Science, March 22, 2017, Volume 13, Issue 1
Reachability Analysis of Innermost Rewriting

Authors: Genet, Thomas and Salmon, Yann

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 formally prove that the proposed technique is sound and precise w.r.t. innermost rewriting. We show that those results can be extended to the leftmost and rightmost innermost case. The algorithms for the general innermost case have 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.


Source : oai:arXiv.org:1610.05156
DOI : 10.23638/LMCS-13(1:12)2017
Volume: Volume 13, Issue 1
Published on: March 22, 2017
Submitted on: March 22, 2017
Keywords: Computer Science - Logic in Computer Science,I.2.3,F.4.2,D.2.4


Share

Consultation statistics

This page has been seen 154 times.
This article's PDF has been downloaded 73 times.