research-article

The omission finder for debugging what-should-have-happened bugs in object-oriented programs

Authors:

Kouhei Sakurai,

Hidehiko MasuharaAuthors Info & Claims

SAC '15: Proceedings of the 30th Annual ACM Symposium on Applied Computing

Pages 1962 - 1969

https://doi.org/10.1145/2695664.2695735

Published: 13 April 2015 Publication History

Abstract

Trace-based debuggers help a debugging process by displaying a history of executed operations with their parameters in a run of a program. However, those debuggers are unable to provide any clues when a program does not perform operations that ought to occur. This paper proposes a novel feature called the omission finder for trace-based debuggers. This feature correlates points-to analysis results with an execution history to show operations that could have been but actually were not performed on a specified instance if the program behaved differently. We implemented the omission finder on top of an existing trace-based debugger, and confirmed reduction of the number of debugging steps with an omission bug in a real-world program. Our user-study also showed reduction of debugging times with programs containing omission bugs.

References

[1]

H. Agrawal et al. Incremental regression testing. ICSM '93, pp. 348--357, 1993.

Digital Library

[2]

M. Bravenboer and Y. Smaragdakis. Strictly declarative specification of sophisticated points-to analyses. OOPSLA '09, pp. 243--262, 2009.

Digital Library

[3]

C. Hofer et al. Design and implementation of a backward-in-time debugger. NODe/GSEM '06, pp. 17--32, 2006.

[4]

A. Ko and B. Myers. Debugging reinvented: Asking and answering why and why not questions about program behavior. ICSE '08, pp. 301--310, 2008.

Digital Library

[5]

B. Lewis. Debugging backwards in time. AADEBUG '03, 2003.

[6]

O. Lhoták and K.-C. A. Chung. Points-to analysis with efficient strong updates. POPL '11, pp. 3--16, 2011.

Digital Library

[7]

O. Lhoták and L. Hendren. Scaling Java points-to analysis using SPARK. CC '03, pp. 153--169, 2003.

Digital Library

[8]

O. Lhoták and L. Hendren. Evaluating the benefits of context-sensitive points-to analysis using a BDD-based implementation. TOSEM, 18:3:1--3:53, 2008.

Digital Library

[9]

A. Lienhard et al. Practical object-oriented back-in-time debugging. ECOOP '08, pp. 592--615, 2008.

Digital Library

[10]

A. Lienhard et al. Flow-centric, back-in-time debugging. TOOLS '09, pp. 272--288, 2009.

[11]

G. Pothier et al. Scalable omniscient debugging. OOSPLA '07, pp. 535--552, 2007.

Digital Library

[12]

G. Pothier and É. Tanter. Summarized trace indexing and querying for scalable back-in-time debugging. ECOOP '11, pp. 558--582. 2011.

Digital Library

[13]

K. Sakurai et al. Traceglasses: A trace-based debugger for realizing efficient navigation. IPSJ Transaction on Programming, 3(3):1--17, 2010.

[14]

M. Sridharan et al. Demand-driven points-to analysis for Java. OOPSLA '05, pp. 59--76, 2005.

Digital Library

[15]

G. Tibor et al. An efficient relevant slicing method for debugging. ESEC/FSE-7, pp. 303--321, 1999.

Digital Library

[16]

R. Vallée-Rai et al. Soot - a Java optimization framework. CASCON '99, pp. 125--135, 1999.

[17]

T. Wang and A. Roychoudhury. Dynamic slicing on Java bytecode traces. TOPLAS, 30:10:1--10:49, 2008.

Digital Library

[18]

M. D. Weiser. Program slicing. IEEE Transactions on Software Engineering, SE-10(4):352--357, 1984.

Digital Library

[19]

G. Xu et al. Scaling CFL-reachability-based points-to analysis using context-sensitive must-not-alias analysis. ECOOP '09, pp. 98--122, 2009.

Digital Library

[20]

X. Zhang et al. Towards locating execution omission errors. PLDI '07, pp. 415--424, 2007.

Digital Library

Cited By

Li XOrso A(2020)More Accurate Dynamic Slicing for Better Supporting Software Debugging2020 IEEE 13th International Conference on Software Testing, Validation and Verification (ICST)10.1109/ICST46399.2020.00014(28-38)Online publication date: Oct-2020
https://doi.org/10.1109/ICST46399.2020.00014
Lin YSun JTran LBai GWang HDong JHuchard MKästner CFraser G(2018)Break the dead end of dynamic slicing: localizing data and control omission bugProceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering10.1145/3238147.3238163(509-519)Online publication date: 3-Sep-2018
https://dl.acm.org/doi/10.1145/3238147.3238163

Index Terms

The omission finder for debugging what-should-have-happened bugs in object-oriented programs
1. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
      1. Process validation
        Traceability
      2. Software defect analysis
        Software testing and debugging

Recommendations

Dynamic Query-Based Debugging of Object-Oriented Programs

Program errors are hard to find because of the cause-effect gap between the instant when an error occurs and when the error becomes apparent to the programmer. Although debugging techniques such as conditional and data breakpoints help in finding errors ...
Who’s debugging the debuggers? exposing debug information bugs in optimized binaries
ASPLOS '21: Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems

Despite the advancements in software testing, bugs still plague deployed software and result in crashes in production. When debugging issues —sometimes caused by “heisenbugs”— there is the need to interpret core dumps and reproduce the issue offline on ...
Parameterized object sensitivity for points-to analysis for Java

The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference object field. We present object sensitivity, a new form of context sensitivity for flow-insensitive points-to analysis for Java. ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SAC '15: Proceedings of the 30th Annual ACM Symposium on Applied Computing

April 2015

2418 pages

ISBN:9781450331968

DOI:10.1145/2695664

Conference Chairs:
Roger L. Wainwright
University of Tulsa
,
Juan Manuel Corchado
University of Salamanca, Spain
,
Program Chairs:
Alessio Bechini
University of Pisa, Italy
,
Jiman Hong
Soongsil University, South Korea

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 April 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

JSPS KAKENHI

Conference

SAC 2015

Sponsor:

SIGAPP

SAC 2015: Symposium on Applied Computing

April 13 - 17, 2015

Salamanca, Spain

Acceptance Rates

SAC '15 Paper Acceptance Rate 291 of 1,211 submissions, 24%;

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
69
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Li XOrso A(2020)More Accurate Dynamic Slicing for Better Supporting Software Debugging2020 IEEE 13th International Conference on Software Testing, Validation and Verification (ICST)10.1109/ICST46399.2020.00014(28-38)Online publication date: Oct-2020
https://doi.org/10.1109/ICST46399.2020.00014
Lin YSun JTran LBai GWang HDong JHuchard MKästner CFraser G(2018)Break the dead end of dynamic slicing: localizing data and control omission bugProceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering10.1145/3238147.3238163(509-519)Online publication date: 3-Sep-2018
https://dl.acm.org/doi/10.1145/3238147.3238163

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten