David Lesens and Hassen Sadi. Automatic veri cation of parameterized networks of processes by abstraction. In Faron Moller, editor, 2nd International Workshop on Veri cation of In nite State Systems: In nity '97, volume 9 of Electronic Notes in Theoretical Computer Science, Bologna, Italy, July 1997. Elsevier.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and experimental improvements. Our ongoing e orts are focused on mechanizing the heuristics for approximations. As the veri cation problem for shape properties is undecidable, we cannot hope for a fully automated procedure that works on all instances. However, there have been successful attempts [23] to automate similar approximation heuristics using recognition of pattern growth in (regular) expressions, based on the framework of widening [7, 8] Also, we can potentially bene t from the design of theorem proving tools, such as ACL2 [20] which successfully recognize induction patterns in ....

D. Lesens, N. Halbwachs, and P. Raymond. Automatic veri cation of parameterized networks of processes. Theoretical Computer Science, 256:113-144, 2001.

....components. An extension of this abstraction technique is implemented within the Mur veri cation system [21] Similarly a fully automated approach for verifying parameterized networks with synchronous communucation is proposed in [28, 29] and a tool based on the network grammar approach [49] is designed to help in the construction of invariants. Lack of space prohibits description of other related results which concentrate on the abstraction of a complex system, for example [35, 58] General induction To our knowledge, this class of induction has not been investigated previously in ....

D. Lesens, N. Halbwachs, and P. Raymond. Automatic veri cation of parameterized networks of processes. Theoretical Computer Science, 256(1-2):113-144, April 2001.

....veri cation based on syntactic manipulations of the transition function of the design. These techniques are classi ed as bottomup methods. Among the most successful approaches to proving invariants and other properties for in nite state systems are those based on predicate abstraction [3, 6, 8, 4, 5]. In predicate abstraction, the in nite state system is abstracted into a nite system using a set of predicates on the system variables. These predicates are usually provided by the user. If the properties of interest hold for the nite abstract system, they hold for the in nite system. Another ....

D. Lesens and H. Sa  idi. Automatic veri cation of parameterized networks of processes by abstraction. In the 2nd International Workshop on the Veri cation of In nite State Systems (INFINITY'97), July 1997.

....illustrate the method on a non trivial example of a cache protocol, provided by Steve German. 1 Introduction Automatic veri cation of in nite state systems in general, and parameterized systems in particular, have been the focus of much research recently (see, e.g. ES96,ES97,CFJ96,GS97,ID96,LS97,RKR 00] Most of this research concentrates on model checking techniques for veri cation of such systems, using symmetry reduction and similar methods to make model checking more tractable. In this paper we present a method for the automatic veri cation of a certain class of parameterized ....

....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 Szymanski s algorithm [GZ98,MAB 94,MP90] relied on abstraction functions or lemmas provided by the user. The work in [LS97] deals with the veri cation of safety properties of parameterized networks by abstracting the behavior of the system. PVS ( SOR93] is used to discharge the generated VCs. Among the automatic incomplete approaches, we should mention the methods relying on regular model checking [KMM ....

D. Lesens and H. Saidi. Automatic verication of parameterized networks of processes by abstraction. In 2nd International Workshop on the Verication of Innite State Systems (INFINITY'97), 1997.

....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 Szymanski s algorithm [GZ98,MAB 94] relied on abstraction functions or lemmas provided by the user. The work in [LS97] deals with the veri cation of safety properties of parameter ized networks by abstracting the behavior of the system. PVS ( SOR93] is used to discharge the generated VCs. Among the automatic incomplete approaches, we should mention the methods relying on regular model checking [KMM ....

D. Lesens and H. Saidi. Automatic verication of parameterized networks of processes by abstraction. In INFINITY'97, 1997.

....min returns the smallest non zero value of its arguments. 94 8 The two process Bakery algorithm. 97 9 The nite partition for the two process Bakery algorithm. 98 10 The n process discrete time Fischer s protocol as described in [62]. t is a global timer. lock is a shared variable, and c i s are local variables. 100 viii List of Tables 1 Formulas checked for Fischer s protocol. zero one is an atomic proposition that is true when there are less then two processes in l ....

....in assignments of the form x : y c. Chapter 8. The Multi Process Bakery Algorithm 100 Critical section c i : t t c i 2 lock : i lock : 0 lock 6= i t : t 1 (a) b) lock = i c i : t lock = 0 t c i 2 Figure 10: The n process discrete time Fischer s protocol as described in [62]. t is a global timer. lock is a shared variable, and c i s are local variables. Lemma 8.0.8 Given an EA A, an assignment of the form x : y appearing in A preserves the partition induced by . Lemma 8.0.8 is true because of the following: 8 1 ; 2 such that 1 2 , let 1 0 = 1 [x ....

[Article contains additional citation context not shown here]

D. Lesens and H. Sadi. Automatic verication of parameterized networks of processes by abstraction. In Proceedings of the 2nd International Workshop on Verication of Innite State Systems (INFINITY'97), Bologna, July 1997.

....correctly computes the ( nite) bisimulation induced partition. 11 Du and Ramakrishnan and Smolka Critical section c i : t t c i 2 lock : i lock : 0 lock 6= i t : t 1 (a) b) lock = i c i : t lock = 0 t c i 2 Fig. 4. The n process Fischer s protocol as described in [13]. t is a global timer. lock is a shared variable, and c i s are local variables. For some systems, however, in nitely many new constraints may be generated unless an appropriate bound is placed on the number of iterations. An example of such a system is the version of the n process Fischer s ....

....variable, and c i s are local variables. For some systems, however, in nitely many new constraints may be generated unless an appropriate bound is placed on the number of iterations. An example of such a system is the version of the n process Fischer s mutual exclusion protocol described in [13] and reproduced here as Figure 4. On the other hand, this protocol is in SPPA, for any xed n. It has three forms of assignments: 1) lock : i, where i is a constant; 2) c i : t; and (3) t : t 1. Techniques for determining membership in SPPA as discussed in Section 4 can be directly used to ....

D. Lesens and H. Sadi. Automatic verication of parameterized networks of processes by abstraction. In Proceedings of the 2nd International Workshop on Verication of Innite State Systems (INFINITY'97), Bologna, July 1997.

....in this paper and relate them to veri cation problems of parameterized systems. Semi automatic methods for parameterized system have been investigated in [BCG89,CGJ97,DDH 92,KM89,LD90,MS91,WL89] whereas abstraction techniques for parameterized systems have been investigated in [GS97,LHR97,LS97] another source of inspiration for our work) In [ACJT96,BGP97,DP99] constraints are used as symbolic representation of (potentially in nite) sets of states. Finally, relaxation techniques for handling linear constraints in program analysis and automatic veri cation have been investigated in ....

D. Lesens and H. Saidi. Automatic Verication of Parameterized Networks of Processes by Abstraction. In Proc. Int. Workshop. on Verication Innite State Systems (INFINITY'97), 1997.

....problem. Alternative techniques are necessary in order to reason on (possibly in nite) families of processes. Network invariants [KM89,WL89,LHR97] bisimulation relations [BCG89] theorem proving [LD90] regular languages [ABJN99,PD95] network grammars [CGJ97] abstract interpretation [LS97] search procedures [GS92,EN98] well structured systems [AJ98] are examples of techniques used to attack di erent instances of the problem. Though in general the veri cation problem for parameterized concurrent systems is undecidable [AK86] decision procedures have been discovered for the veri ....

....may contain tests for zero or constants (transformations are as for broadcast protocols, see Remark 3) in this case the termination and precision of the analysis is guaranteed only for subclasses. Automated generation of abstract transition graphs for parameterized systems has been studied in [LS97] In [LS97] Lesens and Sa di compute abstract networks using counters to keep track of the number of processes in a given state. Di ently from our approach, they consider only linear transformations (as in Broadcast Protocols) they do not give decision procedures for subclasses of the ....

[Article contains additional citation context not shown here]

D. Lesens and H. Saidi. Automatic Verication of Parameterized Networks of Processes by Abstraction. In Proc. Int. Workshop on Verication Innite State Systems (INFINITY'97), 1997.

No context found.

David Lesens and Hassen Sadi. Automatic veri cation of parameterized networks of processes by abstraction. In Faron Moller, editor, 2nd International Workshop on Veri cation of In nite State Systems: In nity '97, volume 9 of Electronic Notes in Theoretical Computer Science, Bologna, Italy, July 1997. Elsevier.

No context found.

D. Lesens and H. Saidi. Automatic Verication of Parameterized Networks of Processes by Abstraction. In Proceedings of the International Workshop on Verication Innite State Systems (INFINITY'97), 1997.

No context found.

D. Lesens and H. Saidi. Automatic Veri- cation of Parameterized Networks of Processes by Abstraction. In Proceedings of the International Workshop on Verication Innite State Systems (INFINITY'97), available at the URL http://sunshine.cs.unidortmund. de/organization/pastE.html, 1997.

No context found.

D. Lesens and H. Saidi. Automatic Veri- cation of Parameterized Networks of Processes by Abstraction. In Proceedings of the International Workshop on Verication Innite State Systems (INFINITY'97), available at the URL http://sunshine.cs.unidortmund. de/organization/pastE.html, 1997.

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