Article

Free access

System-dependence-graph-based slicing of programs with arbitrary interprocedural control flow

Authors:

Saurabh Sinha,

Mary Jean Harrold,

Gregg RothermelAuthors Info & Claims

ICSE '99: Proceedings of the 21st international conference on Software engineering

Pages 432 - 441

https://doi.org/10.1145/302405.302675

Published: 16 May 1999 Publication History

PDF eReader

References

[1]

A. V. Aho, R. Sethi, and J. D. Ullman. Compilers, Prin., Techniques, and Tools. Addison-Wesley Publishing Company, Reading, MA, 1986.

Digital Library

Google Scholar

[2]

D. C. Atkinson and W. G. Griswold. The design of whole-program analysis tools. In Proc. of the 18th Int'l. Conf. on Softw. Eng., pages 16-27, Mar. 1996.

Digital Library

Google Scholar

[3]

T. Ball and S. Horwitz. Slicing programs with arbitrary control how. In Proc. of 1st Int'l Workshop on Automated and Algorithmic Debugging, volume 749 of Let. Notes in Computer Science, pages 206-222. Springer- Verlag, Nov. 1993.

Digital Library

Google Scholar

[4]

R.K. Chatterjee, B. G. Ryder, and W. A. Landi. Complexity of concrete type-inference in the presence of exceptions. In Proc. of Euro. Symp. on Prog., Apr. 1998.

Digital Library

Google Scholar

[5]

J. Ferrante, K. J. Ottenstein, and J. D. Warren. The program dependence graph and its use in optimization. ACM Trans. on Prog. Lang. and Sys., 9(3):319-349, July 1987.

Digital Library

Google Scholar

[6]

Programming Languages Research Group. PROLANGS Analysis Framework, 1998.

Google Scholar

[7]

D. Grove, G. DeFouw, J. Dean, and C. Chambers. Call graph construction in object-oriented languages. In PTOC. of Object-Oriented Prog. Sys., Lang. and Applications, pages 108-124, Oct. 1997.

Digital Library

Google Scholar

[8]

M. J. Harrold and Ning Ci. Reuse-driven interprocedural slicing. In PTOC. of the Int 'I Conf. on Softw. Eng., April 1998.

Digital Library

Google Scholar

[9]

M. J. Harrold and G. Rothermel. Aristotle: A system for research on and development of program-analysisbased tools. Technical Report OSU-CISRC-3/97-TR17, Mar. 1997.

Google Scholar

[10]

M. J. Harrold, G. Rothermel, and S. Sinha. Computation of interprocedural control dependence. In PTOC. of the ACM Int'l. Symp. on Softw. Testing and Analysis, March 1998.

Digital Library

Google Scholar

[11]

S. Horwitz, J. Prins, and T. Reps. Integrating noninterfering versions of programs. ACM Trans. on Prog. Lang. and Sys., 11(3):345-387, July 1989.

Digital Library

Google Scholar

[12]

S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM Trans. on Prog. Lang. and Sys., 12(1):26-60, Jan. 1990.

Digital Library

Google Scholar

[13]

W. Landi and B. G. Ryder. A safe approximate algorithm for interprocedural pointer aliasing. In PTOC. of SIGPLAN '92 Conf. on Prog. Lang. Design and Implem., pages 235-248, June 1992.

Digital Library

Google Scholar

[14]

W. Landi, B. G. Ryder, and S. Zhang. Interprocedural modification side effect analysis with pointer aliasing. In PTOC. of SIGPLAN'92 Conf. on Prog. Lang. Design and Implem., pages 56-67, June 1993.

Digital Library

Google Scholar

[15]

J G. C. Murphy, D. Notkin, W. G. Griswold, and E. S. Lan. An empirical study of static call graph extractors. ACM Trans. on Softw. Eng. and Meth., 7(2):158-191.

Digital Library

Google Scholar

[16]

G. Rothermel and M. J. Harrold. A safe, efficient regression test selection technique. ACM !Prans. on Softw. Eng.and Meth., 6(2):173-210, Apr. 1997.

Digital Library

Google Scholar

[17]

S. Sinha and M. J. Harrold. Analysis of programs that contain exception-handling constructs. In PTOC. of Int '1 Conf. on Softw. Maint., pages 348-357, Nov. 1998.

Digital Library

Google Scholar

[18]

S. Sinha, M. J. Harrold, and G. Rothermel. Systemdependence-graph-based slicing of programs with arbitrary interprocedural control flow. Technical Report OSU-CISRC-8/98, Aug. 1998.

Google Scholar

[19]

M. Weiser. Program slicing. IEEE Trans. on Softw. Eng., 10(4):352-357, July 1984.

Digital Library

Google Scholar

Cited By

View all

Wu RHe YHuang JWang CTang WShi QXiao XZhang CRoychoudhury APaiva AAbreu RStorey M(2024)LibAlchemy: A Two-Layer Persistent Summary Design for Taming Third-Party Libraries in Static Bug-Finding SystemsProceedings of the IEEE/ACM 46th International Conference on Software Engineering10.1145/3597503.3639132(1-13)Online publication date: 20-May-2024
https://dl.acm.org/doi/10.1145/3597503.3639132
Rong CWang JWang JZhou YZhang J(2024)Live Migration of Video Analytics Applications in Edge ComputingIEEE Transactions on Mobile Computing10.1109/TMC.2023.324653923:3(2078-2092)Online publication date: Mar-2024
https://doi.org/10.1109/TMC.2023.3246539
Cao SSun XBo LWu RLi BWu XTao CZhang TLiu W(2023)Learning to Detect Memory-related VulnerabilitiesACM Transactions on Software Engineering and Methodology10.1145/362474433:2(1-35)Online publication date: 23-Dec-2023
https://dl.acm.org/doi/10.1145/3624744
Show More Cited By

Index Terms

Recommendations

Interprocedural slicing using dependence graphs

The notion of a program slice, originally introduced by Mark Weiser, is useful in program debugging, automatic parallelization, and program integration. A slice of a program is taken with respect to a program point p and a variable x; the slice consists ...
Conditioned Slicing of Interprocedural Programs

Program slicing is a technique to decompose programs depending on control flow and data flow amongst several lines of code in a program. Conditioned slicing is a generalization of static slicing and dynamic slicing. A variable, the desired program point,...
Precise slicing of interprocedural concurrent programs

Program slicing is an effective technique for analyzing concurrent programs. However, when a conventional closure-based slicing algorithmfor sequential programs is applied to a concurrent interprocedural program, the slice is usually imprecise owing to ...

Comments

Information & Contributors

Information

Published In

ICSE '99: Proceedings of the 21st international conference on Software engineering

May 1999

741 pages

ISBN:1581130740

DOI:10.1145/302405

Chairmen:
Barry Boehm
Univ. of Southern Califoria, Los Angeles
,
David Garlan
Carnegie Mellon Univ., Pittsburgh, PA
,
Jeff Kramer
Imperial College, London, UK

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: 16 May 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

ICSE99

Sponsor:

SIGPLAN
SIGAda
SIGSOFT
IEEE-CS
IEEE-CS\TCSE

ICSE99: 1999 International Conference on Software Engineering

May 16 - 22, 1999

California, Los Angeles, USA

Acceptance Rates

Overall Acceptance Rate 276 of 1,856 submissions, 15%

Upcoming Conference

ICSE 2025

2025 IEEE/ACM 46th International Conference on Software Engineering

April 26 - May 3, 2025

Ottawa , ON , Canada

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

61
Total Citations
View Citations
840
Total Downloads

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

Reflects downloads up to 07 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wu RHe YHuang JWang CTang WShi QXiao XZhang CRoychoudhury APaiva AAbreu RStorey M(2024)LibAlchemy: A Two-Layer Persistent Summary Design for Taming Third-Party Libraries in Static Bug-Finding SystemsProceedings of the IEEE/ACM 46th International Conference on Software Engineering10.1145/3597503.3639132(1-13)Online publication date: 20-May-2024
https://dl.acm.org/doi/10.1145/3597503.3639132
Rong CWang JWang JZhou YZhang J(2024)Live Migration of Video Analytics Applications in Edge ComputingIEEE Transactions on Mobile Computing10.1109/TMC.2023.324653923:3(2078-2092)Online publication date: Mar-2024
https://doi.org/10.1109/TMC.2023.3246539
Cao SSun XBo LWu RLi BWu XTao CZhang TLiu W(2023)Learning to Detect Memory-related VulnerabilitiesACM Transactions on Software Engineering and Methodology10.1145/362474433:2(1-35)Online publication date: 23-Dec-2023
https://dl.acm.org/doi/10.1145/3624744
Rao LLiu SLiu A(2023)Testing Program Segments to Detect Runtime Exceptions in JavaStructured Object-Oriented Formal Language and Method10.1007/978-3-031-29476-1_8(93-105)Online publication date: 25-Mar-2023
https://doi.org/10.1007/978-3-031-29476-1_8
Galindo CPérez SSilva J(2021)Slicing Unconditional Jumps with Unnecessary Control DependenciesLogic-Based Program Synthesis and Transformation10.1007/978-3-030-68446-4_15(293-308)Online publication date: 13-Feb-2021
https://doi.org/10.1007/978-3-030-68446-4_15
Guo NLi XYin HGao Y(2020)VulHunter: An Automated Vulnerability Detection System Based on Deep Learning and BytecodeInformation and Communications Security10.1007/978-3-030-41579-2_12(199-218)Online publication date: 18-Feb-2020
https://doi.org/10.1007/978-3-030-41579-2_12
Zou DWang SXu SLi ZJin H(2019)μVulDeePecker: A Deep Learning-Based System for Multiclass Vulnerability DetectionIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2019.2942930(1-1)Online publication date: 2019
https://doi.org/10.1109/TDSC.2019.2942930
Horton EParnin CAtlee JBultan TWhittle J(2019)DockerizeMeProceedings of the 41st International Conference on Software Engineering10.1109/ICSE.2019.00047(328-338)Online publication date: 25-May-2019
https://dl.acm.org/doi/10.1109/ICSE.2019.00047
Epuri VSakala SAhn TSong M(2019)Tool support for managing repetitive program changes in evolving softwareIET Software10.1049/iet-sen.2018.535613:5(447-455)Online publication date: Oct-2019
https://doi.org/10.1049/iet-sen.2018.5356
Guo BKwon YSong M(2019)Decomposing Composite Changes for Code Review and Regression Test Selection in Evolving SoftwareJournal of Computer Science and Technology10.1007/s11390-019-1917-934:2(416-436)Online publication date: 22-Mar-2019
https://doi.org/10.1007/s11390-019-1917-9
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Index Terms

Recommendations

Interprocedural slicing using dependence graphs

Conditioned Slicing of Interprocedural Programs

Precise slicing of interprocedural concurrent programs