research-article

Memory slicing

Authors:

Xiangyu ZhangAuthors Info & Claims

ISSTA '09: Proceedings of the eighteenth international symposium on Software testing and analysis

Pages 165 - 176

https://doi.org/10.1145/1572272.1572292

Published: 19 July 2009 Publication History

Abstract

Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such as space requirement is decided by execution length; dependence graphs are highly redundant so that inspecting them is labor intensive. In this paper, we propose a data-centric dynamic slicing technique, in which dependences are introduced between memory locations. Doing so, the space complexity is bounded by memory footprint instead of execution length. Moreover, presenting dependences between memory locations is often more desirable for human inspection during debugging as redundant dependences are suppressed. Our evaluation shows that the proposed technique supersedes traditional dynamic slicing techniques in terms of effectiveness and efficiency.

References

[1]

H. Agrawal and J. R. Horgan. Dynamic Program Slicing. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI),246--256, 1990.

Digital Library

[2]

M. Berndl and O. Lhotak and F. Qian and L. Hendren and N. Umanee. Points-to Analysis using BDDs. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 103--114, 2003.

Digital Library

[3]

A. Beszedes, T. Gergely, Z. M. Szabo, J. C., and T. Gyimothy. Dynamic slicing method for maintenance of large c programs. In CSMR '01: Proceedings of the 5th European Conference on Software Maintenance and Reengineering, pages 105--113, Lisbon, Portugal, March 2001.

Digital Library

[4]

R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, 35(8), 677--691, 1986.

Digital Library

[5]

G. Z. Chrysos and J. S. Emer. Memory Dependence Prediction using Store Sets. In ISCA: Proceedings of the 25th Annual International Symposium on Computer Architecture, 142--153, 1998.

Digital Library

[6]

Diablo binary rewriting framework. http://www.elis.ugent.be/diablo/.

[7]

J. Ferrante, K. J. Ottenstein, and J. D. Warren. The program dependence graph and its use in optimization. In ACM Transactions on Programmming Languages and System (TOPLAS), 9(3):319--349, July 1987.

Digital Library

[8]

M. Gabel and Z. Su. Symbolic Mining of Temporal Specifications. In Proceeding of the International Conference on Software Engineering (ICSE), 51-60, 2008.

Digital Library

[9]

B. Korel and J. Laski. Dynamic program slicing, In Information Processing Letters, 29(3), 1988.

Digital Library

[10]

J. Lind-Nielsen. BuDDy, a binary decision diagram package. http://buddy.sourceforge.net.

[11]

S. Lu, Z. Li, F. Qin, L. Tan, P. Zhou, and Y. Zhou. Bugbench: a benchmark for evaluating bug detection tools. In Workshop on the Evaluation of Software Defect Detection Tools, Chicago, Illinois, 2005.

[12]

N. Nethercote and J. Seward. Valgrind: a framework for heavyweight dynamic binary instrumentation. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 89--100, 2007.

Digital Library

[13]

F. Qin and C. Wang and Z. Li and H. Kim and Y. Zhou and Y. Wu. LIFT: A Low-Overhead Practical Information Flow Tracking System for Detecting Security Attacks. In MICRO: Proceedings of the 38th International Symposium on Microarchitecture, 135--148, 2006.

Digital Library

[14]

F. Tip. A Survey of Program Slicing Techniques. In Journal of Program Languages, 121--189, 1995.

[15]

M. Vaziri and F. Tip and J. Dolby. Associating Synchronization Constraints with Data in An Object-Oriented Language. In Proceedings of the Symposium on Principles of Programming Languages ( POPL), 334--345, 2006.

Digital Library

[16]

T. Wang and A. Roychoudhury. Hierarchical Dynamic Slicing. In ISSTA: International Symposium on Software Testing and Analysis, 228--238, 2007.

Digital Library

[17]

T. Wang and A. Roychoudhury. Using Compressed Bytecode Traces for Slicing Java Programs. In Proceeding of the International Conference on Software Engineering (ICSE), 512--521, 2004.

Digital Library

[18]

M. Weiser. Program Slicing. In Proceeding of the International Conference on Software Engineering (ICSE), 439--449, San Diego, CA, 1981.

Digital Library

[19]

J. Whaley and D. Avots and M. Carbin and M. S. Lam. Using Datalog with Binary Decision Diagrams for Program Analysis. In Proceedings of Programming Languages and Systems: Third Asian Symposium, 2005.

Digital Library

[20]

B. Xin and X. Zhang. Efficient online detection of dynamic control dependence. In Proceedings of the ACM/SIGSOFT International Symposium on Software Testing and Analysis, pages 185--195. ACM, July 2007.

Digital Library

[21]

L. Yuan and J. Mai and Z. Su and H. Chen and C.-N. Chuah and P. Mohapatra. FIREMAN: A Toolkit for FIREwall Modeling and ANalysis. In IEEE Symposium on Security and Privacy, 199--213, 2006.

Digital Library

[22]

X. Zhang. Fault Localization via Precise Dynamic Slicing. Ph.D Dissertation, University of Arizona, 2006.

Digital Library

[23]

X. Zhang and R. Gupta and Y. Zhang. Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams. In Proceeding of the International Conference on Software Engineering (ICSE), 502--511, 2004.

Digital Library

Cited By

Mao XLei YDai ZQi YWang C(2014)Slice-based statistical fault localizationJournal of Systems and Software10.5555/2747476.274752689:C(51-62)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.5555/2747476.2747526
Wang YPatil HPereira CLueck GGupta RNeamtiu I(2014)DrDebugProceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization10.1145/2581122.2544152(98-108)Online publication date: 15-Feb-2014
https://dl.acm.org/doi/10.1145/2581122.2544152
Wang YPatil HPereira CLueck GGupta RNeamtiu I(2014)DrDebugProceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization10.1145/2544137.2544152(98-108)Online publication date: 15-Feb-2014
https://dl.acm.org/doi/10.1145/2544137.2544152
Show More Cited By

Index Terms

Memory slicing
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

Computation of Dynamic Program Slices for Unstructured Programs

A dynamic program slice is an executable part of the program whose behavior is identical, for the same program input, to that of the original program with respect to a variable(s) of interest at some execution position. The existing algorithms of ...
A study of effectiveness of dynamic slicing in locating real faults

Dynamic slicing algorithms have been considered to aid in debugging for many years. However, as far as we know, no detailed studies on evaluating the benefits of using dynamic slicing for locating real faults present in programs have been carried out. ...
Prioritized static slicing and its application to fault localization

We build a model PrioSlice that prioritizes statements in a static slice.Not all statements in a static slice are equally likely to propagate effects.Some data dependencies are more likely to occur than others.Control dependencies are less likely than ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ISSTA '09: Proceedings of the eighteenth international symposium on Software testing and analysis

July 2009

306 pages

ISBN:9781605583389

DOI:10.1145/1572272

General Chair:
Gregg Rothermel
University of Nebraska-Lincoln, USA
,
Program Chair:
Laura Dillon
Michigan State University, USA

Copyright © 2009 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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 July 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ISSTA '09

Sponsor:

ISSTA '09: International Symposium on Software Testing and Analysis

July 19 - 23, 2009

IL, Chicago, USA

Acceptance Rates

Overall Acceptance Rate 58 of 213 submissions, 27%

Upcoming Conference

ISSTA '25

Sponsor:
sigsoft

34th ACM SIGSOFT International Symposium on Software Testing and Analysis

June 25 - 28, 2025

Trondheim , Norway

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
329
Total Downloads

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

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Mao XLei YDai ZQi YWang C(2014)Slice-based statistical fault localizationJournal of Systems and Software10.5555/2747476.274752689:C(51-62)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.5555/2747476.2747526
Wang YPatil HPereira CLueck GGupta RNeamtiu I(2014)DrDebugProceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization10.1145/2581122.2544152(98-108)Online publication date: 15-Feb-2014
https://dl.acm.org/doi/10.1145/2581122.2544152
Wang YPatil HPereira CLueck GGupta RNeamtiu I(2014)DrDebugProceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization10.1145/2544137.2544152(98-108)Online publication date: 15-Feb-2014
https://dl.acm.org/doi/10.1145/2544137.2544152
Zhang PMao XLei YZhang Z(2014)Fault localization based on dynamic slicing via JSlice for Java programs2014 IEEE 5th International Conference on Software Engineering and Service Science10.1109/ICSESS.2014.6933631(565-568)Online publication date: Jun-2014
https://doi.org/10.1109/ICSESS.2014.6933631
Lei YMao XDai ZWang C(2012)Effective Statistical Fault Localization Using Program SlicesProceedings of the 2012 IEEE 36th Annual Computer Software and Applications Conference10.1109/COMPSAC.2012.9(1-10)Online publication date: 16-Jul-2012
https://dl.acm.org/doi/10.1109/COMPSAC.2012.9
El-Zawawy M(2012)Heap slicing using type systemsProceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III10.1007/978-3-642-31137-6_45(592-606)Online publication date: 18-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-31137-6_45
Park YReeves DCheung BHui LSandhu RWong D(2011)Deriving common malware behavior through graph clusteringProceedings of the 6th ACM Symposium on Information, Computer and Communications Security10.1145/1966913.1966986(497-502)Online publication date: 22-Mar-2011
https://dl.acm.org/doi/10.1145/1966913.1966986
Larson E(2010)SUDSAutomated Software Engineering10.1007/s10515-010-0067-717:3(301-346)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.1007/s10515-010-0067-7

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