Precise static type analysis in component based programming environment

ABSTRACT

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

REFERENCES

• 1: R. Chatterjee and B. Ryder. Data-flow-based testing of object-oriented libraries. Department of Computer Science, Rutgers University. DCS-TR-433, April 2001.
• 2: Manuvir Das, Unification-based pointer analysis with directional assignments, Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, p.35-46, June 18-21, 2000, Vancouver, British Columbia, Canada
• 3: Cormac Flanagan , Matthias Felleisen, Componential set-based analysis, ACM Transactions on Programming Languages and Systems (TOPLAS), v.21 n.2, p.370-416, March 1999 [doi>10.1145/316686.316703]
• 4: F. J. A. for (Linux) PDAs and M. C. P. http://tuxmobil.org/.
• 5: David Paul Grove , Craig Chambers, Effective interprocedural optimization of object-oriented languages, University of Washington, 1998
• 6: Mary Jean Harrold , Gregg Rothermel, Separate computation of alias information for reuse, Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis, p.107-120, January 08-10, 1996, San Diego, California, United States
• 7: Nevin Heintze , Olivier Tardieu, 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, p.254-263, June 2001, Snowbird, Utah, United States
• 8: Rajeev Kumar , Soham S. Chakraborty, Precise static type analysis for object oriented programs, ACM SIGPLAN Notices, v.42 n.2, p.17-26, February 2007 [doi>10.1145/1241761.1241763]
• 9: Atanas Rountev , Barbara G. Ryder , William Landi, Data-flow analysis of program fragments, Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering, p.235-252, September 06-10, 1999, Toulouse, France
• 10: O. source code repository : http://sourceforge.net/.
• 11: Frank Tip , Jens Palsberg, Scalable propagation-based call graph construction algorithms, Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, p.281-293, October 2000, Minneapolis, Minnesota, United States

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.4 Processors
          Subjects: Code generation

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.4 Processors
          Subjects: Optimization; Compilers

General Terms:
Algorithms, Design, Experimentation

Keywords:
code component, dynamic dispatch, static type analysis