• Corpus ID: 14470152

Encoding Optimal Customized Coverage Instrumentation

@inproceedings{Ohmann2016EncodingOC,
  title={Encoding Optimal Customized Coverage Instrumentation},
  author={Peter Ohmann and David Bingham Brown and Naveen Neelakandan and Jeff T. Linderoth and Ben Liblit},
  year={2016}
}
Program coverage is an important software quality metric. Coverage is most commonly gathered in the testing lab during development. However, developers also sometimes use inexpensive forms of program coverage in production software. In the post-deployment scenario, users often place very strict requirements on tracing overheads and legal instrumentation strategies. This work deals specifically with optimizing program coverage instrumentation strategies given instrumentation requirements and… 

Figures from this paper

Optimizing customized program coverage
TLDR
It is proved that the problem of determining optimal coverage probes is NP-hard, and a solution based on mixed integer linear programming is presented, and two practical approximation approaches are provided.

References

SHOWING 1-6 OF 6 REFERENCES
Optimizing customized program coverage
TLDR
It is proved that the problem of determining optimal coverage probes is NP-hard, and a solution based on mixed integer linear programming is presented, and two practical approximation approaches are provided.
Residual test coverage monitoring
  • C. Pavlopoulou, M. Young
  • Computer Science
    Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002)
  • 1999
TLDR
Experience with a prototype tool for residual test coverage monitoring of Java programs suggests that, at least for statement coverage, the simple strategy of removing all probes except those corresponding to the residue of coverage testing reduces execution overhead to acceptably low levels.
Lightweight control-flow instrumentation and postmortem analysis in support of debugging
  • Peter Ohmann, B. Liblit
  • Computer Science
    2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE)
  • 2013
TLDR
This work aids post-deployment debugging by giving programmers additional information about program activity shortly before failure, using latent information in post-failure memory dumps, augmented by low-overhead, tunable run-time tracing.
Call-mark slicing: an efficient and economical way of reducing slice
TLDR
This paper proposes a new slicing technique named call-mark slicing that combines static analysis of a program's structure with lightweight dynamic analysis, and the dynamic dependences of the variables are explored.
Gamma system: continuous evolution of software after deployment
TLDR
The GAMMA system enables software producers to perform continuous, minimally intrusive analyses of their software's behavior, and to use the information thus gathered to improve and evolve their software.
Linear programming and extensions
TLDR
This classic book looks at a wealth of examples and develops linear programming methods for their solutions and begins by introducing the basic theory of linear inequalities and describes the powerful simplex method used to solve them.