Daniel Damian  Home/Search
Context
Related
| brics.dk/~damian/damianmfps.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: brics.dk/~damian/Papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Time stamps were introduced in Shivers's PhD thesis for approximating the result of a control-flow analysis. We show them to be suitable for computing program analyses where the space of results (e.g., control-flow graphs) is large. We formalize time-stamping as a top-down, fixed-point approximation algorithm which maintains a single copy of intermediate results. We then prove the correctness of this algorithm. (Update)
Similar documents (at the sentence level):
78.3%: On Static and Dynamic Control-Flow Information in Program.. - Damian (2001) (Correct)
Active bibliography (related documents): More All
0.7: Global Invariants for Analyzing Multi-threaded Applications - Seidl, Vene, Müller-Olm (Correct)
0.5: Active Libraries and Universal Languages - Veldhuizen (2004) (Correct)
0.2: Non-monotone Fixpoint Iterations to Resolve Second.. - Geser, Knoop.. (1996) (Correct)
Similar documents based on text: More All
0.5: On Shivers's Aggressive Cutoff Method - A Study of the 0-CFA - Damian (1999) (Correct)
0.4: Static Transition Compression - Damian, Danvy (2001) (Correct)
0.4: Syntactic Accidents in Program Analysis: On the Impact of the.. - Damian, Danvy (2000) (Correct)
BibTeX entry: (Update)
@misc{ damian-time,
author = "Daniel Damian",
title = "Time Stamps for Fixed-Point Approximation",
url = "citeseer.ist.psu.edu/480040.html" }
Citations (may not include all citations):815 Abstract interpretation: a unified lattice model for static .. (context) - Cousot, Cousot - 1977
181 Principles of Program Analysis (context) - Nielson, Nielson et al. - 1999
176 Control-Flow Analysis of Higher-Order Languages (context) - Shivers - 1991
116 Monotone data flow analysis frameworks (context) - Kam, Ullman - 1977
54 Abstract interpretation: A semantics-based tool for program .. (context) - Jones, Nielson - 1995
45 Precise interprocedural dataflow analysis with applications .. - Sagiv, Reps et al. - 1996
41 Strictness analysis---a practical approach (context) - Clack, Jones - 1985
36 Natural-semantics-based abstract interpretation (context) - Schmidt - 1995
29 Is continuation-passing useful for data flow analysis - Sabry, Felleisen - 1994
21 Abstract Interpretation of Functional Languages: From Theory.. - Hunt - 1991
19 An even faster solver for general systems of equations - Fecht, Seidl - 1996
17 cient chaotic iteration strategies with widenings (context) - Bourdoncle - 1993
13 Finite fixed-point problems (context) - O'Keefe - 1987
8 Finding fixpoints on function spaces (context) - Young, Hudak - 1986
7 Higher-order chaotic iteration sequences (context) - Rosendahl - 1993
4 Finding fixpoints in finite function spaces using neededness.. (context) - Jrgensen - 1994
4 cient new fixpoint algorithm for distributive constraint sys.. (context) - Fecht, Seidl - 1998
2 A universal top-down fixpoint algorithm (context) - Charlier, Hentenryck - 1992
2 cient computation of fixpoints that arise in complex program.. (context) - Chen, Harrison et al. - 1995
1 cient approach to computing fixpoints for complex program an.. (context) - Chen, Harrison - 1994
Documents on the same site (http://www.brics.dk/~damian/Papers.html): More
Partial Evaluation for Program Analysis - Damian (1998) (Correct)
Syntactic Accidents in Program Analysis: On the Impact of the.. - Damian, Danvy (2000) (Correct)
On Static and Dynamic Control-Flow Information in Program.. - Damian (2001) (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