Article

Precise dynamic slicing using execution-summary

Authors:

Avik Paul,

Rajeev KumarAuthors Info & Claims

SAC '07: Proceedings of the 2007 ACM symposium on Applied computing

Pages 1330 - 1331

https://doi.org/10.1145/1244002.1244288

Published: 11 March 2007 Publication History

Get Access

Abstract

Dynamic slicing helps to identify the program statements that affect a given criterion-point. Existing precise slicing algorithms, like the Limited-Preprocessing (LP) algorithm by Zhang et al. (ICSE 2003), operate on stored execution trace, requires much time and space if the trace is large even if the source program is small. In this paper we present a forward dynamic slicing algorithm for structured programs that reduces the overhead of slicing in the long run. For long running programs that iterates heavily on some loop, our algorithm is expected to perform faster by re-using the already computed dependences in the loop.

References

[1]

Xiangyu Zhang, Rajiv Gupta, Youtao Zhang. Precise Dynamic Slicing Algorithms. In Proc. ICSE, pages 291--301, 2003.

Digital Library

Google Scholar

[2]

H. Agarwal, J. Horgan. Dynamic Program Slicing. In Proc. PLDI, pages 246--256, 1990.

Digital Library

Google Scholar

Index Terms

Precise dynamic slicing using execution-summary
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

An efficient interprocedural dynamic slicing method

We present an efficient interprocedural dynamic slicing algorithm for structured programs. We first propose an intraprocedural dynamic slicing algorithm, and subsequently extend it to handle interprocedural calls. Our intraprocedural dynamic slicing ...
Dynamic slicing of distributed Aspect-Oriented Programs

This paper presents a dynamic parallel context-sensitive slicing algorithm for distributed AOPs. The context-sensitivity makes the computed slice more precise and accurate. We introduce parallelism in our algorithm to make slice computation faster. We ...
Theoretical foundations of dynamic program slicing

This paper presents a theory of dynamic slicing, which reveals that the relationship between static and dynamic slicing is more subtle than previously thought. The definitions of dynamic slicing are formulated in terms of the projection theory of ...

Comments

Information & Contributors

Information

Published In

SAC '07: Proceedings of the 2007 ACM symposium on Applied computing

March 2007

1688 pages

ISBN:1595934804

DOI:10.1145/1244002

Conference Chairs:
Yookun Cho
Seoul National University, Seoul, Korea
,
Roger L. Wainwright
University of Tulsa, Tulsa, Oklahoma
,
Hisham M. Haddad
Kennesaw State University, Kennesaw, Georgia
,
Sung Y. Shin
South Dakota State University, Brookings, South Dakota
,
Program Chair:
Yong Wan Koo
The University of Suwon, Gyeongggi-do, Korea

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 March 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SAC07

Sponsor:

SIGAPP

SAC07: The 2007 ACM Symposium on Applied Computing

March 11 - 15, 2007

Seoul, Korea

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
152
Total Downloads

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

Reflects downloads up to 02 Mar 2025

Other Metrics

View Author Metrics

Citations

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.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Index Terms

Recommendations

An efficient interprocedural dynamic slicing method

Dynamic slicing of distributed Aspect-Oriented Programs

Theoretical foundations of dynamic program slicing

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations