-
On quasi-interpretations, blind abstractions and implicit complexity.
International audience -
Tree Automata Completion for 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. For functional programs... -
Bottom-up rewriting for words and terms
Accepte- A paraitre.
