Data processing: software development – installation – and managem – Software program development tool – Translation of code
Reexamination Certificate
2007-01-16
2007-01-16
Chaki, Kakali (Department: 2193)
Data processing: software development, installation, and managem
Software program development tool
Translation of code
C717S151000, C717S154000, C717S152000, C717S156000, C717S157000
Reexamination Certificate
active
09844345
ABSTRACT:
The present invention is a method and system to reduce storage in a inter-procedural analysis solver. In one embodiment, local graphs are pruned. The local graphs represent local problems, which correspond to separately compilable components in a software program. Each of the local graphs has edges and vertices. Each edge has a transfer function. Each vertex has a value. Values of the local graph form a lattice under a partial ordering.
REFERENCES:
patent: 5671419 (1997-09-01), Carini et al.
patent: 5740443 (1998-04-01), Carini
patent: 6077313 (2000-06-01), Ruf
patent: 6173444 (2001-01-01), Archambault
patent: 6427234 (2002-07-01), Chambers et al.
patent: 6665865 (2003-12-01), Ruf
patent: 2002/0010911 (2002-01-01), Cheng et al.
Rugina et al., Pointer Analysis for Multithreaded Programs, ACM, 1999.
Bodik et al., Complete Removal of Redundant Expressions, ACM, 1998.
Auslander et al., Fast, Effective Dynamic Compliation, ACM,1996.
Murphy et al., Program Analysis with Partial Transfer Functions, ACM, 2000.
Binkley,“Interprocedural Constant Propagation using Dependence Graphs and a Data-Flow Model,” 1995.
Cousot, P., and Cousot, R., Abstract Interpretation: A Unified Model for Static Analysis of Programs by Construction or Approximation of Fixpoints, In Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (Los Angeles, CA, 1977), ACM Press, 238-252.
Tool Interface Standards,ELF: Executable and Linkable Format, ftp://ftp.intel.com/tis/elf11g.zip.
Unix International, Programming Languages SIG.Dwarf Debugging Information Format, Revision 2.0.0 (Jul. 27, 1993), ftp://ftp.intel.com/pub/tis/dwf11.zip.
Cheng, B.C., and Hwu, W.M., Modular Interprocedural Pointer Analysis Using Access Paths: Design Implementation and Evaluation. InProceedings of the SIGPLAN '00 Conference on Programming Language Design and Implementation(Vancouver, British Columbia, Jun. 2000), ACM Press, 57-69.
Edison Design Group, C+++Front End, Internal Documentation(excerpt), (Aug. 2000), http://www.edg.com/docs,edg—cpp.pdf.
Cooper, K.D., and Kennedy, K., and Torczon, L., Interprocedural Optimization: Eliminating Unnecessary Recompilation. InProceedings of SIGPLAN '86 Symposium on Compiler Construction(Palo Alto, CA, Jun. 1986) ACM Press 58-67.
Burke, M., and Torczon, L.., Interprocedural Optimization: Eliminating Unnecessary Recompilation. InACM Transactions onProgramming Languages and Systems, vol. 15(3), 367-399.
Hall, M.W., Hiranandani, S., Kennedy, K., and Tseng, C.W., Interprocedural Compilation of Fortran D for MIMD Distributed-Memory Machines,Supercomputing'92, 522-534.
Pollock, L.L., and Soffia, M.L., Incremental Global Reoptimization ofPrograms. InACM Transactions on Programming Languages and Systems, vol. 14(2), 173-200.
Gough, K.J., and Klaeren, H., Executable Assertions and Separate Compilation. Inproceeding of 1997 Joint Modular Languages Conference(Linz, Austria) Lecture Notes in Computer Science, vol. 1204, 41-52.
Blakely , Sokoloff, Taylor & Zafman LLP
Chaki Kakali
Kang Insun
LandOfFree
Pruning local graphs in an inter-procedural analysis solver does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Pruning local graphs in an inter-procedural analysis solver, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pruning local graphs in an inter-procedural analysis solver will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3795990