Evaluating explicitly context-sensitive program slicing

ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering

Volumn , Issue , 2001, Pages 6-12

  Agrawal, G ^a   Guo, L ^a  

^a University of Delaware   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE SELECTION AND EVALUATION; CONTEXT SENSITIVE GRAMMARS; DATA FLOW ANALYSIS; DATA STRUCTURES; JAVA PROGRAMMING LANGUAGE; SOFTWARE ENGINEERING;

BYTE-CODE SEQUENCES; EXPLICITLY CONTEXT-SENSITIVE PROGRAM SLICING; JAVA VIRTUAL MACHINE; PROGRAM DEPENDENCE GRAPH;

PROGRAM DIAGNOSTICS;

EID: 0034826701     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/379605.379630     Document Type: Conference Paper

References (18)

1. Constrained-based type inference and parametric polymorphism
2. The design of whole-program analysis tools
3. Context-sensitive interprocedural points-to analysis in the presence of function pointers
4. Call graph construction in object-oriented languages
5. Reuse-driven interprocedural slicing
6. Efficient construction of program dependence graphs
7. Interprocedural slicing using dependence graphs
8. Finding program slices for recursive procedures
9. Pointer-induced aliasing: A problem taxonomy
10. Slicing object-oriented software
11. A precise interprocedural data flow algorithm
12. Speeding up slicing
13. Precise interprocedural dataflow analysis via graph reachability
14. Context-insensitive alias analysis reconsidered
15. System dependence graph based slicing of programs with arbitrary control flow
16. Soot: A Java ByteCode optimization framework
17. Optimizing Java bytecode using the soot framework: Is it feasible?
18. Program slicing