Efficient online computation of statement coverage

Authors:
Mustafa M. Tikir;Jeffrey K. Hollingsworth
Affiliations:
Department of Computer Science, University of Maryland, College Park, MD 20742, USA;Department of Computer Science, University of Maryland, College Park, MD 20742, USA
Venue:
Journal of Systems and Software
Year:
2005

Citing 11
Cited 3

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Efficient path profiling

Proceedings of the 29th annual ACM/IEEE international symposium on Microarchitecture
ProfileMe: hardware support for instruction-level profiling on out-of-order processors

MICRO 30 Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture
Advanced compiler design and implementation

Advanced compiler design and implementation
Whole program paths

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Residual test coverage monitoring

Proceedings of the 21st international conference on Software engineering
A fast algorithm for finding dominators in a flowgraph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient instrumentation for code coverage testing

ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
MDL: A Language And Compiler For Dynamic Program Instrumentation

PACT '97 Proceedings of the 1997 International Conference on Parallel Architectures and Compilation Techniques
An API for Runtime Code Patching

International Journal of High Performance Computing Applications
Optimal Insertion of Software Probes in Well-Delimited Programs

IEEE Transactions on Software Engineering

An automatically-generated run-time instrumenter to reduce coverage testing overhead

Proceedings of the 3rd international workshop on Automation of software test
Adaptive bug isolation

Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1
An efficient bitwise algorithm for intra-procedural data-flow testing coverage

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Evaluation of statement coverage is the problem of identifying the statements of a program that execute in one or more runs of a program. The traditional approach for statement coverage tools is to use static code instrumentation. In this paper we present a new approach to dynamically insert and remove instrumentation code to reduce the runtime overhead of statement coverage measurement. We also explore the use of dominator tree information to reduce the number of instrumentation points needed. Our experiments show that our approach reduces runtime overhead by 38-90% compared with purecov, a commercial statement coverage tool. Our tool is fully automated and available for download from the Internet.