See this document in CiteSeerX!

Demand Interprocedural Dataflow Analysis  (Make Corrections)  (59 citations)
Susan Horwitz, Thomas Reps, and Mooly Sagiv University of Wisconsin
Proceedings of SIGSOFT'95 Third ACM SIGSOFT Symposium on the Foundations of Software Engineering



  Home/Search   Context   Related

 
View or download:
wisc.edu/wpis/papers/tr1283.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  wisc.edu/wpis/papers/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: that are guaranteed to hold whenever that point is reached during program execution. By contrast, a demand dataflow-analysis algorithm determines whether a single given dataflow fact holds at a single given point. (Update)

Cited by:   More
Interconvertibility of Set Constraints and - Context-Free Language..   (Correct)
Precise Interprocedural Dataflow Analysis - With Applications To   (Correct)
Model Checking of Unrestricted Hierarchical State Machines - Exte Nd Ed   (Correct)

Similar documents (at the sentence level):
5.6%:   Precise Interprocedural Dataflow Analysis via Graph.. - Reps, Horwitz, Sagiv (1995)   (Correct)

Active bibliography (related documents):   More   All
1.1:   Interprocedural DataflowAnalysis via Graph Reachability - Reps, Sagiv, Horwitz (1994)   (Correct)
0.8:   Demand Interprocedural Program Analysis Using Logic Databases - Reps (1994)   (Correct)
0.4:   Program Analysis via Graph Reachability - Thomas Reps Computer   (Correct)

System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text:
95.0:   Unknown -   (Correct)

Related documents from co-citation:   More   All
27:   Precise interprocedural dataflow analysis via graph reachability - Reps, Horwitz et al. - 1995
23:   Interprocedural slicing using dependence graphs - Horwitz, Reps et al. - 1990
22:   Demand-driven computation of interprocedural data flow - Duesterwald, Gupta et al. - 1995

BibTeX entry:   (Update)

@inproceedings{ horwitz95demand,
    author = "Susan Horwitz and Thomas Reps and Mooly Sagiv",
    title = "{Demand Interprocedural Dataflow Analysis}",
    booktitle = "Proceedings of {SIGSOFT}'95 Third {ACM} {SIGSOFT} Symposium on the Foundations of Software Engineering",
    pages = "104--115",
    year = "1995",
    url = "citeseer.ist.psu.edu/horwitz95demand.html" }
Citations (may not include all citations):
981   Principles of Database and Knowledge-Base Systems (context) - Ullman - 1989
265   Program slicing (context) - Weiser - 1984
204   Magic sets and other strange ways to implement logic program.. (context) - Bancilhon, Maier et al. - 1986
156   A unified approach to global program optimization (context) - Kildall - 1973
144   Two approaches to interprocedural data flow analysis (context) - Sharir, Pnueli - 1981
129   Precise interprocedural dataflow analysis via graph reachabi.. - Reps, Sagiv et al. - 1995
121   the power of magic - Beeri, Ramakrishnan - 1987
91   An efficient way to find the side effects of procedure calls.. (context) - Banning - 1979
76   The program summary graph and flow-sensitive interprocedural.. (context) - Callahan - 1988
66   Interprocedural side-effect analysis in linear time (context) - Cooper, Kennedy - 1988
66   Interprocedural constant propagation (context) - Callahan, Cooper et al. - 1986
59   The interprocedural coincidence theorem - Knoop, Steffen - 1992
59   Demand interprocedural dataflow analysis - Horwitz, Reps et al. - 1995
55   Demand-driven computation of interprocedural data flow - Duesterwald, Gupta et al. - 1995
51   Fast interprocedural alias analysis (context) - Cooper, Kennedy - 1989
29   Implementing relational views of programs (context) - Linton - 1984
27   Solving demand versions of interprocedural analysis problems (context) - Reps - 1994
26   The Alexander method, a technique for the processing of recu.. (context) - Rohmer, Lescoeur et al. - 1986
24   Generating editing environments based on relations and attri.. (context) - Horwitz, Teitelbaum - 1986
20   Demand interprocedural program analysis using logic database.. - Reps - 1994
15   Invariance of approximative semantics with respect to progra.. - Giegerich, Moncke et al. - 1981
13   Interprocedural dataflow analysis via graph reachability - Reps, Sagiv et al. - 1994
12   BenjaminCumming Publishing Company (context) - LeBlanc, Benjamin et al. - 1988
5   The method of attributes for data flow analysis: Part II. De.. (context) - Babich, Jazayeri - 1978
4   Global program analysis in an interactive environment (context) - Masinter - 1980
3   Demand-driven program analysis (context) - Duesterwald, Gupta et al. - 1993
2   SPEC Component CPU Integer Release (context) - CPU, CINT et al. - 1992



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.wisc.edu/wpis/papers/):   More
Program Generalization for Software Reuse: From C to C++ - Siff, Reps (1996)   (Correct)
Modular Pointer Analysis - Susan Horwitz And   (Correct)
Weighted Pushdown Systems and Weighted Transducers - Lal, Touili, Kidd, Reps   (Correct)

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