Scalable propagation-based methods for call graph construction

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C717S133000

Reexamination Certificate

active

07003507

ABSTRACT:
A program storage device, readably by a machine, tangibly embodying instructions to perform method steps for constructing a call graph whereby for each method M, a set of types SMof objects that may occur in method M is determined for each field F, a set of types SFof objects is determined that may be stored in field F, the method comprising: determining the allocation sites inside the body of method M; determining the set of directly called methods M′ inside the body of method M; and determining the set of virtually called methods M″ inside the body of method M.

REFERENCES:
patent: 5428793 (1995-06-01), Odnert et al.
patent: 5671419 (1997-09-01), Carini et al.
patent: 5933640 (1999-08-01), Dion
patent: 5963740 (1999-10-01), Srivastava et al.
patent: 6041179 (2000-03-01), Bacon et al.
patent: 6240500 (2001-05-01), Scales
patent: 6282707 (2001-08-01), Isozaki
patent: 6546551 (2003-04-01), Sweeney et al.
patent: 6654951 (2003-11-01), Bacon et al.
patent: 6665865 (2003-12-01), Ruf
patent: 2002/0010911 (2002-01-01), Cheng et al.
patent: 2003/0172135 (2003-09-01), Bobick et al.
Shivers, O.Control-Flow Analysis of Higher-Order Languages. PhDthesis, CMU,May, 1991. CMU-CS-91-145.
Bacon, D.F., and Sweeney, P.F. Fast static analysis of C++ virtual function calls. InProceedings of the Eleventh Annual Conference on Object-Oriented Programming Systems, Languages, and Applications(OOPSLA'96) (San Jose, CA, 1996), pp. 324-341.SIGPLAN Notices31(10).
Bacon, D.F.Fast and Effective Optimization of Statically Typed Object-Oriented Languages. PhD thesis, Computer Science Division, University of California, Berkeley, Dec. 1997. Report No. UCB/CSD-98-1017.
Dean, J., Grove, D., and Chambers, C. Optimization of object-oriented programs using static class hierarchy analysis. InProceedings of the Ninth European Conference on Object-Oriented Programming(ECOOP'95) (Aarhus, Denmark, Aug. 1995), W. Olthoff, Ed., Springer-Verlag, pp. 77-101.
Palsberg, J., and Schwartzbach, M.Object-Oriented Type Systems, John Wiley & Sons, 1993.
Tip, Frank and Palsberg, Jens, “Scalable Propagation-Based Cell Graph Construction Algorithms,” InProceedings of the Fifteenth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications(OOPSLA'00), Minneapolis, MN, Oct. 15-19, 2000, pp. 281-293. Appeared in ACM SIGPLAN Notices 35(10).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Scalable propagation-based methods for call graph construction does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Scalable propagation-based methods for call graph construction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scalable propagation-based methods for call graph construction will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3678370

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.