Mooly Sagiv, Thomas Reps, Susan Horwitz  Home/Search
Context Related
| wisc.edu/pub/techreports...tr1284.ps.Z wisc.edu/wpis/papers/tcs96b.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wisc.edu (more) From: 128.105.7.11/wpis/html/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 two efficient algorithms that produce precise solutions: an exhaustive algorithm that finds values for all symbols at all program points, and a demand algorithm that finds the value for an individual... (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):
25.7%: Precise Interprocedural Dataflow Analysis with.. - Sagiv, Reps, Horwitz (1995) (Correct)
Active bibliography (related documents): More All
0.3: Demand Interprocedural Dataflow Analysis - Susan Horwitz Thomas (Correct)
0.3: Demand Interprocedural Program Analysis Using Logic Databases - Reps (1994) (Correct)
0.3: Interprocedural DataflowAnalysis via Graph Reachability - Reps, Sagiv, Horwitz (1994) (Correct)
Similar documents based on text: More All
0.4: Polynomial Constants are Decidable - Müller-Olm, Seidl (Correct)
0.4: The Complexity of Copy Constant Detection in Parallel Programs - Müller-Olm (Correct)
0.3: On Optimal Slicing of Parallel Programs - Müller-Olm, Seidl (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/sagiv95precise.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/sagiv95precise.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
981 Principles of Database and Knowledge-Base Systems (context) - Ullman - 1989
232 Constant propagation with conditional branches (context) - Wegman, Zadeck - 1985
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
129 Precise interprocedural dataflow analysis via graph reachabi.. - Reps, Horwitz et al. - 1995
121 the power of magic - Beeri, Ramakrishnan - 1987
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 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
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
27 Solving demand versions of interprocedural analysis problems (context) - Reps - 1994
20 Demand interprocedural program analysis using logic database.. - Reps - 1994
20 Interprocedural constant propagation: An empirical study (context) - Metzger, Stroud - 1993
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
13 Property extraction in well-founded property sets (context) - Wegbreit - 1975
12 Flow-sensitive interprocedural constant propagation - Carini, Hind - 1995
8 a technique for the processing of recursive axioms in deduct.. (context) - Rohmer, Lescoeur et al. - 1986
6 Two approaches for interprocedural data flow analysis (context) - Sharir, Pnueli - 1981
6 Finite constants: Characterizations of a new decidable set o.. (context) - Steffen, Knoop - 1991
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://fermivista.math.jussieu.fr/ftp/ftp.cs.wisc.edu.html): More
A Comparison of Trace-Sampling Techniques for Multi-Megabyte .. - Kessler, HIll, Wood (1994) (Correct)
Parallel Processing on Dynamic Resources with CARMI - Pruyne (1995) (Correct)
Data Memory Alternatives for Multiscalar Processors - Breach, Vijaykumar, Gopal, .. (1997) (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