Towards exhaustive branch coverage with PathCrawler - Archive ouverte HAL Access content directly
Conference Papers Year :

Towards exhaustive branch coverage with PathCrawler

(1)
1
Nicky Williams
  • Function : Author
  • PersonId : 940737

Abstract

Branch coverage of source code is a very widely used test criterion. Moreover, branch coverage is a similar problem to line coverage, MC/DC and the coverage of assertion violations, certain runtime errors and various other types of test objective. Indeed, establishing that a large number of test objectives are unreachable, or conversely, providing the test inputs which reach them, is at the heart of many verification tasks. However, automatic test generation for exhaustive branch coverage remains an elusive goal: many modern tools obtain high coverage scores without being able to provide an explanation for why some branches are not covered, such as a demonstration that they are unreachable. Concolic test generation offers the promise of exhaustive coverage but covers paths more efficiently than branches. In this paper, I explain why, and propose different strategies to improve its performance on exhaustive branch coverage. A comparison of these strategies on examples of real code shows promising results.
Fichier principal
Vignette du fichier
camera_ready.pdf (180.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

cea-03224561 , version 1 (11-05-2021)

Identifiers

Cite

Nicky Williams. Towards exhaustive branch coverage with PathCrawler. 2nd ACM/IEEE International Conference on Automation of Software Test AST 2021, May 2021, Madrid, Spain. ⟨cea-03224561⟩
110 View
77 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More