Article

Free access

Precise interprocedural chopping

Authors:

Thomas Reps,

Genevieve RosayAuthors Info & Claims

SIGSOFT '95: Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering

Pages 41 - 52

https://doi.org/10.1145/222124.222138

Published: 01 October 1995 Publication History

PDF eReader

References

[1]

Agrawal, H., "On slicing programs with jump statements," Proceedings of the ACM SIGPLAN 94 Conference on Programming Lunguage Design and Implementation, (Orlando, FL, June 22-24, 1994), ACM SIGPLAN Notices 29(6) pp. 302-312 (June 1994).

Digital Library

Google Scholar

[2]

Ball, T. and Horwitz, S., "Slicing programs with arbitrary control flow," pp. 206-222 in Proceedings of the First International Workshop on Automated and Algorithmic Debugging, (Linkoping, Sweden, May 1993). Lecture Notes in Computer Science, Vol. 749, Springer-Verlag, New York, NY (1993).

Digital Library

Google Scholar

[3]

Bannerjee, U., "Speedup of ordinary programs" Ph.D. dissertation and Tech. Rep, R-79-989, Dept. of Computer Science, University of Illinois, Urbana, IL (October 1979).

Digital Library

Google Scholar

[4]

Bates, S. and Horwitz, S., "Incremental program testing using program dependence graphs," pp. 384-396 in Conference Record of the Twentieth ACM Symposium on Principles of Programming languages, (Charleston, SC, January 10-13, 1993), ACM, New York, NY (1993).

Digital Library

Google Scholar

[5]

Binkley, D., "Using semantic differencing to reduce the cost of regression testing," Proceedings of the 1992 Conference on Software Maintenance (Orlando, Florida, November 9-12, 1992), pp. 41-50 (1992).

Google Scholar

[6]

Chase, D. R., Wegman, M., and Zadeck, F. K., "Analysis of pointers and structures:' Proceedings of the ACM SIGPLAN 90 Conference on Programming Language Design and Implementation, (White Plains, NY, June 20-22, 1990), ACM SIGPLAN Notices 25(6) pp. 296-310 (June 1990).

Digital Library

Google Scholar

[7]

Choi, J.-D. and Ferrante, J., "Static slicing in the presence of GOTO statements," ACM Trans. Program. Lung. Syst. 16(4) Pp. 1097-1113 (July 1994).

Digital Library

Google Scholar

[8]

Ferrante, J., Ottenstein, K., and Warren, J., "The program dependence graph and its use in optimization," ACM Trans. Program. Lang. Syst. 9(3) pp. 319-349 (July 1987).

Digital Library

Google Scholar

[9]

Gallagher, K.B. and Lyle, J.R., "Using program slicing in software maintenance," IEEE Transactions on Software Engineering 17(8) pp. 751-761 (August 199 1).

Digital Library

Google Scholar

[10]

Goff, G., Kennedy, K., and Tseng, C.-W., "Practical dependence testing," Proceedings of the ACM SIGPLAN 91 Conference on Programming Language Design and Implementation, (Toronto, Ontario, June 26-28, 199 1), ACM SIG- PLAN Notices 26(6) pp. 15-29 (June 1991).

Digital Library

Google Scholar

[11]

Horwitz, S., Pfeiffer, P., and Reps, T., "Dependence analysis for pointer variables," Proceedings of the ACM SIGPLAN 89 Conference on Programming Language Design and Implementation, (Portland, OR, June 21-23, 1989), ACM SIG- PLAN Notices 24(7) pp. 28-40 (July 1989).

Digital Library

Google Scholar

[12]

Horwitz, S., Prins, J., and Reps, T., "Integrating noninterfering versions of programs," ACM Trans. Program. Lang. Syst. 11(3) pp. 345-387 (July 1989).

Digital Library

Google Scholar

[13]

Horwitz, S., Reps, T., and Binkley, D., "InterProcedural slicing using dependence graphs," ACM Trans. Program. Lang. Syst. 12(1) pp. 26-60 (January 1990).

Digital Library

Google Scholar

[14]

Horwitz, S., "Identifying the semantic and textual differences between two versions of a program," Proceedings of the ACM SIGPLAN 90 Conference on Programming Language Design and Implementation, (White Plains, NY, June 20-22, 1990), ACM SIGPLAN Notices 25(6) pp. 234-245 (June 1990).

Digital Library

Google Scholar

[15]

Jackson, D. and Rollins, E.J., "A new model of program dependence for reverse engineering," SIGSOFT 94: Proceedings of the Second ACM SIGSOFT Symposium on the Foundations of Software Engineering, (New Orleans, LA, December 7-9, 1994), ACM SIGSOFT Software Engineering Notes 19 pp. 2-10 (December 1994).

Digital Library

Google Scholar

[16]

Kuck, D. J., Kuhn, R. H., Leasure, B., Padua, D. A., and Wolfe, M., "Dependence graphs and compiler optimization," pp. 207-218 in Conference Record of the Eighth ACM Symposium on Principles of Programming Languages, (Williamsburg, VA, January 26-28, 1981), ACM, New York, NY (1981).

Digital Library

Google Scholar

[17]

Landi, W. and Ryder, B. G., "Pointer-induced aliasing," A problem classification," pp. 93-103 in Conference Record of the Eighteenth ACM Symposium on Principles of Programming Languages, (Orlando, FL, January 1991), ACM, New York, NY (1991).

Digital Library

Google Scholar

[18]

Lams, J.R. and Hilfinger, P. N., "Detecting conflicts between structure accesses," Proceedings of the ACM SIGPLAN 88 Conference on Programming Language Design and Implementation, (Atlanta, GA, June 22-24, 1988), ACM SIGPLAN Notices 23(7) pp. 21-34 (July 1988).

Digital Library

Google Scholar

[19]

Lyle, J. and Weiser, M., "Experiments on slicingbased debugging tools," in Proceedings of the First Conference on Empirical Studies of Programming, (June 1986), Ablex Publishing Co. (1986).

Digital Library

Google Scholar

[20]

Markosian, L., Newcomb, P., Brand, R., Burson, S., and Kitzmiller, T., "Using an enabling technology," Commun. of the ACM 37(5) pp. 58-70 (May 1994).

Digital Library

Google Scholar

[21]

Maydan, D. E., Hennessy, J.L., and Lam, M. S., "Efficient and exact data dependence analysis," Proceedings of the ACM SIGPLAN 91 Conference on Programming Language Design and Implementation, (Toronto, Ontario, June 26-28, 199 1), ACM SIGPLAN Notices 26(6) pp. 1-14 (June 1991).

Digital Library

Google Scholar

[22]

Ning, J.Q., Engberts, A., and Kozaczynski, W., "Automated support for legacy code understanding," Commun. of the ACM 37(5) pp. 50-57 (May 1994).

Digital Library

Google Scholar

[23]

Ottenstein, K.J. and Ottenstein, L. M., "The program dependence graph in a software development environment," Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, (Pittsburgh, PA, Apr. 23-25, 1984), ACM SIGPLAN Notices 19(5) pp. 177-184 (May 1984).

Digital Library

Google Scholar

[24]

Pugh, W., "The omega test: a fast and practical integer programming algorithm for dependence analysis," in Supercomputing 1991, (November 1991).

Digital Library

Google Scholar

[25]

Pugh, W. and Wonnacott, D., 'Eliminating false data dependence using the omega test," Proceedings of the ACM SIG- PLAN 92 Conference on Programming Language Design and Implementation, (San Francisco, CA, June 17-19, 1992), ACM SIGPLAN Notices 27(7) pp. 140-151 (July 1992).

Digital Library

Google Scholar

[26]

Reps, T., "Demonstration of a prototype tool for program integration," TR-8 19, Computer Sciences Department, University of Wisconsin, Madison, WI (January 1989).

Google Scholar

[27]

Reps, T., Sagiv, M., and Horwitz, S., "Interprocedural dataflow analysis via graph reachability," TR 94-14, Datalogisk Institut, University of Copenhagen, Copenhagen, Denmark (April 1994). (Available on the World Wide Web at ftp://ftp.diku. dk/diku/semantics/papers/D-2 15.ps.Z.)

Google Scholar

[28]

Reps, T., Horwitz, S., Sagiv, M., and Resay, G., "Speeding up slicing," SIGSOFT 94: Proceedings of the Second ACM SIGSOFT Symposium on the Foundations of Software Engineering, (New Orleans, LA, December 7-9, 1994), ACM SIGSOFT Software Engineering Notes 19(5) pp. 11-20 (December 1994).

Digital Library

Google Scholar

[29]

Reps, T., Horwitz, S., and Sagiv, M., "Precise interprocedural dataflow analysis via graph reachability," pp. 49-61 in Conference Record of the Twenty-Second ACM Symposium on Principles of Programming Lunguages, (San Francisco, CA, Jan. 23-25, 1995), ACM, New York, NY (1995).

Digital Library

Google Scholar

[30]

Sharir, M. and Pnueli, A., "Two approaches to interprocedural data flow analysis,' pp. 189-233 in Program Flow Analysis: Theory and Applications, ed. S.S. Muchnick and N.D. Jones,Prentice-Hall, Englewood Cliffs, NJ (1981).

Google Scholar

[31]

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

Digital Library

Google Scholar

[32]

Wolfe, M. J., "Optimizing supercompilers for supercomputers," Ph.D. dissertation and Tech. Rep. R-82-1105, Dept. of Computer Science, University of Illinois, Urbana, IL (October 1982).

Digital Library

Google Scholar

Cited By

View all

Cheng XRen JSui Y(2024)Fast Graph Simplification for Path-Sensitive Typestate Analysis through Tempo-Spatial Multi-Point SlicingProceedings of the ACM on Software Engineering10.1145/36437491:FSE(494-516)Online publication date: 12-Jul-2024
https://dl.acm.org/doi/10.1145/3643749
Wu BLiu SXiao YLi ZSun JLin SChandra SBlincoe KTonella P(2023)Learning Program Semantics for Vulnerability Detection via Vulnerability-Specific Inter-procedural SlicingProceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering10.1145/3611643.3616351(1371-1383)Online publication date: 30-Nov-2023
https://dl.acm.org/doi/10.1145/3611643.3616351
Pauck FWehrheim H(2021)Jicer: Simplifying Cooperative Android App Analysis Tasks2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)10.1109/SCAM52516.2021.00031(187-197)Online publication date: Sep-2021
https://doi.org/10.1109/SCAM52516.2021.00031
Show More Cited By

Index Terms

Precise interprocedural chopping

Recommendations

Precise interprocedural chopping
Precise executable interprocedural slices

The notion of a program slice, originally introduced by Mark Weiser, is useful in program debugging, automatic parallelization, program integration, and software maintenance. A slice of a program is taken with respect to a program point p and a variable ...
Interprocedural pointer alias analysis

We present practical approximation methods for computing and representing interprocedural aliases for a program written in a language that includes pointers, reference parameters, and recursion. We present the following contributions: (1) a framework ...

Comments

Information & Contributors

Information

Published In

SIGSOFT '95: Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering

October 1995

180 pages

ISBN:0897917162

DOI:10.1145/222124

Editor:
Gail E. Kaiser
Columbia Univ., New York, NY

ACM SIGSOFT Software Engineering Notes Volume 20, Issue 4
Oct. 1995
171 pages
ISSN:0163-5948
DOI:10.1145/222132
Editor:
Gail E. Kaiser
Columbia Univ., New York, NY
Issue’s Table of Contents

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: 01 October 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SOFT95

Sponsor:

SIGSOFT

SOFT95: Foundations of Software Engineering

October 12 - 15, 1995

D.C., Washington, USA

Acceptance Rates

Overall Acceptance Rate 17 of 128 submissions, 13%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

89
Total Citations
View Citations
728
Total Downloads

Downloads (Last 12 months)115
Downloads (Last 6 weeks)30

Reflects downloads up to 16 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cheng XRen JSui Y(2024)Fast Graph Simplification for Path-Sensitive Typestate Analysis through Tempo-Spatial Multi-Point SlicingProceedings of the ACM on Software Engineering10.1145/36437491:FSE(494-516)Online publication date: 12-Jul-2024
https://dl.acm.org/doi/10.1145/3643749
Wu BLiu SXiao YLi ZSun JLin SChandra SBlincoe KTonella P(2023)Learning Program Semantics for Vulnerability Detection via Vulnerability-Specific Inter-procedural SlicingProceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering10.1145/3611643.3616351(1371-1383)Online publication date: 30-Nov-2023
https://dl.acm.org/doi/10.1145/3611643.3616351
Pauck FWehrheim H(2021)Jicer: Simplifying Cooperative Android App Analysis Tasks2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)10.1109/SCAM52516.2021.00031(187-197)Online publication date: Sep-2021
https://doi.org/10.1109/SCAM52516.2021.00031
Zhang KZhuo DKrishnamurthy A(2020)GalliumProceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication10.1145/3387514.3405869(283-295)Online publication date: 30-Jul-2020
https://dl.acm.org/doi/10.1145/3387514.3405869
Loch FJohns MHecker MMohr MSnelting GHung CCerny TShin DBechini A(2020)Hybrid taint analysis for Java EEProceedings of the 35th Annual ACM Symposium on Applied Computing10.1145/3341105.3373887(1716-1725)Online publication date: 30-Mar-2020
https://dl.acm.org/doi/10.1145/3341105.3373887
Li HHu HGu GAhn GZhang FLie DMannan MBackes MWang X(2018)vNIDSProceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security10.1145/3243734.3243862(17-34)Online publication date: 15-Oct-2018
https://dl.acm.org/doi/10.1145/3243734.3243862
Khalid JGember-Jacobson AMichael RAbhashkumar AAkella AArgyraki KIsaacs R(2016)Paving the way for NFVProceedings of the 13th Usenix Conference on Networked Systems Design and Implementation10.5555/2930611.2930628(239-253)Online publication date: 16-Mar-2016
https://dl.acm.org/doi/10.5555/2930611.2930628
Jin XHuang PXu TZhou YCadar CPietzuch PKeeton KRodrigues R(2016)NCheckerProceedings of the Eleventh European Conference on Computer Systems10.1145/2901318.2901353(1-16)Online publication date: 18-Apr-2016
https://dl.acm.org/doi/10.1145/2901318.2901353
Johnson AWaye LMoore SChong S(2015)Exploring and enforcing security guarantees via program dependence graphsACM SIGPLAN Notices10.1145/2813885.273795750:6(291-302)Online publication date: 3-Jun-2015
https://dl.acm.org/doi/10.1145/2813885.2737957
Johnson AWaye LMoore SChong SGrove DBlackburn S(2015)Exploring and enforcing security guarantees via program dependence graphsProceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/2737924.2737957(291-302)Online publication date: 3-Jun-2015
https://dl.acm.org/doi/10.1145/2737924.2737957
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

Precise interprocedural chopping

Precise executable interprocedural slices

Interprocedural pointer alias analysis