Skip to Main content Skip to Navigation
New interface
Conference papers

Reachability Analysis of Innermost Rewriting

Thomas Genet 1, * Yann Salmon 1 
* Corresponding author
1 CELTIQUE - Software certification with semantic analysis
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
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
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Thomas Genet Connect in order to contact the contributor
Submitted on : Monday, September 7, 2015 - 10:55:42 AM
Last modification on : Thursday, January 20, 2022 - 5:33:21 PM
Long-term archiving on: : Tuesday, December 8, 2015 - 10:49:49 AM


Files produced by the author(s)


  • HAL Id : hal-01194530, version 1


Thomas Genet, Yann Salmon. Reachability Analysis of Innermost Rewriting. Rewriting Techniques and Applications 2015, 2015, Warshaw, Poland. ⟨hal-01194530⟩



Record views


Files downloads