4.4 Article

Search and similarity based selection of use case scenarios: An empirical study

Journal

EMPIRICAL SOFTWARE ENGINEERING
Volume 23, Issue 1, Pages 87-164

Publisher

SPRINGER
DOI: 10.1007/s10664-017-9500-x

Keywords

Use case modeling; Use case scenario selection; Search algorithms; Similarity functions; Empirical study

Funding

  1. Research Council of Norway [249086]
  2. China Scholarship Council [249086]
  3. RCN
  4. EU
  5. RFF Hovedstaden
  6. EU COST action [MPM4CPS]
  7. Ministry of Industry and Information Technology, China [MJ-S-2012-05]

Ask authors/readers for more resources

Use case modeling is a well-known requirements specification method and has been widely applied in practice. Use case scenarios of use case models are input elements for requirements inspection and analysis, requirements-based testing, and other downstream activities. It is, however, a practical challenge to inspect all use case scenarios that can be obtained from any non-trivial use case model, as such an inspection activity is often performed manually by domain experts. Therefore, it is needed to propose an automated solution for selecting a subset of use case scenarios with the ultimate aim of enabling cost-effective requirements (use case) inspection, analysis, and other relevant activities. Our solution is built on a natural language based, restricted use case modeling methodology (named as RUCM), in the sense that requirements specifications are specified as RUCM use case models. Use case scenarios can be automatically derived from RUCM use case models with the already established Zen-RUCM framework. In this paper, we propose a search-based and similarity-based approach called (SRCUM)-R-3, through an empirical study, to select most diverse use case scenarios to enable cost-effective use case inspections. The empirical study was designed to evaluate the performance of three search algorithms together with eight similarity functions, through one real-world case study and six case studies from literature. Results show that (1+1) Evolutionary Algorithm together with Needleman-Wunsch similarity function significantly outperformed the other 31 combinations of the search algorithms and similarity functions. The combination managed to select 50% of all the generated RUCM use case scenarios for all the case studies to detect all the seeded defects.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available