For you have no place of refuge, the bed you have made is too short to lie on. The blankets are too narrow to cover you. Isaiah 28:20 (NLT)

Resource constrained embedded devices are becoming increasingly popular and affordable. Software for these devices is often implemented in the Java programming language because the Java compiler and virtual machine provide enhanced safety, portability, and the potential for run-time optimization. It is important to verify that a software application executes correctly in the environment in which it will normally execute, even if this environment is an embedded one that severely constrains memory resources. Testing can be used to isolate defects within and establish a confidence in the correctness of a Java application that executes in a resource constrained environment. However, executing test suites with a Java virtual machine that uses dynamic compilation to create native code bodies can create significant testing time overheads if memory resources are highly constrained. This research project is developing an approach that uses adaptive code unloading to ensure that it is feasible to perform testing in the actual memory constrained execution environment. We are also creating and evaluating methods that find cost-effective test orderings by using traveling salesperson problem (TSP) solvers to find low-cost Hamiltonian paths in complete graphs.

Related Papers

Related Presentations

Project Team

  • Gregory M. Kapfhammer (Allegheny College)
  • Mary Lou Soffa (University of Virginia)
  • Daniel Mosse (University of Pittsburgh)
  • Chandra Krintz (University of California, Santa Barbara)
  • Suvarshi Bhadra (Allegheny College)

This research project is supported by research and travel grants from the Department of Computer Science and the Dean's Office at Allegheny College. Please refer to Research for a complete listing of my current research activities.

Links to this Page