J.-D. Choi, Michael Burke, and Paul Carini. Efficient flow-sensitive inerprocedural computation of pointer-induced aliases and side effects. In ACM 20th Symposium on Principles of Programming Languages, pages 232--245, 1993.

 Home/Search   Document Not in Database   Summary   Related Articles  

This paper is cited in the following contexts:
Efficient Computation of Fixpoints that Arise in.. - Chen..   (1 citation)  (Correct)

....example program of pointers and higher order procedures. 3. 3 Example Analysis based on Abstract Interpretation We will illustrate the idea of abstract interpretation in the presence of pointers and higher order procedures using the example program in Figure 3, which is similar to that defined in [35, 36]. The program is written in a simple language that permits pointers to variables and pointers to procedures, but little else. In particular, for simplicity, we assume that the language does not support recursion or structures, and that every variable has a distinct identifier. In other words, the ....

J.-D. Choi, Michael Burke, and Paul Carini. Efficient flow-sensitive inerprocedural computation of pointer-induced aliases and side effects. In ACM 20th Symposium on Principles of Programming Languages, pages 232--245, 1993.

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