Reachability Analysis of Innermost Rewriting - extended version - Archive ouverte HAL Access content directly
Journal Articles Logical Methods in Computer Science Year : 2017

Reachability Analysis of Innermost Rewriting - extended version

(1) , (1)


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.
Fichier principal
Vignette du fichier
main.pdf (807.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01532090 , version 1 (02-06-2017)



Thomas Genet, Yann Salmon. Reachability Analysis of Innermost Rewriting - extended version. Logical Methods in Computer Science, 2017, ⟨10.2168/LMCS-???⟩. ⟨hal-01532090⟩
351 View
76 Download



Gmail Facebook Twitter LinkedIn More