A path generation method for testing LCSAJs that restrains infeasible paths

✍ Scribed by N Malevris

• Publisher: Elsevier Science
• Year: 1995
• Tongue: English
• Weight: 918 KB
• Volume: 37
• Category: Article
• ISSN: 0950-5849
• DOI: 10.1016/0950-5849(95)98039-i

✦ Synopsis

The testing of all LCSAJs (Linear Code Sequences and Jumps) in a given code unit has been regarded as a very useful and important method for program testing that goes beyond testing program branches. It involves the generation of a set of paths and execution of these paths with sets of data. Thus it can be regarded as a path testing method too; see Woodward et al.' for example. Criteria for selecting such paths have, to date, received scant attention in the literature. In this paper, a suitable path selection strategy which ahns at reducing the number of infeasible paths generated is proposed. The methods embodying this strategy are discussed and their application to a set of program units is reported and analysed. The ability of the methods in providing a high coverage for the LCSAJs in a program is also exposed.