Tree Automata Completion for Static Analysis of Functional Programs

Thomas Genet (1) , Yann Salmon (1)

1 CELTIQUE - Software certification with semantic analysis

Tree Automata Completion is a family of techniques for computing or approximating the set of terms reachable by a rewriting relation. For functional programs translated into TRS, we give a sufficient condition for completion to terminate. Second, in order to take into account the evaluation strategy of functional programs, we show how to refine completion to approximate reachable terms for a rewriting relation controlled by a strategy. In this paper, we focus on innermost strategy which represents the call-by-value evaluation strategy.

Mots clés: term rewriting systems; strategy; tree automata; functional program; static analysis

Domaines: Génie logiciel [cs.SE]; Langage de programmation [cs.PL]

Thomas Genet, Yann Salmon. Tree Automata Completion for Static Analysis of Functional Programs. 2013. ⟨hal-00780124v2⟩