Efficient detection of all pointer and array access errors
Todd M. Austin, Scott E. Breach, Gurindar S. Sohi · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · 1994
We present a pointer and array access checking technique that provides complete error coverage through a simple set of program transformations. Our technique, based on an extended safe pointer representation, has a number of novel aspects. Foremost, it is the first technique that detects all spatial and temporal access errors. Its use is not limited by the expressiveness of the language; that is, it can be applied successfully to compiled or interpreted languages with subscripted and mutable pointers, local references, and explicit and typeless dynamic storage management, e.g., C. Because it is a source level transformation, it is amenable to both compile- and run-time optimization. Finally, its performance, even without compile-time optimization, is quite good. We implemented a prototype translator for the C language and analyzed the checking overheads of six non-trivial, pointer intensive programs. Execution overheads range from 130% to 540%; with text and data size overheads typically below 100%.
Cited by 427 works. doi:10.1145/178243.178446 Open-access PDF
Authors
References
- Compilers: Principles, Techniques, and Tools
- An empirical study of the reliability of UNIX utilities
- Garbage collection in an uncooperative environment
- Software defects and their impact on system availability-a study of field failures in operating systems
- SMART POINTERS: THEY''RE SMART, BUT THEY''RE NOT POINTERS
- Efficient program tracing
- Functional Programming
- Adding run‐time checking to the portable C compiler
- Space efficient conservative garbage collection
- A Memory Allocation Profiler for C and Lisp Programs