Jens Knoop, Oliver Rüthing, Bernhard Steffen  Home/Search
Context Related
| sunshine.cs.unidortmund...tkjpl.ps.gz 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: sunshine.cs.unidortmund.de/~r... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this article, the classical application of DFA. In this context, designers of a DFA are typically faced with the problem of how to construct an algorithm that determines the set of program points of an argument program which satisfy a certain property of interest. Though this problem has been studied in detail for the intraprocedural case, the construction of interprocedural analyses is still (Update)
Context of citations to this paper: More
...xpoint iteration. This can be exploited to obtain simple implementations in current program analysis generators like DFA OPT MetaFrame [9] or PAG [1] which provide all the required xpoint iteration machinery. The constraint systems discussed up to now are control structure...
.... In a series of later papers, Ste en and his coworkers have further articulated the theory, and demonstrated its practical bene ts [22, 23, 29]. The present paper builds on Ste en s ideas, combining it with a simple notion of rewriting on control ow graphs, and introducing a...
Cited by: More
Type Analysis and Type-test Elimination in Oberon-2 - Jens Knoop And (Correct)
Efficient Algorithms for pre* and post* on Interprocedural.. - Esparza, Podelski (2000) (Correct)
A Comparative Study of Reaching-definitions Analyses - Collard, Knoop (1998) (Correct)
Active bibliography (related documents): More All
0.9: The Interprocedural Coincidence Theorem - Knoop, Steffen (1992) (Correct)
0.6: An Approach for Exploring Code Improving Transformations - Whitfield, Soffa (1997) (Correct)
0.4: Optimization of Data Remapping in Data-Parallel Languages - Mehofer (1998) (Correct)
Similar documents based on text: More All
0.3: Hierarchy of Strongly Connected k-entry DFA - Holzer, Salomaa, Yu (2001) (Correct)
0.3: Optimal Code Motion: Theory and Practice - Knoop, Rüthing, Steffen (1994) (Correct)
0.3: Chaotic Fixed Point Iterations - Geser, Knoop, Lüttgen, Steffen (1994) (Correct)
Related documents from co-citation: More All
11: The interprocedural coincidence theorem - Knoop, Steffen - 1992
8: Two approaches to interprocedural data flow analysis (context) - Sharir, Pnueli - 1981
8: Flow Analysis of Computer Programs (context) - Hecht - 1977
BibTeX entry: (Update)
J. Knoop, O. Ruthing, and B. Steffen. Towards a tool kit for the automatic generation of interprocedural data flow analyses. Journal of Programming Languages, 4(4):211--246, 1996. http://citeseer.ist.psu.edu/knoop96towards.html More
@article{ knoop96towards,
author = "J. Knoop and O. R{\"u}thing and B. Steffen",
title = "Towards a tool kit for the automatic generation of interprocedural data flow analyses",
journal = "Journal of Programming Languages", volume = 4, number = 4, pages = {211--246}, year = "1996", url = "citeseer.ist.psu.edu/knoop96towards.html",
url = "citeseer.ist.psu.edu/knoop96towards.html" }
Citations (may not include all citations):390 Interprocedural slicing using dependence graphs - Horwitz, Reps et al. - 1990
225 Flow Analysis of Computer Programs (context) - Hecht - 1977
144 Two approaches to interprocedural data flow analysis (context) - Sharir, Pnueli - 1981
132 Detecting conflicts between structure accesses (context) - Larus, Hilfinger - 1988
129 Global value numbers and redundant computations (context) - Rosen, Wegman et al. - 1988
129 Precise interprocedural dataflow analysis via graph reachabi.. - Reps, Horwitz et al. - 1995
116 Monotone data flow analysis frameworks (context) - Kam, Ullman - 1977
104 Lazy code motion - Knoop, Ruthing et al. - 1992
92 A flexible approach to interprocedural data flow analysis an.. (context) - Jones, Muchnick - 1982
91 An efficient way to find the side effects of procedure calls.. (context) - Banning - 1979
86 A precise inter-procedural data flow algorithm (context) - Myers - 1981
84 Optimal code motion: Theory and practice - Knoop, Ruthing et al. - 1994
82 Partial dead code elimination - Knoop, Ruthing et al. - 1994
68 Interprocedural data flow analysis in the presence of pointe.. - Weihl - 1980
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
55 Demand-driven computation of interprocedural data flow - Duesterwald, Gupta et al. - 1995
51 Fast interprocedural alias analysis (context) - Cooper, Kennedy - 1989
50 How to analyze large programs efficiently and informatively (context) - Dhamdhere, Rosen et al. - 1992
45 Precise interprocedural dataflow analysis with applications .. - Sagiv, Reps et al. - 1995
44 Static determination of dynamic properties of recursive proc.. (context) - Cousot, Cousot - 1978
38 Generation of efficient interprocedural analyzers with PAG - Alt, Martin - 1995
38 Analyzing aliases of reference formal parameters (context) - Cooper - 1985
33 Interprocedural constant propagation: A study of jump functi.. - Grove, Torczon - 1993
33 Automatic generation and management of interprocedural progr.. - Yi, Harrison - 1993
32 Efficient computation of flow insensitive interprocedural su.. (context) - Cooper, Kennedy - 1984
28 The power of assignment motion - Knoop, Ruthing et al. - 1995
27 Solving demand versions of interprocedural analysis problems (context) - Reps - 1994
24 Parallelism for free: Efficient and optimal bitvector analys.. - Knoop, Steffen et al. - 1996
24 Lazy strength reduction - Knoop, Ruthing et al. - 1993
23 Interprocedural partial redundancy elimination and its appli.. - Agrawal, Saltz et al. - 1995
22 Efficient computation of interprocedural definition-use chai.. (context) - Harrold, Soffa - 1994
21 Data flow analysis for procedural languages (context) - Rosen - 1979
20 Demand interprocedural program analysis using logic database.. - Reps - 1994
20 Automatic generation of global optimizers (context) - Whitfield, Soffa - 1991
20 The fixpoint-analysis machine - Steffen, ClaBetaen et al. - 1995
19 Generating data flow analysis algorithms from modal specific.. - Steffen - 1993
16 Context-sensitive interprocedural pointsto analysis in the p.. (context) - Emami, Rakesh et al. - 1994
14 Optimal interprocedural program optimization: A new framewor.. (context) - Knoop - 1993
13 An interprocedural data flow analysis algorithm (context) - Barth - 1977
10 Private communication (context) - Reps - 1994
10 Interprocedural elimination of partial redundancies (context) - Morel, Renvoise - 1981
9 Data flow analysis and global optimization (context) - Morel - 1984
7 Efficient and optimal bit-vector data flow analyses: A unifo.. (context) - Knoop, Steffen - 1993
6 Peep -- an architectural description driven peephole transfo.. (context) - Kessler - 1984
4 Parallelism for free: Bitvector analyses (context) - Knoop, Steffen et al. - 1995
3 Sharlit -- a tool for building optimizers (context) - Tijang, Hennessy - 1992
2 Automatic generation of peephole transformations (context) - Davidson, Fraser - 1984
2 Interprozedurale Datenflußsysteme (context) - Barth - 1981
1 Spare: A development evironment for program analysis algorit.. (context) - Venkatesh, Fischer - 1992
1 Interprocedural data flow systems (context) - Barth - 1983
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://sunshine.cs.uni-dortmund.de/~ruething/): More
Efficient Code Motion and an Adaption to Strength Reduction - Steffen, Knoop, Rüthing (1991) (Correct)
The Power of Assignment Motion - Knoop, Rüthing, Steffen (1995) (Correct)
Code Motion and Code Placement: Just Synonyms? - Knoop, Rüthing, Steffen (1998) (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