Skip to Main content Skip to Navigation
Conference papers

Fault-Based Testing for Refinement in CSP

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.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/hal-01678973
Contributor : Hal Ifip <>
Submitted on : Tuesday, January 9, 2018 - 3:41:05 PM
Last modification on : Tuesday, January 9, 2018 - 4:05:02 PM
Long-term archiving on: : Thursday, May 3, 2018 - 9:51:47 PM

File

449632_1_En_2_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

228

Files downloads

98