This paper studies the effect of introducing random error seeding on the performance of Genetic Algorithms in the identification of error prone paths in software. This is based on our earlier research on identifying the potentially most error prone paths in a program. We use variable length Genetic Algorithms that optimize and select the software paths, which in turn are weighted with sources of error indexes. Although various methods have been applied for detecting and reducing errors in software, there is little research into partitioning a system into smaller error prone domains for testing. Our experiments with error seeding show that by selecting 80% of potential errors or 20% of most error prone paths we can detect on average greater than 65% of the randomly seeded errors.
|Title of host publication||Proceedings of the IASTED International Conference on Software Engineering|
|Place of Publication||Calgary, Canada|
|Number of pages||6|
|Publication status||Published - 2005|
|Event||IASTED International Conference on Software Engineering: Applied Informatics - Innsbruck, Austria|
Duration: 15 Feb 2005 → 17 Feb 2005
Conference number: 23rd
|Conference||IASTED International Conference on Software Engineering|
|Abbreviated title||SE 2006|
|Period||15/02/05 → 17/02/05|
Birt, J. R., & Sitte, R. (2005). Effectiveness of genetic algorithms for potential error detection in software using random error seeding. In P. Kokol (Ed.), Proceedings of the IASTED International Conference on Software Engineering (pp. 162-167). Calgary, Canada: ACTA Press.