Abstract

In debugging processes breakpoints are frequently used toinspect and understand the run-time program behavior. Althoughmodern development environments provide convenient breakpointutilities, it mostly requires considerable human effort to createuseful breakpoints. Before setting a breakpoint or typing abreakpoint condition, developers usually have to make somejudgements and hypotheses based on their observations andexperiences. To reduce such kind of effort, we propose an approachto automatically generating breakpoints for debugging. We combinethe nearest neighbor queries method, dynamic program slicing, andmemory graph comparison to identify suspicious program statementsand states. Based on this information, breakpoints are generated anddivided into two groups, where the primary group containsconditional breakpoints and the secondary group containsunconditional ones. We implement the presented approach on top ofthe Eclipse JDT platform. Our objective experiments and user studyindicate that the generated breakpoints can be effective in aiding debugging work.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.