D. Lessens and Hassen Sadi. Automatic verification of parameterized networks of processes by abstraction. Electronic Notes of Theoretical Computer Science (ENTCS), 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Automatic Deductive Verification with Invisible Invariants - Pnueli, Ruah, Zuck (2001) (9 citations) (Correct)
....the method on a non trivial example of a cache protocol, provided by Steve German. 1 Introduction Automatic verification of infinite 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 verification 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 verification of a certain class of parameterized ....
....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 verification 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 97, ....
D. Lesens and H. Saidi. Automatic verification of parameterized networks of processes by abstraction. In 2nd International Workshop on the Verification of Infinite State Systems (INFINITY'97), 1997.
Model Checking in CLP - Delzanno, Podelski (1999) (61 citations) (Correct)
....built in constraint solver; the fixpoint iteration is a source tosource transformation for CLP programs. We have obtained experimental results for several examples of infinite state programs; these examples are quickly becoming benchmarks in the community (see e.g. BGP97, BGP98, SKR98, SUM96, LS97] Our experiments allow us to see that a CLP based tool can solve the considered verification problems at acceptable time cost. Moreover, as CLP combines mathematical and logical reasoning, the CLP based setting helps to find optimizations that are natural, directly implementable and provably ....
.... of the meta programming facilities (e.g. the interchangeability between uninterpreted and interpreted constraints expressions) We have applied the implementation to several infinite state verification problems that are becoming benchmarks in the community (see e.g. BGP97, BGP98, SKR98, SUM96, LS97] This allowed us to evaluate the performance of our implementation, to experiment with evaluation strategies and abstractions through widenings, and to compare our solution with previous solutions. We implement the solving of constraints over integers, which is needed for model checking ....
[Article contains additional citation context not shown here]
D. Lesens and H. Saidi. Automatic Verification of Parameterized Networks of Processes by Abstraction. In Proceedings of the International Workshop on Verification Infinite State Systems (INFINITY'97), available at the URL http://sunshine.cs.uni-dortmund.de/organization/pastE.html, 1997.
Experience with Predicate Abstraction - Das, Dill, Park (1999) (65 citations) (Correct)
....rule. Our method has no such restriction. So, our verifier is more accurate, but may require more computation (which is performed more efficiently) Our approach to handling parameterized systems uses quantified formulas, similar to [17] and [13] which differs from the method presented in [12]. They used linear systems of equations to deal with state transitions. The basic idea is that for each state there is an abstract variable which keeps track of the number of processes in that state. So if a process moves from q to q 0 then the value of X q is decremented by one while X q 0 ....
D. Lessens and H. Saidi. Automatic verification of parameterized networks of processes by abstraction. Electronic Notes of Theoretical Computer Science (ENTCS), 1997.
Automated Deductive Verification of Parallel Systems - Hassen Saidi Verimag Self-citation (Saidi) (Correct)
....already proved using theorem proving techniques, but a big amount of user interaction has been necessary to provide powerful enough auxiliary invariants. We have also used successfully the Invariant Checker tool for the verification of parameterized networks following the techniques described in [15]. Additional information can be found on our experiences using the tool in the Invariant Checker home page [14] 6 Conclusion This paper describes a tool supporting the automated formal verification of invariance properties of parallel processes. It shows how the use of theorem proving ....
D.Lesens and H. Saidi. Automatic Verification of Parameterized Networks of Processes by Abstraction. In Proceedings of the 2nd International Workshop on the Verification of Infinite State Systems (INFINITY'97), Bologna, Italy, July 1997.
Predicate Abstraction - Das (2003) (Correct)
No context found.
D. Lessens and Hassen Sadi. Automatic verification of parameterized networks of processes by abstraction. Electronic Notes of Theoretical Computer Science (ENTCS), 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