David Morgenthaler. Poster presentation at PLDI'95, June 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Points-to Analysis in Almost Linear Time - Steensgaard (1995) (221 citations) (Correct)
.... polymorhpic for calls to library functions) The analysis algorithm is routinely applied to the C programs processed by the system. Two implementations of an earlier type inference based pointsto analysis algorithm [Ste95a] have been performed at University of California, San Diego; one in C [Mor95] and one in Scheme [Gri95] Both implementations have been augmented to model slots of structured objects independently. Our earlier algorithm was based on the same non standard type system as used in the present algorithm but used stricter typing rules, implying that the results are more ....
....by adding points to analysis to the parser. Counting only the extra time for performing the analysis, emacs (127,000 non empty lines of code) could be analyzed in approximately 50 seconds, and FElt (273,000 non empty lines of code) could be analyzed in approximately 82 seconds on a SparcStation 10 [Mor95]. The present algorithm can also easily be implemented to process the statements during parsing. The running times of the previous and the present algorithm are roughly the same (only minor fluctuations) Table 1, Table 2, and Table 3 illustrate the distribution of program variables per type ....
David Morgenthaler. Poster presentation at PLDI'95, June 1995.
Points-to Analysis by Type Inference of Programs with.. - Steensgaard (1996) (47 citations) (Correct)
....that distinguishes components of structured objects [Zha95] They use a type system without a element, substituting the v operator by the = operator, thus not being as precise as our algorithm. David Morgenthaler extended our earliest algorithm to distinguish components of structured objects [Mor95]. His algorithm also uses a type system without a element and does not incorporate pointer offsets in the constraint system. Furthermore, his implementation is not meant to deal correctly with unions. His analysis is performed during parsing of the program. Henglein used type inference to ....
David Morgenthaler. Poster presentation at PLDI'95, June 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC