Flat Acceleration in Symbolic Model Checking - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

Flat Acceleration in Symbolic Model Checking

Résumé

Symbolic model checking provides partially effective verification procedures that can handle systems with an infinite state space. So-called “acceleration techniques” enhance the convergence of fixpoint computations by computing the transitive closure of some transitions. In this paper we develop a new framework for symbolic model checking with accelerations. We also propose and analyze new symbolic algorithms using accelerations to compute reachability sets.
Fichier principal
Vignette du fichier
BFLS05-atva.pdf (272.3 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00346302 , version 1 (15-12-2008)

Identifiants

Citer

Sébastien Bardin, Alain Finkel, Jérôme Leroux, Philippe Schnoebelen. Flat Acceleration in Symbolic Model Checking. Third International Symposium, ATVA 2005, 2005, Taipei, Taiwan. pp.474-488, ⟨10.1007/11562948_35⟩. ⟨hal-00346302⟩
67 Consultations
189 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More