声明
摘要
Abstract
TABLE OF CONTENTS
Chapter 1 Introduction
1.1 Overview
1.2 Call Graph
1.3 Algorithms for Generating Call Graphs
1.3.1 Reaehability Analysis(RA)
1.3.2 Class Hierarchy Analysis(CHA)
1.3.3 Rapid Type Analysis(RTA)
1.3.4 Class Type Analysis(CTA)
1.4 Motivation
1.5 Contribution of Dissertation
1.6 Related Work
1.7 Dissertation Organization
Chapter 2 PROBLEM DEFINITIONS
2.1 Overview
2.2 An Approach Overview
2.3 Implementation on existing algorithms
2.3.1 Class Hierarchy Analysis(CHA)
2.3.2 Rapid Type Analysis(RTA)
2.3.3 Class Type Analysis(CTA)
Chapter 3 DESIGN
3.1 Overview
3.2 Goals of the Approach
3.3 An Approach
3.4 Interface Requirements
3.5 Experiments Design
3.5.1 Tested Programs
3.5.2 Approach Testing
Chapter 4 IMPLEMENTATIONS
4.1 Overview
4.2 The Soot Framework
4.3 The ASM Framework
4.4 Results
4.4.1 Call Graph Nodes
4.4.2 Call Graph Edges
4.4.3 Consumed Time
4.4.4 Consumed Memory
Chapter 5 PROOF OF CONCEPT
5.1 Experimental Setup
5.2 Characteristic of Call Graphs
5.3 Result Summary
Chapter 6 CONCLUSION AND FUTURE WORKS
6.1 Conclusion
6.2 Future Works
Acknowledgments
References
My Publications
Appendix
南京理工大学;