Code coverage analysis in practice for large systems

Yoram Adler, Noam Behar, Orna Raz, Onn Shehory, Nadav Steindler, Shmuel Ur, Aviad Zlotnick

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

5 Scopus citations


Large systems generate immense quantities of code coverage data. A user faced with the task of analyzing this data, for example, to decide on test areas to improve, faces a 'needle in a haystack' problem. In earlier studies we introduced substring hole analysis, a technique for presenting large quantities of coverage data in a succinct way. Here we demonstrate the successful use of substring hole analysis on large scale data from industrial software systems. For this end we augment substring hole analysis by introducing a work flow and tool support for practical code coverage analysis. We conduct real data experiments indicating that augmented substring hole analysis enables code coverage analysis where it was previously impractical, correctly identifies functionality that is missing from existing tests, and can increase the probability of finding bugs. These facilitate cost-effective code coverage analysis.

Original languageEnglish
Title of host publicationICSE 2011 - 33rd International Conference on Software Engineering, Proceedings of the Conference
Number of pages10
StatePublished - 2011
Externally publishedYes
Event33rd International Conference on Software Engineering, ICSE 2011 - Waikiki, Honolulu, HI, United States
Duration: 21 May 201128 May 2011

Publication series

NameProceedings - International Conference on Software Engineering
ISSN (Print)0270-5257


Conference33rd International Conference on Software Engineering, ICSE 2011
Country/TerritoryUnited States
CityWaikiki, Honolulu, HI


  • code coverage analysis
  • substring hole analysis
  • system test


Dive into the research topics of 'Code coverage analysis in practice for large systems'. Together they form a unique fingerprint.

Cite this