@TechReport{      genet:hal-00921814,
  Author        = "Genet, Thomas",
  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 computing or approximating the set of terms reachable by a rewriting relation. The completion algorithm we focus on is parameterized by a set $E$ of equations controlling the precision of the approximation and influencing 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 $\TF$ for completion algorithm to always terminate. In the particular setting of functional programs, this condition can be relaxed into a condition on $E$ and $\TC$ (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.}",
  affiliation   = "CELTIQUE - INRIA - IRISA",
  date-added    = "2014-05-02 06:40:04 +0000",
  date-modified = "2014-05-02 06:40:04 +0000",
  hal_id        = "hal-00921814",
  Language      = "Anglais",
  Month         = "December",
  Pages         = "15",
  PDF           = "http://hal.inria.fr/hal-00921814/PDF/main.pdf",
  Title         = "{Towards Static Analysis of Functional Programs using Tree Automata Completion}",
  Type          = "Rapport de recherche",
  URL           = "http://hal.inria.fr/hal-00921814",
  Year          = "2013",
  bdsk-url-1    = "http://hal.inria.fr/hal-00921814",
  bdsk-url-2    = "http://users.dsic.upv.es/workshops/wrla2014/",
  File          = "Towards Static Analysis of Functional Programs using Tree Automata Completion - Genet (1) (0) - a - a - u.pdf",
  file-2        = "Towards Static Analysis of Functional Programs using Tree Automata Completion - Genet (2) (0) - a - a - u.pdf",
  file-3        = "Towards Static Analysis of Functional Programs using Tree Automata Completion - Genet (3) (0) - a - a - u.pdf",
  file-4        = "Towards Static Analysis of Functional Programs using Tree Automata Completion - Genet (0) (0) - a - a - u.pdf"
}

@TechReport{ genet:hal-00921814, Author = "Genet, Thomas", 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 computing or approximating the set of terms reachable by a rewriting relation. The completion algorithm we focus on is parameterized by a set $E$ of equations controlling the precision of the approximation and influencing 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 $\TF$ for completion algorithm to always terminate. In the particular setting of functional programs, this condition can be relaxed into a condition on $E$ and $\TC$ (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.}", affiliation = "CELTIQUE - INRIA - IRISA", date-added = "2014-05-02 06:40:04 +0000", date-modified = "2014-05-02 06:40:04 +0000", hal_id = "hal-00921814", Language = "Anglais", Month = "December", Pages = "15", PDF = "http://hal.inria.fr/hal-00921814/PDF/main.pdf", Title = "{Towards Static Analysis of Functional Programs using Tree Automata Completion}", Type = "Rapport de recherche", URL = "http://hal.inria.fr/hal-00921814", Year = "2013", bdsk-url-1 = "http://hal.inria.fr/hal-00921814", bdsk-url-2 = "http://users.dsic.upv.es/workshops/wrla2014/", File = "Towards Static Analysis of Functional Programs using Tree Automata Completion - Genet (1) (0) - a - a - u.pdf", file-2 = "Towards Static Analysis of Functional Programs using Tree Automata Completion - Genet (2) (0) - a - a - u.pdf", file-3 = "Towards Static Analysis of Functional Programs using Tree Automata Completion - Genet (3) (0) - a - a - u.pdf", file-4 = "Towards Static Analysis of Functional Programs using Tree Automata Completion - Genet (0) (0) - a - a - u.pdf" }