Symbolic model checking with rich assertional languages

Kesten, Yonit; Maler, Oded; Marcus, M.; Pnueli, Amir; Shahar, Elad

doi:10.1007/3-540-63166-6_41

Cited by 85 publications

(71 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From a mechanical point of view, the operation of minimal reduction over schemes can be implemented via the operation of transducer (see [24]; cf [4]). It is also possible to analyse further the constructed graph in order to extract a complexity upperbound for the convergence.…”

Section: Discussionmentioning

confidence: 99%

Proving convergence of self-stabilizing systems using first-order rewriting and regular languages

et al. 2001

View full text Add to dashboard Cite

In the framework of self-stabilizing systems, the convergence proof is generally done by exhibiting a measure that strictly decreases until a legitimate configuration is reached. The discovery of such a measure is very specific and requires a deep understanding of the studied transition system. In contrast we propose here a simple method for proving convergence, which regards self-stabilizing systems as string rewrite systems, and adapts a procedure initially designed by Dershowitz for proving termination of string rewrite systems. In order to make the method terminate more often, we also propose an adapted procedure that manipulates "schemes", i.e. regular sets of words, and incorporates a process of scheme generalization. The interest of the method is illustrated on several nontrivial examples.

show abstract

Section: Discussionmentioning

confidence: 99%

Proving convergence of self-stabilizing systems using first-order rewriting and regular languages

et al. 2001

View full text Add to dashboard Cite

show abstract

“…Yet another approach is to use symbolic model checking based on a finite representation of infinite sets of states by means of logics, automata, grammars, etc. Among successful symbolic verification methods, we have the so-called regular (tree) model checking R(T)MC, first mentioned in [36], on which we concentrate in this paper.…”

Section: Introductionmentioning

confidence: 99%

Abstract regular (tree) model checking

Bouajjani

Habermehl

Rogalewicz

et al. 2011

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

Regular model checking is a generic technique for verification of infinite-state and/or parametrised systems which uses finite word automata or finite tree automata to finitely represent potentially infinite sets of reachable configurations of the systems being verified. The problems addressed by regular model checking are typically undecidable. In order to facilitate termination in as many cases as possible, acceleration is needed in the incremental computation of the set of reachable configurations in regular model checking. In this work, we describe how various incrementally refinable abstractions on finite (word and tree) automata can be used for this purpose. Moreover, the use of abstraction does not only increase chances of the technique to terminate, but it also significantly reduces the problem of an explosion in the number of states of the automata that are generated by regular model checking. We illustrate the efficiency of abstract regular (tree) model checking in verification of simple systems with various sources of infinity such as unbounded counters, queues, stacks, and parameters. We then show how abstract regular tree model checking can be used for verification of programs manipulating tree-like dynamic data structures. Even more complex data structures can be handled using a suitable tree-like encoding.

show abstract

“…[1]. Then, symbolic reachability analysis algorithms (see, e.g., [14,7,8,9,18,12,24,10,4,2,3]) can be applied on these (abstract) extended automata-based models in order to verify the desired properties of the original (concrete) system. Of course, abstraction steps remain non-trivial in general for complex systems, even if infinite-state extended automata are used as abstract models.…”

Section: Introductionmentioning

confidence: 99%

Parametric Verification of a Group Membership Algorithm

Bouajjani

Merceron

2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We address the problem of verifying clique avoidance in the TTP protocol. TTP allows several stations embedded in a car to communicate. It has many mechanisms to ensure robustness to faults. In particular, it has an algorithm that allows a station to recognize itself as faulty and leave the communication. This algorithm must satisfy the crucial 'non-clique' property: it is impossible to have two or more disjoint groups of stations communicating exclusively with stations in their own group. In this paper, we propose an automatic verification method for an arbitrary number of stations N and a given number of faults k. We give a faithful abstraction that allows to model the algorithm by means of unbounded (parametric) counter automata. We have checked the nonclique property on this model in the case of one fault, using the ALV tool as well as the LASH tool.

show abstract

Symbolic model checking with rich assertional languages

Cited by 85 publications

References 25 publications

Proving convergence of self-stabilizing systems using first-order rewriting and regular languages

Proving convergence of self-stabilizing systems using first-order rewriting and regular languages

Abstract regular (tree) model checking

Parametric Verification of a Group Membership Algorithm

Contact Info

Product

Resources

About