Poor man's watchpoints
- 3 January 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 30 (1) , 37-44
- https://doi.org/10.1145/199818.199852
Abstract
Bugs that result from corruption of program data can be very difficult to track down without specialized help from a debugger. If the debugger cannot help the user find the point at which data gets corrupted, the user may have a long iterative debugging task. If the debugger is able to stop execution of the program at the point where data gets corrupted, as with watchpoints (also known as data breakpoints), it may be a very simple task to find a data corruption bug. In this paper, we discuss a method of implementing watchpoints on a system without hardware watchpoint support. By instrumenting the program code to check memory accesses, and supplying an interface to the instrumentation in the debugger, we provide an efficient, general method of implementing watchpoints.Keywords
This publication has 5 references indexed in Scilit:
- Rewriting executable files to measure program behaviorSoftware: Practice and Experience, 1994
- Practical data breakpointsPublished by Association for Computing Machinery (ACM) ,1993
- Efficient data breakpointsPublished by Association for Computing Machinery (ACM) ,1992
- Efficient data breakpointsACM SIGPLAN Notices, 1992
- Fast breakpoints: design and implementationPublished by Association for Computing Machinery (ACM) ,1990