An Evaluation of Slicing Algorithms for Concurrent Programs

Authors:
Dennis Giffhorn;Christian Hammer
Affiliations:
Universitat Passau, Germany;Universitat Passau, Germany
Venue:
SCAM '07 Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation
Year:
2007

Citing 0
Cited 4

Static path conditions for Java

Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security
Precise slicing of concurrent programs

Automated Software Engineering
A vocabulary of program slicing-based techniques

ACM Computing Surveys (CSUR)
Impact analysis for distributed event-based systems

Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Program slicing is a program-reduction technique for extracting statements that may influence other statements. While there exist efficient algorithms to slice sequential programs precisely, there are only two algorithms for precise slicing of concurrent interprocedural programs with recursive procedures. We implemented both algorithms for Java, applied several new optimizations and examined their precision and runtime behavior. We compared these results with two further algorithms which trade precision for speed. We show that one algorithm may produce incorrect slices and that precise slicing of concurrent programs is very expensive in terms of computation time.