Automated test scenario selection based on Levenshtein distance
Automated test scenario selection based on Levenshtein distance
No Thumbnail Available
Date
2010-03-25
Authors
Sapna, P. G.
Mohanty, Hrushikesha
Journal Title
Journal ISSN
Volume Title
Publisher
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. © 2010 Springer.
Description
Keywords
Specification based testing,
Test scenarios selection,
UML activity diagrams
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). v.5966 LNCS