Static Checking By Means of Abstract Interpretation - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Static Checking By Means of Abstract Interpretation

Résumé

Dynamic checking are usually easier to use, because the concept are established and wide well know. But they are usually limited to systems whose state space is finite. In an other part, certain faults cannot be detected dynamically, even by keeping track of the history of the state space.Indeed, the classical problem of finding the right test cases is far from trivial and limit the abilities of dynamic checkers further. Static checking have the advantage that they work on a more abstract level than dynamic checker and can verify system properties for all inputs . Problem, it is hard to assure that a violation of a modeled property corresponds to a fault in the concrete system. We propose an approach, in which we generate counter-examples dynamically using the abstract interpretation techniques.
Fichier principal
Vignette du fichier
iccsit-Paper131.pdf (98.36 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00396484 , version 1 (19-06-2009)

Identifiants

  • HAL Id : hal-00396484 , version 1

Citer

Kaninda Musumbu. Static Checking By Means of Abstract Interpretation. 2008 International Conference on Computer Science and Information Technology, Aug 2008, Singapour, Singapore. pp.107 - 112. ⟨hal-00396484⟩

Collections

CNRS
76 Consultations
94 Téléchargements

Partager

Gmail Facebook X LinkedIn More