Empirical study - pairwise prediction of fault based on coverage Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/6d570010r

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Researchers/engineers in the field of software testing have valued coverage as a testing metric for decades now. There have been various empirical results that have shown that as coverage increases the ability of the test program to detect a fault also increases. As a result numerous coverage techniques have been introduced. Which coverage criteria co-relates better with fault detection? Which coverage criteria on the other hand have lower correlation with fault detection? In other words, does it make more sense to achieve a higher percentage of c1 kind of coverage over a higher percentage of c2 coverage to gain good fault detection rate. Do the popular block and branch coverage perform better or does path coverage outperform them? Answering these questions will help future engineers/researchers in generating more efficient test suites and in gaining a better metric of measurement. This also helps in test suite minimization. This thesis studies the relationship between coverage and mutant kill-rates over large, randomly generated test suites for statement, branch, predicate, and path coverage of two realistic programs to answer the above open questions. The experiments both confirm conventional wisdom about these coverage criteria and contains a few surprises.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Submitted by Shalini Shamasunder (shamasus@onid.orst.edu) on 2012-07-06T17:07:57Z No. of bitstreams: 1 ShamasunderShalini2012.pdf: 1034654 bytes, checksum: 808eadfee37a5f311e371ab2fab70f07 (MD5)
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2012-07-13T15:51:12Z (GMT) No. of bitstreams: 1 ShamasunderShalini2012.pdf: 1034654 bytes, checksum: 808eadfee37a5f311e371ab2fab70f07 (MD5)
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2012-07-16T20:24:40Z (GMT) No. of bitstreams: 1 ShamasunderShalini2012.pdf: 1034654 bytes, checksum: 808eadfee37a5f311e371ab2fab70f07 (MD5)
  • description.provenance : Made available in DSpace on 2012-07-16T20:24:40Z (GMT). No. of bitstreams: 1 ShamasunderShalini2012.pdf: 1034654 bytes, checksum: 808eadfee37a5f311e371ab2fab70f07 (MD5) Previous issue date: 2012-06-14

Relationships

In Administrative Set:
Last modified: 08/09/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items