Prioritizing test suites by finding Hamiltonian paths: Preliminary studies and initial results
Abstract
This paper describes a technique for prioritizing a test suite by finding the least weight Hamiltonian path in a complete graph that represents relative testing costs. Our technique is especially useful when testing confronts constraints such as quotas in a Web service, memory overhead, or test execution time. During the testing of modern mobile computing devices (e.g., handsets running Google Android), it is often challenging to properly handle memory constraints. Thus, even though we anticipate that our approach is valuable in a wide variety of limited resource environments, this paper focuses on prioritizing test suites for memory constrained execution.
Resources
Reference
Bhadra, S., & Kapfhammer, G. M. (2008). Prioritizing test suites by finding Hamiltonian paths: Preliminary studies and initial results. Fast Abstract Compendium of the 7th Testing: Academic and Industrial Conference – Practice and Research Techniques.
Citing
Want to cite this paper? Look in the BiBTeX file of gkapfham/research-bibliography for the key "Bhadra2008a".
