Testing for Refinement in CSP - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Testing for Refinement in CSP

Résumé

CSP is a well-established formalism for modelling and verifi- cation of concurrent reactive systems based on refinement. Consolidated denotational models and an effective tool have encouraged much work on algebraic reasoning and model checking. Testing techniques based on CSP models, however, have not been widely explored, and in this paper we take a first step by instantiating a long standing theory of formal testing to CSP. We identify the testability hypothesis that we consider necessary to make the use of CSP feasible, define test sets that we prove to be exhaustive with respect to traces and failures refinement, and consider optimisations, inputs and outputs, and selection strategies. All our results are proved in terms of the CSP denotational models. They are a sound foundation for the development of test-generation techniques.
Fichier principal
Vignette du fichier
GaudelCSP.pdf (182.91 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00260928 , version 1 (05-03-2008)

Identifiants

  • HAL Id : hal-00260928 , version 1

Citer

Ana Cavalcanti, Marie-Claude Gaudel. Testing for Refinement in CSP. Formal Methods and Software Engineering, ICFEM 2007, Nov 2007, Boca-Raton, United States. pp.151-170. ⟨hal-00260928⟩
129 Consultations
132 Téléchargements

Partager

Gmail Facebook X LinkedIn More