Separate computation of alias information for reuse
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Componential set-based analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Data-flow analysis of program fragments
ESEC/FSE-7 Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering
Unification-based pointer analysis with directional assignments
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Scalable propagation-based call graph construction algorithms
OOPSLA '00 Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Ultra-fast aliasing analysis using CLA: a million lines of C code in a second
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Effective interprocedural optimization of object-oriented languages
Effective interprocedural optimization of object-oriented languages
Precise static type analysis for object oriented programs
ACM SIGPLAN Notices
| Hi-index | 0.01 |
Type analysis is one of the important aspects of object oriented and component based program compilation and development. With the emerging flexible computational environments, component technology is becoming the de-facto technology. In this paper, we present a precise and cost effective type analysis technique for component based systems where the whole code is inaccessible. The analysis uses metadata based summary information. We experimented the proposed technique with some application components. The proposed approach is shown to improve upon the existing class hierarchy based analysis