Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Factorial Experiment on Scalability of Search-based Software Testing
Blekinge Institute of Technology, School of Computing.
2009 (English)Independent thesis Advanced level (degree of Master (Two Years))Student thesis
Abstract [en]

Software testing is an expensive process, which is vital in the industry. Construction of the test-data in software testing requires the major cost and knowing which method to use in order to generate the test data is very important. This paper discusses the performance of search-based algorithms (preferably genetic algorithm) versus random testing, in software test-data generation. A factorial experiment is designed so that, we have more than one factor for each experiment we make. Although many researches have been done in the area of automated software testing, this research differs from all of them due to sample programs (SUTs) which are used. Since the program generation is automatic as well, Grammatical Evolution is used to guide the program generations. They are not goal based, but generated according to the grammar we provide, with different levels of complexity. Genetic algorithm is first applied to programs, then we apply random testing. Based on the results which come up, this paper recommends one method to use for software testing, if the SUT has the same conditions as we had in this study. SUTs are not like the sample programs, provided by other studies since they are generated using a grammar.

Place, publisher, year, edition, pages
2009. , p. 43
Keywords [en]
Automated Software Testing, Searchbased Software Testing, Genetic Algorithms, Random Testing, Grammatical Evolution
National Category
Software Engineering
Identifiers
URN: urn:nbn:se:bth-4224Local ID: oai:bth.se:arkivex3DB8CB2EDF809A4FC125764D006E6775OAI: oai:DiVA.org:bth-4224DiVA, id: diva2:831552
Uppsok
Technology
Supervisors
Available from: 2015-04-22 Created: 2009-10-12 Last updated: 2018-01-11Bibliographically approved

Open Access in DiVA

fulltext(431 kB)231 downloads
File information
File name FULLTEXT01.pdfFile size 431 kBChecksum SHA-512
6fe6ef35fa3999aac5a1a9a15b88d5d90ab9aa29ed49551c5cf65b7fbdc883b6241cc2694f3d4dd303c7135e4f0b91dd4d1ac9fd2eac10b5ad74677c4fb78feb
Type fulltextMimetype application/pdf

By organisation
School of Computing
Software Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 231 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 145 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf