Add to ORKGInternational audienceWe 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
We present Timbuk - a tree automata library - which implements usual operation- s on tree automata a...
International audienceTerm Rewriting Systems are now commonly used as a modeling language for progra...
We consider rewriting of a regular language with a left-linear term rewriting system. We showtwo com...
International audienceWe aim at defining regular over-approximation of sets of reachable terms for t...
Approximating the set of terms reachable by rewriting finds more and more applications ranging from ...
International audienceTerm rewriting systems are now commonly used as a modeling language for progra...
Invited talkInternational audienceTerm Rewriting Systems (TRSs for short) are a convenient formal mo...
International audienceConsidering an initial set of terms E, a rewriting relation R and a goal set o...
International audienceTerm Rewriting Systems (TRSs) are now commonly used as a modeling language for...
International audienceIn this paper we deal with the verification of safety properties of infinite-sta...
AbstractIn this paper, we study the reachability problem for conditional term rewriting systems. Giv...
Tree Automata Completion is a family of techniques for computing or approximating the set of terms r...
Établir des preuves de bon fonctionnement des programmes est délicat ; on a recours à des outils de ...
AbstractIn this paper we deal with the verification of safety properties of infinite-state systems m...
We present Timbuk - a tree automata library - which implements usual operation- s on tree automata a...
International audienceTerm Rewriting Systems are now commonly used as a modeling language for progra...
We consider rewriting of a regular language with a left-linear term rewriting system. We showtwo com...
International audienceWe aim at defining regular over-approximation of sets of reachable terms for t...
Approximating the set of terms reachable by rewriting finds more and more applications ranging from ...
International audienceTerm rewriting systems are now commonly used as a modeling language for progra...
Invited talkInternational audienceTerm Rewriting Systems (TRSs for short) are a convenient formal mo...
International audienceConsidering an initial set of terms E, a rewriting relation R and a goal set o...
International audienceTerm Rewriting Systems (TRSs) are now commonly used as a modeling language for...
International audienceIn this paper we deal with the verification of safety properties of infinite-sta...
AbstractIn this paper, we study the reachability problem for conditional term rewriting systems. Giv...
Tree Automata Completion is a family of techniques for computing or approximating the set of terms r...
Établir des preuves de bon fonctionnement des programmes est délicat ; on a recours à des outils de ...
AbstractIn this paper we deal with the verification of safety properties of infinite-state systems m...
We present Timbuk - a tree automata library - which implements usual operation- s on tree automata a...
International audienceTerm Rewriting Systems are now commonly used as a modeling language for progra...
We consider rewriting of a regular language with a left-linear term rewriting system. We showtwo com...