Gregory M. Kapfhammer

Prioritizing Test Suites by Finding Hamiltonian Paths: Preliminary Studies and Initial Results

Suvarshi Bhadra and Gregory M. Kapfhammer. Prioritizing Test Suites by Finding Hamiltonian Paths: Preliminary Studies and Initial Results. In the Proceedings of the 3rd IEEE Testing: Academic and Industrial Conference, Fast Abstract Track, Windsor, England, United Kingdom, August 2008.

Related Projects: Juggernaut

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.

[PDF] [PS] [BibTeX Entry] [Copyright Notice]

---

Links to this Page

• Complete News Listing last edited on 21 October 2009 at 5:22 pm by 141.195.226.29
• Juggernaut last edited on 11 August 2009 at 12:51 pm by 141.195.226.29
• Research Papers last edited on 20 October 2009 at 5:41 pm by 141.195.226.29
• Prioritizing Test Suites by Finding Hamiltonian Paths: Preliminary Studies and Initial Results last edited on 12 August 2008 at 2:20 pm by 141.195.226.29