Name
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-67549-7_2 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Notation,Programming language,Finite set,Computer science,Implementation,Failure semantics,Process calculus | Conference | 10533 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.35 |
References | Authors | |
20 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ana Cavalcanti | 1 | 224 | 18.41 |
| Adenilso Da Silva Simão | 2 | 216 | 23.24 |