Data processing: software development – installation – and managem – Software program development tool – Testing or debugging
Reexamination Certificate
2006-02-21
2006-02-21
Chaki, Kakali (Department: 2193)
Data processing: software development, installation, and managem
Software program development tool
Testing or debugging
C717S154000, C717S157000, C717S151000, C717S155000, C717S156000
Reexamination Certificate
active
07003760
ABSTRACT:
Methods are described that enhance pointer analysis for programs. Whereas previous methods are constrained by the extremes of an inverse relationship between time and information, the present methods selectively unify information so as to allow a desired level of analytical decision within a desired duration of analysis. One aspect of the present invention includes selectively retaining information at a first order of indirection based on variables in an assignment statement while unifying information at subsequent orders of indirection. The methods are used for pointer variables, but are equally useful to function definitions, function calls, function pointers, indirect function calls, and others. The methods may be used in client analysis tools such as code browsers and slicing tools.
REFERENCES:
patent: 6249910 (2001-06-01), Ju et al.
“Points-to Analysis in Almost Linear Time” by Bjarne Steengaard, Conference Record of the Twenty-Third ACM Symposium on Principles of Programming Languages, Jan. 1996, p. 32-41.
“Partial Online Cycle Elimination in Inclusion Constraint Graphs” by Manuel Fahndrich et al., Proceedings of the ACM SIG-PLAN '98 Conference on Programming Language Design and Implementation (PLDI), Montreal, Canada, Jun. 1998.
“Points-to analysis in almost linear time” by Bjarne Steensgaard, Microsoft Research Technical Report MSR-TR-95-08, Mar. 1995.
“Compilers: Principles, Techniques, and Tools” by Alfred V. Aho et al., Addison-Wesley Publishing Company, 1986. pp. 648-660 and pp. 10-19.
Andersen, Program Analysis and Specialzation for the C Programming Language, May 1994.
Anderson, L.O., “Program Analysis and Specialization for the C Programming Language”,Ph.D. Thesis, DIKU, University of Copenhagen, (May, 1994).
Choi, J., et al., “Efficient Flow-Sensitive Interprocedural Computation of Pointer-Induced Aliases and Side Effects”,ACM Press—Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Association Computing Machinery, 232-245, (Jan. 10-13, 1993).
Das, M., “Unification-based Pointer Analysis with Directional Assignments”,Microsoft Research, Microsoft Corporation, 1-13.
Emami, M., et al., “Context-Sensitive Interprocedural Points-to-Analysis in the Presence of Function Pointers”,McGill University School of Computer Science, ACAPS Technical Memo 54—Advanced Compilers, Architectures and Parallel Systems Group, 1-28, (Nov. 12, 1993).
Henglein, F., “Breaking through the n3 barrier: Faster object type inference”,DIKU, University of Copenhagen, Theory and Practice of Object Systems, 1-16.
Landi, W., et al., “A Safe Approximate Algorithm for Interprocedural Pointer Aliasing”,Department of Computer Science—Rutgers University, New Brunswick, NJ 08903, Proceedings of the ACM—ACM Press—SIGPLAN '92 Conference on Programming Language Design and Implementation—San Francisco, California, 235-248, (Jun. 17-19, 1992).
Liang, D., et al., “Efficient Points-To Analysis for Whole-Program Analysis”,Proceedings of the 7th European Software Engineering Conference and 7th ACM SIGSOFT Symposium on the Foundation of Software Engineering, 1-17, (Sep., 1999).
Ramalingam, G., et al., “Aggregate Structure Identification and its Application to Program Analysis”, 119-132.
Shapiro, M., et al., “Fast and Accurate Flow-Insensitive Points-To Analysis*”,Computer Sciences Department—University of Wisconsin-Madison, 1-14.
Steensgaard, B., “Points-to Analysis in Almost Linear Time”,ACM POPL '96, St. Petersburg, FL, 32-41, (Jan. 21-24, 1996).
Steensgaard, B., “Points-to analysis in almost linear time”,Technical Report—MSR-TR-95-08, Microsoft Research—Advanced Technology Division, 1-12, (Mar., 1995).
Steensgaard, B., “Points-to-Analysis by Type Inference of Programs with Structures and Unions”,Microsoft Research, 15 Pages.
Tarjan, R.E., “Data Structures and Network Algorithms”,44—Society for Industrial and Applied Mathematics, 1-125, (1983).
Yong, S.H., et al., “Pointer Analysis for Programs with Structures and Casting”,Computer Sciences Department—University of Wisconsin-Madison, 1-13.
Chaki Kakali
Kang Insun
Merchant & Gould
LandOfFree
Method for enhancing pointer analyses does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for enhancing pointer analyses, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for enhancing pointer analyses will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3671429