Effectiveness of genetic algorithms for potential error detection in software using random error seeding

James R. Birt, Renate Sitte

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

2 Citations (Scopus)


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.
Original languageEnglish
Title of host publicationProceedings of the IASTED International Conference on Software Engineering
EditorsPeter Kokol
Place of PublicationCalgary, Canada
PublisherACTA Press
Number of pages6
ISBN (Print)0889864667
Publication statusPublished - 2005
EventIASTED International Conference on Software Engineering: Applied Informatics - Innsbruck, Austria
Duration: 15 Feb 200517 Feb 2005
Conference number: 23rd


ConferenceIASTED International Conference on Software Engineering
Abbreviated titleSE 2006
Internet address


Dive into the research topics of 'Effectiveness of genetic algorithms for potential error detection in software using random error seeding'. Together they form a unique fingerprint.

Cite this