article Precise interprocedural chopping Share on Authors: Thomas Reps Computer Sciences Department, Univ. of Wisconsin, 1210 W. Dayton St., Madison, WI Computer Sciences Department, Univ. of Wisconsin, 1210 W. Dayton St., Madison, WIView Profile , Genevieve Rosay Computer Sciences Department, Univ. of Wisconsin, 1210 W. Dayton St., Madison, WI Computer Sciences Department, Univ. of Wisconsin, 1210 W. Dayton St., Madison, WIView Profile Authors Info & Claims ACM SIGSOFT Software Engineering NotesVolume 20Issue 4Oct. 1995 pp 41–52https://doi.org/10.1145/222132.222138Online:01 October 1995Publication History 84citation549DownloadsMetricsTotal Citations84Total Downloads549Last 12 Months6Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program representation called the system dependence graph. This paper defines a new algorithm for slicing with system dependence graphs that is asymptotically faster than the previous one. A preliminary experimental study indicates that the new algorithm is also significantly faster in practice, providing roughly a 6-fold speedup on examples of 348 to 757 lines.