Iterating transducers

Dams, Dennis; Lakhnech, Yassine; Steffen, Martín

doi:10.1016/s1567-8326(02)00025-5

Cited by 33 publications

(46 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, we describe how termination can be achieved for local model checking using information from global model checking. In our future work, techniques like widening [7,8] and acceleration [1,3,14,17,20] that are used to achieve termination of global model checking could be incorporated in a more detailed comparison. We believe that the results of this paper are a first step towards a combination of both approaches.…”

Section: Introductionmentioning

confidence: 99%

Global vs. local model checking: a comparison of verification techniques for infinite state systems

Schuele¹,

Schneider²

Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004.

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 99%

Global vs. local model checking: a comparison of verification techniques for infinite state systems

Schuele¹,

Schneider²

Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004.

View full text Add to dashboard Cite

show abstract

“…For regular model checking, methods have been developed for computing the set of reachable configurations or reachable loops [25,16,19,8]. These algorithms typically work well for small system models, but have difficulties to cope with large transition relations.…”

Section: Introductionmentioning

confidence: 99%

Systematic Acceleration in Regular Model Checking

Jönsson

Saksena

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular sets are used as symbolic representation. A major problem in symbolic model checking of parameterized and infinite-state systems is that fixpoint computations to generate the set of reachable states or the set of reachable loops do not terminate in general. Therefore, acceleration techniques have been developed, which calculate the effect of arbitrarily long sequences of transitions generated by some action. We present a systematic method for using acceleration in regular model checking, for the case where each transition changes at most one position in the word; this includes many parameterized algorithms and algorithms on data structures. The method extracts a maximal (in a certain sense) set of actions from a transition relation. These actions, and systematically obtained compositions of them, are accelerated to speed up a fixpoint computation. The extraction can be done on any representation of the transition relation, e.g., as a union of actions or as a single monolithic transducer. Using this approach, we are for the first time able to verify completely automatically both safety and absence of starvation properties for a collection of parameterized synchronization protocols from the literature; for some protocols, we obtain significant improvements in verification time. The results show that symbolic statespace exploration, without using abstractions, is a viable alternative for verification of parameterized systems with a linear topology.

show abstract

“…(1) First in the case of regular word model checking where configurations are encoded as words. These works have been successfully applied to reason about linear parametrized systems (i.e., parametrized systems where the processes are arranged in a linear topology) [12,23,19,13,25,3,4], as well as systems that operate on linear unbounded data structures such as lists, integers, reals, and even hybrid automata [5,11,6], and programs with pointers [9]. (2) Then in the case of regular tree model checking where configurations are represented by trees of arbitrary sizes (but fixed arities).…”

Section: Introductionmentioning

confidence: 99%

“…(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 parametrized systems with tree topologies [17,19,2,1], and multithreaded programs [22,17,14,8,26].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Regular Hedge Model Checking

d'Orso

Touili

Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006

View full text Add to dashboard Cite

Abstract. We extend the regular model checking framework so that it can handle systems with arbitrary width tree-like structures. Configurations of a system are represented by trees of arbitrary arities, sets of configurations are represented by regular hedge automata, and the dynamics of a system is modeled by a regular hedge transducer. We consider the problem of computing the transitive closure T + of a regular hedge transducer T . This construction is not possible in general. Therefore, we present a general acceleration technique for computing T + . Our method consists of enhancing the termination of the iterative computation of the different compositions T i by merging the states of the hedge transducers according to an appropriate equivalence relation that preserves the traces of the transducers. We provide a methodology for effectively deriving equivalence relations that are appropriate. We have successfully applied our technique to compute transitive closures for some mutual exclusion protocols defined on arbitrary width tree topologies, as well as for an XML application.

show abstract

Iterating transducers

Cited by 33 publications

References 35 publications

Global vs. local model checking: a comparison of verification techniques for infinite state systems

Global vs. local model checking: a comparison of verification techniques for infinite state systems

Systematic Acceleration in Regular Model Checking

Regular Hedge Model Checking

Contact Info

Product

Resources

About