Complexity of points-to analysis of Java in the presence of exceptions

IEEE Transactions on Software Engineering

Volumn 27, Issue 6, 2001, Pages 481-512

  Chatterjee, Ramkrishna ^a   Ryder, Barbara G ^b   Landi, William A ^c  

^a ORACLE CORPORATION   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c SIEMENS CORPORATE RESEARCH   (United States)

Author keywords

Complexity; Exceptions; Java; Points to analysis

Indexed keywords

POLYNOMIAL-TIME ALGORITHMS;

ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; JAVA PROGRAMMING LANGUAGE; POLYNOMIALS; SEMANTICS;

OBJECT ORIENTED PROGRAMMING;

EID: 0035362869     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.926173     Document Type: Article

References (76)

1. The design of whole-program analysis tools
2. Effective whole-program analysis in the presence of pointers
3. The cartesian product algorithm: Simple and precise type inference of parametric polymorphism
4. A practical interprocedural data flow analysis algorithm
5. Flow-insensitive interprocedural alias analysis in the presence of pointers
6. Incremental program testing using dependence graphs
7. Fast static analysis of C++ virtual function calls
8. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects
9. Flow-sensitive type analysis for C++
10. Retargetable high-level alias analysis
11. Complexity of concrete type-inference in the presence of exceptions
12. Relevant context inference
13. Fast interprocedural class analysis
14. Simple and effective analysis of statically-typed object-oriented programs
15. Context-sensitive interprocedural points-to analysis in the presence of function pointers
16. Further empirical studies of test effectiveness
17. An experimental comparison of the effectiveness of branch testing with data-flow testing
18. Call graph constrction in object-oriented languages
19. Putting pointer analysis to work
20. The complexity of type analysis of object oriented programs
21. Using program slices in software maintenance
22. Hybrid slicing: An approach for refining static slices using dynamic information
23. A technique for analyzing pointer and structure references in parallel restructuring compilers
24. Parcel and Miprac: Parallelizers for symbolic and numeric programs
25. Reuse-driven interprocedural slicing
26. Experiments on the effectiveness of dataflow- and controlflow-based test adequacy criteria
27. Assessing the effects of flow sensitivity on pointer alias analysis
28. Interprocedural slicing using dependence graphs
29. Selecting and using data for integration testing
30. Efficient computation of interprocedural definition-use chains
31. Global data flow analysis and iterative algorithms
32. Undecidability of static analysis
33. Slicing object-oriented software
34. Pointer-induced aliasing: A problem classification
35. A safe approximation algorithm for interprocedural pointer aliasing
36. Interprocedural modification side effect analysis with pointer aliasing
37. Pointer-induced aliasing: A clarification
38. The program dependence graph in a software development environment
39. Data-flow testing with pointers and function calls
40. Precise concrete type inference for object oriented languages
41. Interprocedural def-use associations for C systems with single level pointers
42. Data-flow-based virtual function resolution
43. Object-oriented type inference
44. Precise interprocedural dataflow analysis via graph reachability
45. Lifetime analysis of dynamically allocated objects
46. Analyzing exception flow in Java programs
47. Precise interprocedural chopping
48. Context-insensitive alias analysis reconsidered
49. A logic-based approach to data flow analysis
50. The effects of the precision of pointer analysis
51. Fast and accurate flow-insensitive points-to analysis
52. Analysis of programs that contain exception-handling constructs
53. System-dependence-graph-based slicing of programs with arbitrary interprocedural control flow
54. Two approaches to interprocedural data flow analysis
55. Points-to analysis in almost linear time
56. Points-to analysis in almost linear time
57. Inferring types in smalltalk
58. Flow-insensitive C++ pointers and polymorphism analysis and its application to slicing
59. Slicing class hierarchies in C++
60. A survey of program slicing technques
61. The semantic approach to program slicing
62. Program slicing
63. More experience with data flow testing
64. Efficient context-sensitive pointer analysis for C programs
65. Program decomposition for pointer aliasing: A step towards practical analyses
66. Experiments with combined analysis for pointer aliasing