Fault-Based Testing for Refinement in CSP - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Fault-Based Testing for Refinement in CSP

(1) , (2)
1
2
Ana Cavalcanti
  • Function : Author
  • PersonId : 1026242

Abstract

The process algebra CSP has been studied as a modeling notation for test derivation. Work has been developed using its trace and failure semantics, and their refinement notions as conformance relations. In this paper, we propose a procedure for online test generation for selection of finite test sets for traces refinement from CSP models, based on the notion of fault domains, that is, focusing on the set of faulty implementations of interest. We investigate scenarios where the verdict of a test campaign can be reached after a finite number of test executions. We illustrate the usage of the procedure with a small case study.
Fichier principal
Vignette du fichier
449632_1_En_2_Chapter.pdf (304.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01678973 , version 1 (09-01-2018)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Ana Cavalcanti, Adenilso Simao. Fault-Based Testing for Refinement in CSP. 29th IFIP International Conference on Testing Software and Systems (ICTSS), Oct 2017, St. Petersburg, Russia. pp.21-37, ⟨10.1007/978-3-319-67549-7_2⟩. ⟨hal-01678973⟩
64 View
66 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More