Automated test scenario selection based on levenshtein distance

  • Authors:
  • P. G. Sapna;Hrushikesha Mohanty

  • Affiliations:
  • University of Hyderabad, Hyderabad, India;University of Hyderabad, Hyderabad, India

  • Venue:
  • ICDCIT'10 Proceedings of the 6th international conference on Distributed Computing and Internet Technology
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Specification based testing involves generating test cases from the specification, here, UML. The number of automatically generated test scenarios from UML activity diagrams is large and hence impossible to test completely. This paper presents a method for selection of test scenarios generated from activity diagrams using Levenshtein distance. An activity diagram is transformed into a directed graph representing the sequence of activities. A modified Depth First Algorithm(DFS) is applied to obtain test scenarios. Levenshtein distance is calculated between the scenarios thus generated. The objective is to select the less similar test cases and at the same time provide maximum coverage.