Speeding up slicing

Authors:
Thomas Reps;Susan Horwitz;Mooly Sagiv;Genevieve Rosay
Affiliations:
Computer Sciences Department, Univ. of Wisconsin, 1210 West Dayton Street, Madison, WI and Datalogisk Institut, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen East, Denmark;Computer Sciences Department, Univ. of Wisconsin, 1210 West Dayton Street, Madison, WI and Datalogisk Institut, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen East, Denmark;Computer Sciences Department, Univ. of Wisconsin, 1210 West Dayton Street, Madison, WI and Datalogisk Institut, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen East, Denmark and ...;Computer Sciences Department, Univ. of Wisconsin, 1210 West Dayton Street, Madison, WI
Venue:
SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
Year:
1994

Citing 23
Cited 55

Detecting conflicts between structure accesses

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Integrating noninterfering versions of programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Dependence analysis for pointer variables

PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Interprocedural slicing using dependence graphs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Identifying the semantic and textual differences between two versions of a program

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Analysis of pointers and structures

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Pointer-induced aliasing: a problem classification

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient and exact data dependence analysis

PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Practical dependence testing

PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
The Omega test: a fast and practical integer programming algorithm for dependence analysis

Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Using Program Slicing in Software Maintenance

IEEE Transactions on Software Engineering
Eliminating false data dependences using the Omega test

PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Multi-procedure program integration

Multi-procedure program integration
Constructing call multigraphs using dependence graphs

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Incremental program testing using program dependence graphs

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On slicing programs with jump statements

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Static slicing in the presence of goto statements

ACM Transactions on Programming Languages and Systems (TOPLAS)
Software Tools in Pascal

Software Tools in Pascal
Slicing Programs with Arbitrary Control-flow

AADEBUG '93 Proceedings of the First International Workshop on Automated and Algorithmic Debugging
Interprocedural Constant Propagation using Dependence Graphs and a Data-Flow Model

CC '94 Proceedings of the 5th International Conference on Compiler Construction
The program dependence graph in a software development environment

SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Speedup of ordinary programs

Speedup of ordinary programs
Optimizing supercompilers for supercomputers

Optimizing supercompilers for supercomputers

Precise interprocedural dataflow analysis via graph reachability

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Precise interprocedural chopping

SIGSOFT '95 Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering
Slicing object-oriented software

Proceedings of the 18th international conference on Software engineering
Slicing class hierarchies in C++

Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Interconvertbility of set constraints and context-free language reachability

PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
The use of program profiling for software maintenance with applications to the year 2000 problem

ESEC '97/FSE-5 Proceedings of the 6th European SOFTWARE ENGINEERING conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering
Computing amorphous program slices using dependence graphs

Proceedings of the 1999 ACM symposium on Applied computing
SUIF Explorer: an interactive and interprocedural parallelizer

Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming
Identifying procedural structure in Cobol programs

Proceedings of the 1999 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Slicing spreadsheets: an integrated methodology for spreadsheet testing and debugging

Proceedings of the 2nd conference on Domain-specific languages
Compiling object-oriented data intensive applications

Proceedings of the 14th international conference on Supercomputing
Undecidability of context-sensitive data-dependence analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Evaluating explicitly context-sensitive program slicing

PASTE '01 Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Efficient path conditions in dependence graphs

Proceedings of the 24th International Conference on Software Engineering
Data parallel language and compiler support for data intensive applications

Parallel Computing - Parallel data-intensive algorithms and applications
A Flexible Framework for Dynamic and Static Slicing of Logic Programs

PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
Model Checking of Unrestricted Hierarchical State Machines

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Program Slicing of Hardware Description Languages

CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Slicing java programs that throw and catch exceptions

Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Static Slicing of Concurrent Object-Oriented Programs

COMPSAC '96 Proceedings of the 20th Conference on Computer Software and Applications
Design and Implementation of a Fine-Grained Software Inspection Tool

IEEE Transactions on Software Engineering
Path Dependent Analysis of Logic Programs

Higher-Order and Symbolic Computation
Buffer overrun detection using linear programming and static analysis

Proceedings of the 10th ACM conference on Computer and communications security
Interprocedural slicing using dependence graphs

ACM SIGPLAN Notices - Best of PLDI 1979-1999
An improved slicer for Java

Proceedings of the 5th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Slicing, Chopping, and Path Conditions with Barriers

Software Quality Control
Classifying data dependences in the presence of pointers for program comprehension, testing, and debugging

ACM Transactions on Software Engineering and Methodology (TOSEM)
Analysis and Visualization of Predicate Dependence on Formal Parameters and Global Variables

IEEE Transactions on Software Engineering
A brief survey of program slicing

ACM SIGSOFT Software Engineering Notes
The Efficiency of Critical Slicing in Fault Localization

Software Quality Control
Using Dynamic Information in the Interprocedural Static Slicing of Binary Executables

Software Quality Control
Analysis of recursive state machines

ACM Transactions on Programming Languages and Systems (TOPLAS)
Demand-driven points-to analysis for Java

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Refinement-based context-sensitive points-to analysis for Java

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
A formalisation of the relationship between forms of program slicing

Science of Computer Programming - Special issue on source code analysis and manipulation (SCAM 2005)
Effects of context on program slicing

Journal of Systems and Software - Special issue: Selected papers from the 4th source code analysis and manipulation (SCAM 2004) workshop
Efficient path conditions in dependence graphs for software safety analysis

ACM Transactions on Software Engineering and Methodology (TOSEM)
Interprocedural slicing of multithreaded programs with applications to Java

ACM Transactions on Programming Languages and Systems (TOPLAS)
An empirical study of static program slice size

ACM Transactions on Software Engineering and Methodology (TOSEM)
On bytecode slicing and aspectJ interferences

Proceedings of the 6th workshop on Foundations of aspect-oriented languages
Comparison of two activity analyses for automatic differentiation: context-sensitive flow-insensitive vs. context-insensitive flow-sensitive

Proceedings of the 2007 ACM symposium on Applied computing
Thin slicing

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Slicing spreadsheets: an integrated methodology for spreadsheet testing and debugging

DSL'99 Proceedings of the 2nd conference on Conference on Domain-Specific Languages - Volume 2
Empirical study of optimization techniques for massive slicing

ACM Transactions on Programming Languages and Systems (TOPLAS)
Impact analysis of database schema changes

Proceedings of the 30th international conference on Software engineering
Customization change impact analysis for erp professionals via program slicing

ISSTA '08 Proceedings of the 2008 international symposium on Software testing and analysis
Conditioned semantic slicing for abstraction; industrial experiment

Software—Practice & Experience
Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis

Genoa Proceedings of the 23rd European Conference on ECOOP 2009 --- Object-Oriented Programming
Detecting inefficiently-used containers to avoid bloat

PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Field-sensitive program dependence analysis

Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineering
Practical change impact analysis based on static program slicing for industrial software systems

Proceedings of the 33rd International Conference on Software Engineering
Demand-driven context-sensitive alias analysis for Java

Proceedings of the 2011 International Symposium on Software Testing and Analysis
Static detection of unsafe component loadings

CC'12 Proceedings of the 21st international conference on Compiler Construction
Fast algorithms for Dyck-CFL-reachability with applications to alias analysis

Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Mantis: automatic performance prediction for smartphone applications

USENIX ATC'13 Proceedings of the 2013 USENIX conference on Annual Technical Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.