A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
SPLat: lightweight dynamic analysis for reducing combinatorics in testing configurable systems
2013
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2013
Many programs can be configured through dynamic and/or static selection of configuration variables. A software product line (SPL), for example, specifies a family of programs where each program is defined by a unique combination of features. Systematically testing SPL programs is expensive as it can require running each test against a combinatorial number of configurations. Fortunately, a test is often independent of many configuration variables and need not be run against every combination.
doi:10.1145/2491411.2491459
dblp:conf/sigsoft/KimMKBSBd13
fatcat:co25nzsvy5aa5blkjyz7lbjvki