See this document in CiteSeerX!

Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation (1995)  (Make Corrections)  (45 citations)
Mooly Sagiv, Thomas Reps, Susan Horwitz
Theoretical Computer Science



  Home/Search   Context   Related

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

From:  128.105.7.11/wpis/html/ (more)
(Enter author homepages)

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

Abstract: This paper concerns interprocedural dataflow-analysis problems in which the dataflow information at a program point is represented by an environment (i.e., a mapping from symbols to values), and the effect of a program operation is represented by a distributive environment transformer. We present an efficient dynamic-programming algorithm that produces precise solutions. The method is applied to solve precisely and efficiently two (decidable) variants of the interprocedural constant-propagation ... (Update)

Cited by:   More
Precise Interprocedural Dataflow Analysis - With Applications To   (Correct)
Model Checking x86 Executables - With Codesurfer And   (Correct)
A Relational Approach to Interprocedural Shape Analysis.. - Alexey Loginov Thomas   (Correct)

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

Active bibliography (related documents):   More   All
0.2:   Demand Interprocedural Dataflow Analysis - Susan Horwitz Thomas   (Correct)
0.1:   Deferred Data-Flow Analysis: Algorithms, Proofs and.. - Sharma, Acharya, Saltz   (Correct)
0.1:   Deferred Data-Flow Analysis - Shamik Sharma (1998)   (Correct)

Similar documents based on text:   More   All
0.4:   Polynomial Constants are Decidable - Müller-Olm, Seidl   (Correct)
0.4:   Parametric Shape Analysis via 3-Valued Logic - Sagiv, Reps, Wilhelm (1999)   (Correct)
0.4:   Speeding up Slicing - Reps, Horwitz, Sagiv, Rosay (1994)   (Correct)

Related documents from co-citation:   More   All
27:   Two approaches to interprocedural data flow analysis (context) - Sharir, Pnueli - 1981
22:   Precise interprocedural dataflow analysis via graph reachability - Reps, Horwitz et al. - 1995
19:   The interprocedural coincidence theorem - Knoop, Steffen - 1992

BibTeX entry:   (Update)

T. Reps M. Sagiv and S. Horwitz. Precise interprocedural dataflow analysis with application to constant propagation. In TAPSOFT'95, Arhus, Denmark, LNCS. Springer-Verlag, 1995. http://citeseer.ist.psu.edu/article/reps95precise.html   More

@article{ sagiv96precise,
    author = "Mooly Sagiv and Thomas Reps and Susan Horwitz",
    title = "Precise interprocedural dataflow analysis with applications to constant propagation",
    journal = "Theoretical Computer Science",
    volume = "167",
    number = "1--2",
    pages = "131--170",
    year = "1996",
    url = "citeseer.ist.psu.edu/article/reps95precise.html" }
Citations (may not include all citations):
156   A unified approach to global program optimization (context) - Kildall - 1973
129   Precise interprocedural dataflow analysis via graph reachabi.. - Reps, Horwitz et al. - 1995
97   Pointer induced aliasing: A problem classification (context) - Landi, Ryder - 1991
76   The program summary graph and flow-sensitive interprocedural.. (context) - Callahan - 1988
66   Interprocedural constant propagation (context) - Callahan, Cooper et al. - 1986
59   Demand interprocedural dataflow analysis - Horwitz, Reps et al. - 1995
59   The interprocedural coincidence theorem - Knoop, Steffen - 1992
55   Demand-driven computation of interprocedural data flow - Duesterwald, Gupta et al. - 1995
44   Data flow analysis of applicative programs using minimal fun.. (context) - Jones, Mycroft - 1986
35   Affine relationship among variables of a program (context) - Karr - 1976
28   Cummings Publishing Company (context) - Fischer, LeBlanc et al. - 1988
27   Solving demand versions of interprocedural analysis problems (context) - Reps - 1994
20   Interprocedural constant propagation: An empirical study (context) - Metzger, Stroud - 1993
13   Interprocedural dataflow analysis via graph reachability - Reps, Sagiv et al. - 1994
6   Finite constants: Characterizations of a new decidable set o.. (context) - Steffen, Knoop - 1991
6   Two approaches for interprocedural data flow analysis (context) - Sharir, Pnueli - 1981
3   A study of jump function implementations (context) - Grove, Torczon - 1993
2   SPEC Component CPU Integer Release (context) - Component, Release et al. - 1992



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


Documents on the same site (http://128.105.7.11/wpis/html/):   More
Parametric Shape Analysis via 3-Valued Logic - Sagiv, Reps, Wilhelm (1999)   (Correct)
Interprocedural Path Profiling - Melski, Reps (1998)   (Correct)
A Decidable Logic for Describing Linked Data Structures - Benedikt, Reps, Sagiv (1999)   (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