Conference Papers Year : 2014

Towards Static Analysis of Functional Programs Using Tree Automata Completion

Abstract

This paper presents the first step of a wider research effort to apply tree automata completion to the static analysis of functional programs. Tree Automata Completion is a family of techniques for com-puting or approximating the set of terms reachable by a rewriting rela-tion. The completion algorithm we focus on is parameterized by a set E of equations controlling the precision of the approximation and influenc-ing its termination. For completion to be used as a static analysis, the first step is to guarantee its termination. In this work, we thus give a sufficient condition on E and T (F) for completion algorithm to always terminate. In the particular setting of functional programs, this condi-tion can be relaxed into a condition on E and T (C) (terms built on the set of constructors) that is closer to what is done in the field of static analysis, where abstractions are performed on data.
Fichier principal
Vignette du fichier
Genet-WRLA14.pdf (214) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01089993 , version 1 (02-12-2014)

Identifiers

Cite

Thomas Genet. Towards Static Analysis of Functional Programs Using Tree Automata Completion. Workshop on Rewriting Logic and its Applications, Santiago Escobar, Apr 2014, Grenoble, France. pp.147 - 161, ⟨10.1007/978-3-319-12904-4_8⟩. ⟨hal-01089993⟩
330 View
102 Download

Altmetric

Share

More