Proving Reachability Properties on Term Rewriting Systems with Strategies
Résumé
We aim at defining regular over-approximation of sets of reachable terms for term rewriting systems applied with a strategy. In this ongoing work, we focus on innermost strategies which are the evaluation strategy of most functional programming languages. Having an accurate over-approximation of reachable terms for functional programming lan-guages would permit to prove richer unreachability properties, i.e. safety properties on such programs.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...