An Investigation into the Effect of Control and Data Dependence Chain Length on Predicate Testability

by Dave Binkley, James Glenn, Abdullah Alsharif, and Phil McMinn

International Working Conference on Source Code Analysis & Manipulation (SCAM 2020)



The squeeziness of a sequence of program statements captures the loss of information (loss of entropy) caused by its execution. This information loss leads to problems such as failed error propagation. Intuitively, longer more complex statement sequences (more formally, longer paths of dependencies) bring greater squeeze. Using the cost of meta-heuristic search as a measure of lost information, we Following Voas and Miller we use Using the cost of search-based test data generation as a measure of lost information, we investigate this intuition. Unexpectedly, we find virtually no correlation between dependence path length and information loss. Thus our study represents ... [more]


Reference

Dave Binkley, James Glenn, Abdullah Alsharif, and Phil McMinn. An Investigation into the Effect of Control and Data Dependence Chain Length on Predicate Testability. International Working Conference on Source Code Analysis & Manipulation (SCAM 2020), 2020


Bibtex Entry
@inproceedings{Binkley2020,
  author    = "Binkley, Dave and Glenn, James and Alsharif, Abdullah and McMinn, Phil",
  title     = "An Investigation into the Effect of Control and Data Dependence Chain Length on Predicate Testability",
  booktitle = "International Working Conference on Source Code Analysis \& Manipulation (SCAM 2020)",
  year      = "2020"
}