ct 16(7): e4

Research Article

Facilitating Requirements Inspection with Search-Based Selection of Diverse Use Case Scenarios

Download929 downloads
  • @ARTICLE{10.4108/eai.3-12-2015.2262435,
        author={Huihui Zhang and Tao Yue and Shaukat Ali and Chao Liu},
        title={Facilitating Requirements Inspection with Search-Based Selection of Diverse Use Case Scenarios},
        journal={EAI Endorsed Transactions on Creative Technologies},
        volume={3},
        number={7},
        publisher={ACM},
        journal_a={CT},
        year={2016},
        month={5},
        keywords={use case inspection, scenarios selection, search algorithms, similarity functions, empirical study},
        doi={10.4108/eai.3-12-2015.2262435}
    }
    
  • Huihui Zhang
    Tao Yue
    Shaukat Ali
    Chao Liu
    Year: 2016
    Facilitating Requirements Inspection with Search-Based Selection of Diverse Use Case Scenarios
    CT
    EAI
    DOI: 10.4108/eai.3-12-2015.2262435
Huihui Zhang1, Tao Yue2,*, Shaukat Ali3, Chao Liu1
  • 1: Beihang University
  • 2: Simula Research Laboratory and University of Oslo
  • 3: Simula Research Laboratory
*Contact email: tao@simula.no

Abstract

Use case scenarios are often used for conducting requirements inspection and other relevant downstream activities. While working with industrial partners, we discovered that an automated solution is required for optimally selecting a subset of use case scenarios, aiming to enable cost-effective requirements inspection. In this paper, relying on a natural language based use case modeling methodology to specify requirements as use case models and derive use case scenarios automatically, we propose a search based and similarity function based approach to optimally select most diverse use case scenarios from the ones automatically generated from the use case models. We conducted an empirical study to evaluate the performance of various search algorithms together with eight similarity functions, through an industrial case study and six case studies from the literature. Results show that the search algorithms significantly outperformed Random Search and (1+1) Evolutionary Algorithm together with the Normalized Longest Common Subsequence (NLCS) similarity function performed significantly better than the other 31 combinations of the search algorithms and similarity functions for most of the problems.