Show simple item record

dc.contributor.authorReisner, Elnatan
dc.contributor.authorSong, Charles
dc.contributor.authorMa, Kin-Keung
dc.contributor.authorFoster, Jeffrey S.
dc.contributor.authorPorter, Adam
dc.date.accessioned2009-06-16T19:11:45Z
dc.date.available2009-06-16T19:11:45Z
dc.date.issued2009-06-16
dc.identifier.urihttp://hdl.handle.net/1903/9094
dc.description.abstractMany modern software systems are designed to be highly configurable, which makes testing them a challenge. One popular approach is combinatorial configuration testing, which, given an interaction strength $t$, computes a set of configurations to test such that all $t $-way combinations of option settings appear at least once. Basically, this approach assumes that interactions are complete in the sense that any combination of $t$ options can interact and therefore must be tested. We conjecture, however, that in practical systems interactions are limited. If our conjecture is true, then new techniques might be developed to identify or approximate infeasible interactions, greatly reducing the number of configurations that must be tested. We evaluated this conjecture with an initial empirical study of several configurable software systems. In this study we used symbolic evaluation to analyze how the settings of run-time configuration options affected a test suite's line coverage. Our results strongly suggest that for these subject programs, test suites and configuration options, at least at the level of line coverage, interactions between configuration options are not complete.en
dc.format.extent405244 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen
dc.relation.ispartofseriesUM Computer Science Departmenten
dc.relation.ispartofseriesCS-TR-4940en
dc.titleEvaluating Interaction Patterns in Configurable Software Systemsen
dc.typeTechnical Reporten


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record