Sorin Lerner, David Grove, Craig Chambers  Home/Search
Context Related
| washington.edu/tr/...WCSE011101.pdf 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: washington.edu/resea...trbyname (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Dataflow analyses can have mutually beneficial interactions. Previous e#orts to exploit these interactions have either (1) iteratively performed each individual analysis until no further improvements are discovered or (2) developed "superanalyses " that manually combine conceptually separate analyses. We have devised a new approach that allows analyses to be defined independently while still enabling them to be combined automatically and profitably. Our approach avoids the loss of precision... (Update)
Similar documents based on text: More All
0.3: ESP: Path-Sensitive Program Verification in Polynomial Time - Das, Lerner, Seigle (2002) (Correct)
0.3: Automatically Proving the Correctness of Compiler.. - Lerner, Millstein.. (2002) (Correct)
0.2: Guaranteed Optimization: Proving Nullspace Properties of.. - Veldhuizen, Lumsdaine (2002) (Correct)
BibTeX entry: (Update)
Sorin Lerner, David Grove, and Craig Chambers. Composing dataflow analyses and transformations. In Conference Record of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland OR, January 2002. http://citeseer.ist.psu.edu/lerner01composing.html More
@inproceedings{ lerner02composing,
author = "Sorin Lerner and David Grove and Craig Chambers",
title = "Composing dataflow analyses and transformations",
booktitle = "Symposium on Principles of Programming Languages",
pages = "270-282",
year = "2002",
url = "citeseer.ist.psu.edu/lerner01composing.html" }
Citations (may not include all citations):480 The program dependence graph and its use in optimization (context) - Ferrante, Ottenstein et al. - 1987
312 Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979
232 Constant propagation with conditional branches (context) - Wegman, Zadeck - 1991
232 Constant propagation with conditional branches (context) - Wegman, Zadeck - 1985
165 Set-based analysis of ml programs (context) - Heintze - 1994
111 Solving systems of set constraints (context) - Aiken, Wimmers - 1992
90 Vortex: An optimizing compiler for object-oriented languages - Dean, DeFouw et al. - 1996
61 Dependence-based program analysis - Johnson, Pingali - 1993
55 A unified treat- ment of flow analysis in higher-order langu.. - Jagannathan, Weeks - 1995
51 Value dependence graphs: Representation without taxation - Weise, Crew et al. - 1994
50 Department of Computer Science and Engineering (context) - Chambers, language et al. - 1993
49 Automatic construction of sparse data flow evaluation graphs (context) - Choi, Cytron et al. - 1991
42 Fiat: A framework for interprocedural analysis and transform.. (context) - Hall, Mellor-Crummey et al. - 1993
41 Sharlit -- a tool for building optimizers - Tjiang, Hennessy - 1992
30 An approach to ordering optimizing transformations (context) - Whitfield, So - 1990
[Article contains additional citations not shown here]
Documents on the same site (http://www.cs.washington.edu/research/tr/tr-by-name.html): More
A Multiresolution Framework for Dynamic Deformations - Capell, Green, Curless.. (2002) (Correct)
A Bilinear Model for Sparse Coding - Grimes, Rao (2002) (Correct)
Denali: Lightweight Virtual Machines for Distributed and.. - Whitaker, Shaw, Gribble (2002) (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