%0 Conference Proceedings
%T Fault-Based Testing for Refinement in CSP
%+ University of York [York, UK]
%+ Universidade de São Paulo = University of São Paulo (USP)
%A Cavalcanti, Ana
%A Simao, Adenilso
%Z Part 1: Model Based Testing
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 29th IFIP International Conference on Testing Software and Systems (ICTSS)
%C St. Petersburg, Russia
%Y Nina Yevtushenko
%Y Ana Rosa Cavalli
%Y Hüsnü Yenigün
%I Springer International Publishing
%3 Testing Software and Systems
%V LNCS-10533
%P 21-37
%8 2017-10-09
%D 2017
%R 10.1007/978-3-319-67549-7_2
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01678973/document
%2 https://inria.hal.science/hal-01678973/file/449632_1_En_2_Chapter.pdf
%L hal-01678973
%U https://inria.hal.science/hal-01678973
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-ICTSS
%~ IFIP-LNCS-10533