| Alternate document: Details Automatic Location of Text in Video Frames (01) Xian-Sheng Hua, Xiang-Rong Chen, Liu Wenyin, Hong-Jiang Zhang |
Yanhong A. Liu, Gustavo Gómez  Home/Search
Context Related
| sunysb.edu/pub/liu...ostAnalTR01.ps.gz sunysb.edu/pub/liu/CostAnalTC.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: sunysb.edu/~liu/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: |This paper describes a language-based approach for automatic and accurate cost-bound analysis. The approach consists of transformations for building cost-bound functions in the presence of partially known input structures, symbolic evaluation of the cost-bound function based on input size parameters, and optimizations to make the overall analysis ecient as well as accurate, all at the source-language level. The calculated cost bounds are expressed in terms of primitive cost parameters. These... (Update)
Context of citations to this paper: More
...counts meticulously. Summarizing the results of two branches into a single partially known structure, as is done in time analysis [18], does not work for live heap bound analysis because it would be impossible to keep track of references accurately. So the result of a...
...We can determine statically whether such information is cached in the nal program. If so, we can use time and space analysis [32, 54, 59, 60, 61] to determine conservatively whether it is worthwhile to use and maintain such information. The trade o between time and space is an...
Cited by: More
Optimizing Ackermann's Function by Incrementalization - Liu, Stoller (2001) (Correct)
Dynamic Programming via Static Incrementalization - Liu, Stoller (2002) (Correct)
Optimized Live Heap Bound Analysis - Unnikrishnan, Stoller, Liu (2001) (Correct)
Similar documents (at the sentence level):
12.8%: Automatic Time-Bound Analysis for a Higher-Order Language - Gómez, Liu (1999) (Correct)
11.6%: Automatic Accurate Time-Bound Analysis for High-Level Languages - Liu, Gomez (1998) (Correct)
Active bibliography (related documents): More All
0.8: Automatic Accurate Stack Space and Heap Space Analysis.. - Unnikrishnan, Stoller, .. (Correct)
0.3: Efficient Analysis of Temporal Properties for Real-Time Systems - .. - Müller (2000) (Correct)
0.3: Automatic Accurate Live Memory Analysis for.. - Unnikrishnan, Stoller, .. (2001) (Correct)
Similar documents based on text: More All
0.2: Incremental Computation: A Semantics-Based Systematic.. - Liu (1996) (Correct)
0.2: Principled Strength Reduction - Liu (1996) (Correct)
0.2: Incremental Computation for Transformational Software.. - Liu, Teitelbaum (1995) (Correct)
Related documents from co-citation: More All
3: Introduction to algorithms (context) - Cormen, Leiserson et al. - 1991
2: Automatic complexity analysis (context) - Rosendahl - 1989
2: A powerful strategy for deriving ecient programs by transformation (context) - Pettorossi - 1984
BibTeX entry: (Update)
Y. A. Liu and G. Gomez. Automatic accurate cost-bound analysis for high-level languages. IEEE Transactions on Computers, 50(12):1295-1309, Dec. 2001. http://citeseer.ist.psu.edu/liu01automatic.html More
@article{ liu01automatic,
author = "Ming-Gang Liu and Chao-Huan Hou",
title = "Automatic Segmentation and Tracking of Moving Objects",
journal = "Lecture Notes in Computer Science",
volume = "2195",
pages = "214--??",
year = "2001",
url = "citeseer.ist.psu.edu/liu01automatic.html" }
Citations (may not include all citations):2003 The Art of Computer Programming (context) - Knuth - 1968
638 Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
430 Structure and Interpretation of Computer Programs (context) - Abelson, Sussman et al. - 1985
252 Analysis of pointers and structures (context) - Chase, Wegman et al. - 1990
171 The Synthesizer Generator: A System for Constructing Languag.. (context) - Reps, Teitelbaum - 1988
103 Experiments with a program timing tool based on source-level.. (context) - Park, Shaw - 1991
103 The denition of Standard ML (context) - Milner, Tofte et al. - 1990
92 Reasoning about time in higher level language software - Shaw - 1989
91 An accurate worst case timing analysis for RISC processors - Lim, Bae et al. - 1995
85 Predicting program execution times by analyzing static and d.. (context) - Park - 1993
83 Bounding worst-case instruction cache performance (context) - Arnold, Mueller et al. - 1994
83 A retargetable technique for predicting execution time - Harmon, Baker et al. - 1992
80 The Scheme Programming Language (context) - Dybvig - 1987
79 Abstractions for recursive pointer data structures: Improvin.. - Hendren, Hummel et al. - 1992
57 The concept of a supercompiler (context) - Turchin - 1986
57 Systematic derivation of incremental programs - Liu, Teitelbaum - 1995
56 An introduction to partial evaluation (context) - Jones - 1996
51 Value dependence graphs: Representation without taxation - Weise, Crew et al. - 1994
50 Deriving annotations for tight calculation of execution time - Ermedahl, Gustafsson - 1997
49 Automatic complexity analysis (context) - Rosendahl - 1989
48 Mechanical program analysis (context) - Wegbreit - 1975
47 Machine characterization based on an abstract high-level lan.. (context) - Saavedra-Barrera, Smith et al. - 1989
47 the false path problem in hard real-time programs - Altenbernd - 1996
39 Automatic average-case analysis of algorithms - Flajolet, Salvy et al. - 1991
37 Complexity analysis for a lazy higher-order language - Sands - 1990
35 Partial Evaluation and Mixed Computation (context) - Bj, Ershov et al. - 1988
33 Applying compiler techniques to cache behavior prediction - Ferdinand, Martin et al. - 1997
33 Static caching for incremental computation - Liu, Stoller et al. - 1998
26 Automatic accurate time-bound analysis for high-level langua.. - Liu, omez - 1998
25 Program improvement by internal specialization (context) - Scherlis - 1981
25 The size-change principle for program termination - Lee, Jones et al. - 2001
24 Bounding loop iterations for timing analysis - Healy, Sj et al. - 1998
23 Strictness analysis aids time analysis - Wadler - 1988
23 Revised report on the algorithmic language Scheme (context) - Abelson, Dybvig - 1998
23 Facilitating worst-case execution time analysis for optimize.. - Engblom, Altenbernd et al. - 1998
22 Integrating path and timing analysis using instruction-level.. - Lundqvist, Stenstr - 1998
21 An integrated path and timing analysis method based on cycle.. (context) - Lundqvist, Stenstr - 1999
16 Automatic derivation of path and loop annotations in object-.. - Gustafsson, Ermedahl - 1998
16 Goal-directed program transformation (context) - Wegbreit - 1976
15 Lambda-Upsilon-Omega: An assistant algorithms analyzer - Flajolet, Salvy et al. - 1989
15 Computer-assisted microanalysis of programs (context) - Cohen - 1982
15 The automatic complexity analysis of divide-and-conquer algo.. - Zimmermann, Zimmermann - 1991
14 Eciency by incrementalization: An introduction (context) - Liu - 2000
13 Ace: An automatic complexity evaluator (context) - Le and, etayer - 1988
11 Chez Scheme System Manual (context) - Systems - 1994
10 Generalized partial evaluation (context) - Futamura, Nogi
10 Live memory analysis for garbage collection in embedded syst.. (context) - Persson - 1999
9 Worst-case space and time complexity of recursive procedures - Blieberger, Lieger - 1996
7 Analysis of benchmark characterization and benchmark perform.. (context) - Saavedra, Smith - 1996
6 Automatic accurate live memory analysis for garbagecollected.. - Unnikrishnan, Stoller et al. - 2001
3 Ecient and precise cache behavior prediction for real-time s.. (context) - Ferdinand, Wilhelm - 1999
1 Computing maximum task execution times | a graph-based appro.. (context) - Puschner, Schedl - 1997
1 Data- ow frameworks for worst-case execution time analysis (context) - Blieberger
Documents on the same site (http://www.cs.sunysb.edu/~liu/): More
Dynamic Programming via Static Incrementalization - Liu, Stoller (2000) (Correct)
Optimizing Ackermann's function by incrementalization - Liu, Stoller (2000) (Correct)
Strengthening Invariants for Efficient Computation - Liu, Stoller, Teitelbaum (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