G. Delzanno, J.-F. Raskin, and L. Van Begin. Attacking Symbolic State Explosion. In Proc. of CAV 2001, vol. 2102 of LNCS, pages 298--310. Springer, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Expand, Enlarge and Check. . . Made Ecient - Gilles Geeraerts Jean-Francois Self-citation (Raskin Van begin) (Correct)
No context found.
G. Delzanno, J.-F. Raskin, and L. Van Begin. Attacking Symbolic State Explosion. In Proc. of CAV 2001, vol. 2102 of LNCS, pages 298--310. Springer, 2001.
Monotonic Extensions of Petri Nets: Forward and Backward Search.. - Raskin (2002) Self-citation (Raskin Van begin) (Correct)
No context found.
G. Delzanno, J.-F. Raskin, and L. Van Begin. Attacking Symbolic State Explosion. In Proc. CAV'01, LNCS 2102, pages 298-310, 2001.
Covering Sharing Trees: A Compact Data Structure for.. - Delzanno, Raskin, Van.. Self-citation (Delzanno Raskin Van begin) (Correct)
No context found.
G. Delzanno, J.-F. Raskin, and L. Van Begin. Attacking Symbolic State Explosion. In Proceedings of the 13th International Conference on Computer Aided Veri cation (CAV 2001), volume 2102 of LNCS, pages 298-310. Springer, 2001. Also appeared as Technical Report 441, Universite Libre de Bruxelles, January 2001.
Concurrent Boolean Programs - Geeraerts, Van Begin Self-citation (Van begin) (Correct)
No context found.
G. Delzanno, J.-F. Raskin, and L. Van Begin. Attacking Symbolic State Explosion. In Proceedings of the 13th International Conference on Computer Aided Veri cation (CAV 2001), volume 2102 of LNCS, pages 298-310. Springer, 2001.
CSTs (Covering Sharing Trees): Compact Data Structures.. - Delzanno, Raskin, Van.. Self-citation (Delzanno Raskin Van begin) (Correct)
No context found.
G. Delzanno, J.-F. Raskin, and L. Van Begin. Attacking Symbolic State Explosion. To appear in Proc. CAV 2001, Paris, July 2001. Also appeared as Technical Report 441, Universite Libre de Bruxelles, January 2001.
Beyond Parameterized Verification - Bozzano, Delzanno (2002) (1 citation) Self-citation (Delzanno) (Correct)
No context found.
G. Delzanno, J.-F. Raskin, and L. Van Begin. Attacking Symbolic State Explosion. In Proc. CAV'01, LNCS 2102, pp. 298-310, 2001.
Monotonic Extensions of Petri Nets: Forward and Backward Search .. - Finkel, al. (2002) Self-citation (Raskin Van begin) (Correct)
....enumerated during the computation and all the operations on sets involved in the algorithm are directly computed on the underlying compact structure that represents the sets. Practical evaluation of the algorithm has shown that it is much more effective than the naive enumerative approach, see [10] for details. In this paper, as a first contribution, we show how to turn into a symbolic algorithm the enumerative algorithm that we have defined in [15] to compute the minimal coverability set of an infinite state Petri net. For this we use a variant of the data structure that we have defined ....
....all the examples of abstractions of multi threated JAVA programs that we have analyzed backwardly in [12] The advantage of the forward approach is that it starts from the set of initial markings and usually generate sets that are more structured than those generated with the backward search. In [10], we have shown that the efficiency of the backward search can be improved substantially by using rough approximations of the forward reachable states in order to guide the search toward initial markings. In our previous works, the over approximation is obtained automatically by computing the ....
[Article contains additional citation context not shown here]
G. Delzanno, J.-F. Raskin, and L. Van Begin. Attacking Symbolic State Explosion. In Proc. CAV'01, LNCS 2102, pages 298-310, 2001.
Constraint-based Verification of Client-Server Protocols - Delzanno, Bultan (2001) (1 citation) Self-citation (Delzanno) (Correct)
....of system states. Then, algorithmic veri cation procedures for temporal formulas are de ned on top of existing constraint solvers such as the Presburger arithmetic solver in [BGP97] Halbwachs polyhedra library in [HHW97] real constraint solvers in [DP99] dedicated graph structures in [DRV01] and composite constraints in [BGL00] In this paper we show that several veri cation problems for protocols designed for clientserver architectures with a potential unbounded number of clients can be naturally solved using the composite constraint approach proposed in [BGL00] a particular ....
.... more structured data structure (e.g. it allows to associate arrays to individual processes) As future works, we think it would be interesting to integrate general purpose constraint solvers with solvers specialized to veri cation problems for concurrent systems like the one presented in [AN00,DRV01] This way, it would be possible to obtain exible, and ecient tools covering a wide range of veri cation problems for nite and in nite state protocols. ....
G. Delzanno, and J. F. Raskin, L. Van Begin. Attacking Symbolic State Explosion. To appear in Proc. CAV
Beyond Parameterized Verification: Automated Verification of .. - Bozzano, Delzanno Self-citation (Delzanno) (Correct)
....a wide class of systems parametric in several dimensions. This abstraction can be viewed as the counterpart of the counting abstraction for systems properties that are sensible to data. Interestingly, the counting abstraction is still useful in the extended setting. Following the methodology of [15], after abstracting a multiset rewriting system into a Petri Net we can use the structural theory of Petri Nets in order to automatically nd invariants that we can use to prune the search space during the backward analysis of the original system. 3) We have implemented our automated veri cation ....
....in P . The initial con guration is the marking m 0 in which there is only one token and it is in place init. The static analysis of Petri Nets can then be used to discover invariants that must hold independently of the values carried by tokens. As an example, following the methodology proposed in [15] we can rst compute automatically place invariants and then apply them to prune the backward search space. For the example of Fig. 2, using a package for Petri Net analysis we automatically obtain the invariants x init x count = 1 and x init x turn = 1, that implies that the number of tokens ....
[Article contains additional citation context not shown here]
G. Delzanno, J.-F. Raskin, and L. Van Begin. Attacking Symbolic State Explosion. In Proc. CAV
Polynomial Time Image Computation with Interval-definable.. - Finkel, Leroux (2004) (Correct)
No context found.
Gorgio Delzanno, Jean-Francois Raskin, and Laurent Van Begin. Attacking symbolic state explosion. In Proc. 13th Int. Conf. Computer Aided Veri - cation (CAV'2001), Paris, France, July 2001, volume 2102 of Lecture Notes in Computer Science, pages 298-310. Springer, 2001.
Image Computation in Infinite State Model Checking - Finkel, al. (2004) (Correct)
No context found.
Gorgio Delzanno, Jean-Francois Raskin, and Laurent Van Begin. Attacking symbolic state explosion. In Proc. 13th Int. Conf. Computer Aided Verification (CAV'2001), Paris, France, July 2001, volume 2102 of Lecture Notes in Computer Science, pages 298--310. Springer, 2001.
Polynomial Time Image Computation with Interval-definable.. - Finkel, Leroux (2004) (Correct)
No context found.
Gorgio Delzanno, Jean-Francois Raskin, and LaurentVan Begin. Attacking symbolic state explosion. In ##### #### #### ##### ######## ########### ###### ########### ###### ####### #### ####,volume 2102 of ############ ## ######## #######, pages 298-310. Springer, 2001.
The Affine Hull of a Binary Automaton is Computable in Polynomial .. - Leroux (2003) (Correct)
No context found.
Delzanno, G., J.-F. Raskin and L. Van Begin, Attacking symbolic state explosion, in: Proc. 13th Int. Conf. Computer Aided Verification (CAV'
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