Li-Ling Chen, Williams Ludwell Harrison III, Kwangkeun Yi  Home/Search
Context Related
| pllab.kaist.ac.kr/~k...95jplchhayi.ps ropas.kaist.ac.kr/...5jplchhayi.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: pllab.kaist.ac.kr/~kwang...papers (more) Homepages: K.Yi |
Rate this article:      (best)Comment on this article |
Abstract: This paper proposes a model for studying the computation of fixpoints that arise in complex program analysis based on abstract interpretation, and presents an efficient algorithm for computing fixpoints based on the model. Abstract interpretation provides a unified framework for handling interprocedural analysis of programs with unrestricted pointer manipulation, higher-order functions, and continuations. In the general case, the structure of the fixpoint computation is not known before... (Update)
Context of citations to this paper: More
...run time states that occur before and after that point during execution. The safeness of this collecting analysis algorithm is proven in [13]. Note that the fixpoint algorithm is a generic one that can be used only if the lattices are finite and the functions are monotonic....
...accuracy trade off of the generated analyzers. The Z2 system has been used to prototype analyzers (constant propagation[5] def use chain[1], exception analysis[6] for programs written in complete C, Fortran, ML, and Scheme. Other conventional analyses (dependence analysis[2]...
Cited by: More
Yet Another Ensemble of Abstract Interpreter, Higher-Order.. - Yi (2001) (Correct)
SUIF Program Analysis Using System Z2 - Kim, Yi, Eo, Choe (Correct)
Z1: A Data Flow Analyzer Generator - Yi, Harrison (Correct)
Similar documents (at the sentence level):
17.4%: Efficient Computation of Fixpoints that Arise in Complex.. - Chen, Harrison III (Correct)
Active bibliography (related documents): More All
0.3: Automatic Generation and Management of Program Analyses - Yi (1993) (Correct)
0.2: Abstract Interpretation of Functional Languages: From Theory to.. - Hunt (1991) (Correct)
0.2: Eliminating Dead Computations on Recursive Data - Liu (1997) (Correct)
Similar documents based on text: More All
0.2: Approximations, Stable Operators, Well-Founded.. - Denecker, Marek.. (2000) (Correct)
0.2: Bounded Fixpoints for Complex Objects - Suciu (1997) (Correct)
0.2: Reasoning in Expressive Description Logics with.. - Calvanese, De.. (1999) (Correct)
Related documents from co-citation: More All
2: Elimination algorithms for data flow analysis (context) - Ryder, Paull - 1986
2: Flow Analysis of Comptuer Programs (context) - Hecht - 1977
2: region and effect inference (context) - Talpin, Jouvelot - 1992
BibTeX entry: (Update)
Liling Chen, Luddy Harrison, and Kwangkeun Yi. Efficient computation of fixpoints that arise in complex program analysis. Journal of Programming Languages, to appear. http://citeseer.ist.psu.edu/163562.html More
@article{ chen95efficient,
author = "Liling Chen and Luddy Harrison and Kwangkeun Yi",
title = "Efficient computation of fixpoints that arise in complex program analysis",
journal = "Journal of Programming Languages",
volume = "3",
number = "1",
pages = "31--68",
year = "1995",
url = "citeseer.ist.psu.edu/163562.html" }
Citations (may not include all citations):1399 Compilers - Principles (context) - Aho, Sethi et al. - 1986
480 The program dependence graph and its use in optimization (context) - Ferrante, Ottenstein et al. - 1987
405 Depth-first search and linear graph algorithms (context) - Tarjan - 1972
312 Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979
232 Constant Propagation with Conditional Branches (context) - Wegman, Zadeck - 1991
221 Denotational Semantics: A Methodology for Language Developme.. (context) - Schmidt - 1986
217 The Perfect Club Benchmarks: effective performance evaluatio.. - Berry - 1989
171 Dependence graphs and compiler optimizations (context) - Kuck, Kuhn et al. - 1981
152 An efficient method of computing static single assignment fo.. (context) - Cytron, Ferrante et al. - 1989
127 Control flow analysis in Scheme (context) - Shivers - 1988
97 Pointer-induced aliasing: a problem classification (context) - Landi, Ryder - 1990
93 Global data flow analysis and iterative algorithms (context) - Kam, Ullman - 1976
86 The program dependence web: A representation supporting cont.. (context) - Ballance, Maccabe et al. - 1990
72 A Semantic Model of Reference Counting and its Abstraction - Hudak - 1987
71 Abstract Interpretation and Optimising Transformations for A.. (context) - Mycroft - 1981
60 Dependence flow graphs: an algebraic approach to program dep.. - Pingali, Beck et al. - 1990
55 A program data flow analysis procedure (context) - Allen, Cocke - 1976
53 Automatic Construction of Sparse Data Flow Evaluation Graphs (context) - Choi, Cytron et al. - 1991
50 Elimination algorithms for data flow analysis (context) - Ryder, Paull - 1986
44 Data flow analysis of applicative programs using minimal fun.. (context) - Jones, Mycroft - 1986
41 Strictness analysis - a practical approach (context) - Clack, Jones - 1985
39 A fast and usually linear algorithm for global flow analysis (context) - Graham, Wegman - 1976
38 Control flow analysis (context) - Allen - 1970
37 Flow analysis of lazy higher-order functional programs (context) - Jones - 1987
33 Automatic generation and management of interprocedural data .. - Yi, Harrison - 1993
33 The interprocedural analysis and automatic parallelization o.. (context) - Harrison - 1989
29 Constructing call multigraphs using dependence graphs - Lakhotia - 1993
23 Abstract Interpretation and the Parallel Evaluation of Funct.. (context) - Burn - 1987
19 The theory and practice of strictness analysis for higher or.. (context) - Burn, Hankin et al. - 1986
17 An efficient general iterative algorithm for dataflow analys.. (context) - Horwitz, Demers et al. - 1987
13 Finding fixed points in finite lattices (context) - Martin, Hankin - 1987
12 Fixed points and frontiers: a new perspective (context) - Hunt, Hankin - 1991
7 Node listings for reducible flowgraphs (context) - Aho, Ullman - 1976
7 A program's eye view of Miprac - Harrison, Ammarguellat - 1992
5 Numerical Recipes: Example Book (context) - Vertterling - 1988
4 Ellis Horwood Series in Computers and Their Applications (context) - Abramsky, Hankin et al. - 1987
2 A simple algorithm for global dataflow problmes (context) - Hecht, Ullman - 1977
1 Efficient flow-sensitive inerprocedural computation of point.. (context) - Choi, Burke et al. - 1993
1 Efficient computation of fixpoints that arise in complex pro.. (context) - Chen, Harrison - 1992
Documents on the same site (http://pllab.kaist.ac.kr/~kwang/papers.html): More
Z1: A Data Flow Analyzer Generator - Yi, Harrison (Correct)
Automatic Generation and Management of Interprocedural.. - Yi, Harrison, III (1993) (Correct)
Compile-time Detection of Uncaught Exceptions in Standard ML Programs - Yi (1994) (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