E. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In CONCUR'95, pages 395--407, 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....have been proposed for the uniform veri cation of parameterized systems. These include explicit induction ( 8] network invariants, which can be viewed as implicit induction ( 13] 24] 9] 15] methods that can be viewed as abstraction and approximation of network invariants ( 3] 23] [4]) and other methods that can be viewed as based on abstraction ( 10] 7] None of these previous articles could deal with proofs of liveness properties of parameterized systems. Our approach to veri cation by network invariants has been presented rst in [11] The work in [11] was based on a ....

E. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In 6th International Conference on Concurrency Theory (CONCUR'95), pages 395-407, 1995.

.... N 0 , such that validity of (1) over S[N ] for every N N 0 suces to establish its validity for all N N [APR 01,EN95,EN96,EK00,PRZ01] To prove the liveness property of a parameterized system, we propose a variant of the network invariant strategy of [KP00] see also [WL89,BCG86,CGJ95] KM95] The approach is described by: 1. Divine a network invariant I which is an fds intended to provide an abstraction for the parallel composition of P 2 k k Pn for any n c for some small constant c. 2. Con rm that I is indeed a network invariant, by verifying that P 2 v I and ....

E.M. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In 6th International Conference on Concurrency Theory (CONCUR'95), pages 395-407, 1995.

....proposed for the uniform verification of parameterized systems. These include explicit induction [EN96,SG92] network invariants, which can be viewed as implicit induction [WL89,HLR92,LHR97,KM95,KP00] methods that can be viewed as abstraction and approximation of network invariants [BCG86,SG89,CGJ95] and other methods that can be viewed as based on abstraction [ID96,EN96] Regular model checking has been advocated by [KMM 97] and [WB98] as a uniform paradigm for algorithmic verification of several classes of parameterized and infinite state systems. The use of regular languages to ....

E.M. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In 6th International Conference on Concurrency Theory (CONCUR'95), pages 395--407, Philadelphia, PA, August 1995.

.... sound but not guaranteed complete (i.e. a path upstairs maps to a path downstairs , but paths downstairs do not necessarily lift) Other methods can be fully automated but do not appear to have a clearly defined class of protocols on which they are guaranteed to terminate successfully (cf. [5], 23] 21] For systems with CCS processes German and Sistla [11] combine automata theoretic method with process closures to permit efficient solution to PMCP for single index properties, modulo deadlock. But efficient solution is only yielded for processes in a single class. Even for systems ....

E.M. Clarke, O. Grumberg and S. Jha. Verifying Parametrized Networks using Abstracion and Regular Languages. In CONCUR '95: Concurrency Theory, Proceedings of the 6th International Conference, LNCS 962, pages 395-407, Springer-Verlag, 1995.

.... of [EK00] The sound but incomplete methods include methods based on explicit induction ( EN95] network invariants, which can be viewed as implicit induction ( KM95] WL89] HLR92] LHR97] methods that can be viewed as abstraction and approximation of network invariants ( BCG86] SG89] CGJ95] KP00] and other methods that can be viewed as based on abstraction ( ID96] The papers in [CR99a,CR99b,CR00] use structural induction based on the notion of a network invariant but signi cantly enhance its range of applicability by using a generalization of the data independence approach ....

E.M. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In 6th International Conference on Concurrency Theory (CONCUR'95), pages 395-407, Philadelphia, PA, August 1995.

.... of [EK00] The sound but incomplete methods include methods based on explicit induction ( EN95] network invariants, which can be viewed as implicit induction ( KM95] WL89] HLR92] LHR97] methods that can be viewed as abstraction and approximation of network invariants ( BCG86] SG89] [CGJ95] KP00]) and other methods that can be viewed as based on abstraction ( ID96] The papers in [CR99a,CR99b,CR00] use structural induction based on the notion of a network invariant but signi cantly enhance its range of applicability by using a generalization of the data independence approach which ....

E.M. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In CONCUR'95, pp. 395-407.

.... of [EK00] The sound but incomplete methods include methods based on explicit induction ( EN95] network invariants, which can be viewed as implicit induction ( KM95] WL89] HLR92] LHR97] methods that can be viewed as abstraction and approximation of network invariants ( BCG86] SG89] [CGJ95] KP00]) and other methods that can be viewed as based on abstraction ( ID96] The papers in [CR99a,CR99b,CR00] use structural induction based on the notion of a network invariant but significantly enhance its range of applicability by using a generalization of the data independence approach which ....

E.M. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In CONCUR'95, pp. 395--407.

.... of [EK00] The sound but incomplete methods include methods based on explicit induction ( EN95] network invariants, which can be viewed as implicit induction ( KM95] WL89] HLR92] LHR97] methods that can be viewed as abstraction and approximation of network invariants ( BCG86] SG89] CGJ95] KP00] and other methods that can be viewed as based on abstraction ( ID96] Most of these methods require the user to provide auxiliary constructs, such as a network invariant or an abstraction mapping. Other attempts to verify parameterized protocols such as Burn s protocol [JL98] and ....

E.M. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In 6th International Conference on Concurrency Theory (CONCUR '95), pages 395--407, Philadelphia, PA, August 1995.

....the correctness of the original protocol therefrom. The appendix also carries a brief description of the hand proof of the protocol. 2 Related Work The general problem of verifying systems with replicated components is known to be undecidable [13, 11] Some induction based approaches proposed in [14, 5, 6, 19] for verifying particular classes of problems require an invariant process or a network invariant. The generation of such invariants is non trivial and it s automation is restricted and expensive [17, 1, 18, 11] The idea of exploiting symmetry to reduce the size of the state space in automatic ....

E.M. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In CONCUR'95, 1995.

....notion of parallel composition and stronger than the property to be established. The network invariant approach is applicable to parameterized systems consisting of a number of copies of identical components (or components drawn from some nite set) that are composed in parallel. Another approach[CGJ95] aims to nitely representthe state space and transition relation of the entire family of nite state systems comprising a given parameterized system, and has been used in [KMM # 97]to extend symbolic model checking [McM93] to the veri cation of parameterized systems. This method requires the ....

E. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In ####### #### ###, 1995.

....concentrated on the parameterized verification of safety properties. Using these extensions, we managed to verify the property of accessibility for some of the protocols considered above. Related Work There are several results on algorithmic verification of parameterized systems [SG92,AJ98,CGJ95] In most of these works the transitions are guarded by local conditions involving the local states of a fixed (unparameterized) number of processes, in contrast with the general global dependency which is allowed in [KMM 97,ABJN99,JN00] The notions of speed ups and acceleration of ....

....algorithm [GZ98,MAB 94,MP90] relied on abstraction functions or lemmas provided by the user. Other approaches to uniform parameterized verification are based on induction, where the user supplies the induction hypothesis either in the form of an assertion or in the form of a network invariant [CGJ95,KM89,WL89] A recent work which has a significant overlap with our work has been presented by Bodeveix and Filali in [BF00] Similarly to our approach, they advantageously employ the expressive power of ws1s to present explicit formulas which capture various acceleration schemes. They report ....

E.M. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In 6th International Conference on Concurrency Theory (CONCUR'95), pages 395--407, Philadelphia, PA, August 1995.

....which is the subject of our control abstraction. These include explicit induction ( EN95] SG92] network invariants, which can be viewed as implicit induction ( KM95] WL89] HLR92] LHR97] methods that can be viewed as abstraction and approximation of network invariants ( BCG86] SG89] CGJ95] and other methods that can be viewed as based on abstraction ( ID96] EN96] The approach described here is based on the idea of network invariants as introduced in [WL89] and elaborated in [KM95] into a working method. There has been extensive study of the use of data abstraction ....

E.M. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In 6th International Conference on Concurrency Theory (CONCUR'95), pages 395--407, Philadelphia, PA, August 1995.

....uniform verification of parameterized systems. These include explicit induction ( EN95] SG92] network invariants, which can be viewed as implicit induction ( KM89] WL89] HLR92] LHR97] methods that can be viewed as abstraction and approximation of network invariants ( BCG86] SG89] CGJ95] and other methods that can be viewed as based on abstraction ( ID96] EN96] In this methodologically simplistic paper, we go back to basics and claim that, with an appropriate choice of an expressive but decidable assertional language, the good old paradigm of symbolic model checking is ....

....in detail symbolic model checking with the assertional languages of regular sets and tree regular sets. For the case of regular sets of strings, we show that many of the examples previously verified using specialized representations or additional theories, such as the examples considered in [CGJ95] ID96] and [EN96] can be solved by this single and simple approach. The use of regular assertional tree languages is new (except for a brief mention in [HJJ 96] and its application to a uniform verification of the Futurebus system will be a very convincing evidence to the power of the ....

[Article contains additional citation context not shown here]

E.M. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In 6th International Conference on Concurrency Theory (CONCUR'95), pages 395--407, Philadelphia, PA, August 1995.

....systems, which is the subject of our control abstraction. These include explicit induction ( 12] 33] network invariants, which can be viewed as implicit induction ( 20] 35] 15] 23] methods that can be viewed as abstraction and approximation of network invariants ( 4] 32] [6]) and other methods that can be viewed as based on abstraction ( 16] 13] The approach described here is based on the idea of net 2 Yonit Kesten, Amir Pnueli: Control and Data Abstraction: The Cornerstones of Practical Formal Verification. work invariants as introduced in [35] and ....

E.M. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In 6th International Conference on Concurrency Theory (CONCUR'95), pages 395--407, Philadelphia, PA, August 1995.

....notion of parallel composition and stronger than the property to be established. The network invariant approach is applicable to parameterized systems consisting of a number of copies of identical components (or components drawn from some nite set) that are composed in parallel. Another approach [CGJ95] aims to nitely represent the state space and transition relation of the entire family of nite state systems comprising a given parameterized system, and has been used in [KMM 97] to extend symbolic model checking [McM93] to the veri cation of parameterized systems. This method requires the ....

E. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In CONCUR, LNCS 962, 1995.

....but often relies on human help for the introduction of appropriate lemmas or invariants . The second is by reduction to the verification problem for a fixed small size (e.g. N=2) see, e.g. 10,17] but works only for restrictive classes of rings. The third is by abstraction (see, e.g. [8,18,15]) an abstract model of the ring is provided depending on the property P to be proved, then an invariant property is generated from which P follows. In this kind of works, property P concerns the global state of the system. This state is an N tuple (q 1 ; q N ) and viewed as a word q 1 ....

....P concerns the global state of the system. This state is an N tuple (q 1 ; q N ) and viewed as a word q 1 : q N defined on the alphabet Sigma of states of the individual components. The property P is expressed as an inclusion relationship into a regular language. For example (see [8]) for expressing the property of mutual exclusion algorithm for processes on a ring, it suffices to state that the configurations of the ring belong to the regular language n c n where c (resp. n) means that the component is (resp. is not) in the critical section. Such methods are ....

E.M. Clarke, O. Grumberg and S. Jha. "Verifying Parametrized Networks Using Abstraction and Regular Languages", Proc. CONCUR'95, LNCS 962, SpringerVerlag, 1995, pp. 395--407.

No context found.

E. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In CONCUR'95, pages 395--407, 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC