Regular Hedge Model Checking

d'Orso, Julien; Touili, Tayssir

doi:10.1007/978-0-387-34735-6_19

Cited by 5 publications

(3 citation statements)

References 28 publications

(43 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(2) Then, in the case of regular tree model checking where configurations are represented by trees of arbitrary sizes (but fixed arities). These works have been applied to the analysis of parameterized systems with tree topologies [4,7,20,29], and multithreaded programs [10,20,21,42,48]; and (3) in the case of hedge tree model checking, where the configurations of the system are represented by trees of arbitrary width [32,49].…”

mentioning

confidence: 99%

Widening techniques for regular tree model checking

Bouajjani

Touili

2011

Int J Softw Tools Technol Transfer

Self Cite

View full text Add to dashboard Cite

We consider the framework of regular tree model checking where sets of configurations of a system are represented by regular tree languages and its dynamics is modeled by a term rewriting system (or a regular tree transducer). We focus on the computation of the reachability set R * (L) where R is a regular tree transducer and L is a regular tree language. The construction of this set is not possible in general. Therefore, we present a general acceleration technique, called regular tree widening which allows to speed up the convergence of iterative fixpoint computations in regular tree model checking. This technique can be applied uniformly to various kinds of transformations. We show the application of our framework to different analysis contexts: verification of parameterized tree networks and data-flow analysis of multithreaded programs. Parametrized networks are modeled by relabeling tree transducers, and multithreaded programs are modeled by term rewriting rules encoding transformations on control structures. We prove that our widening technique can emulate many existing algorithms for special classes of transformations and we show that it can deal with transformations beyond the scope of these algorithms.

show abstract

mentioning

confidence: 99%

Widening techniques for regular tree model checking

Bouajjani

Touili

2011

Int J Softw Tools Technol Transfer

Self Cite

View full text Add to dashboard Cite

show abstract

“…Unranked trees have also been employed to model multithreaded recursive program configurations where the number of parallel processes is unbounded [3,18]. Hedge-automata (HA) are considered now as the natural model of automata for unranked trees.…”

Section: Introductionmentioning

confidence: 99%

“…There exists other rewriting notions like the top-down XML transformations [12] or the relabeling transducers of [18] but they do not cover our notion since either they use specific hedge traversal strategies or they are structurepreserving.…”

Section: Introductionmentioning

confidence: 99%

Closure of Hedge-Automata Languages by Hedge Rewriting

Jacquemard

Rusinowitch

Rewriting Techniques and Applications

View full text Add to dashboard Cite

Abstract. We consider rewriting systems for unranked ordered terms, i.e. trees where the number of successors of a node is not determined by its label, and is not a priori bounded. The rewriting systems are defined such that variables in the rewrite rules can be substituted by hedges (sequences of terms) instead of just terms. Consequently, this notion of rewriting subsumes both standard term rewriting and word rewriting. We investigate some preservation properties for two classes of languages of unranked ordered terms under this generalization of term rewriting. The considered classes include languages of hedge automata (HA) and some extension (called CF-HA) with context-free languages in transitions, instead of regular languages. In particular, we show that the set of unranked terms reachable from a given HA language, using a so called inverse context-free rewrite system, is a HA language. The proof, based on a HA completion procedure, reuses and combines known techniques with non-trivial adaptations. Moreover, we prove, with different techniques, that the closure of CF-HA languages with respect to restricted context-free rewrite systems, the symmetric case of the above rewrite systems, is a CF-HA language. As a consequence, the problems of ground reachability and regular hedge model checking are decidable in both cases. We give several counter examples showing that we cannot relax the restrictions.

show abstract

Weighted unranked tree automata as a framework for plan recognition

Högberg

Kaati

2010

2010 13th International Conference on Information Fusion

View full text Add to dashboard Cite

Regular Hedge Model Checking

Cited by 5 publications

References 28 publications

Widening techniques for regular tree model checking

Widening techniques for regular tree model checking

Closure of Hedge-Automata Languages by Hedge Rewriting

Weighted unranked tree automata as a framework for plan recognition

Contact Info

Product

Resources

About