Automatic accurate cost-bound analysis for high-level languages

IEEE Transactions on Computers

Volumn 50, Issue 12, 2001, Pages 1295-1309

  Liu, Yanhong A ^a   Gómez, Gustavo ^b  

^a Stony Brook University   (United States)

^b INDIANA UNIVERSITY   (United States)

Author keywords

Cost analysis; Cost bound; Performance analysis and measurements; Program analysis and transformation; Program optimization; Space analysis; Time analysis; Timing analysis; Worst case execution time

Indexed keywords

ALGORITHMS; COMPUTATIONAL GRAMMARS; COMPUTATIONAL METHODS; COMPUTER SOFTWARE SELECTION AND EVALUATION; COST BENEFIT ANALYSIS; PROGRAM DIAGNOSTICS; SOFTWARE PROTOTYPING;

COST BOUND ANALYSIS; PROGRAM ANALYSIS; PROGRAM OPTIMIZATION; PROGRAM TRANSFORMATION; SPACE ANALYSIS; TIMING ANALYSIS; WORST-CASE EXECUTION TIME;

HIGH LEVEL LANGUAGES;

EID: 0035690862     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2001.970569     Document Type: Article

References (53)

1. Revised report on the algorithmic language scheme
2. On the false path problem in hard real-time programs
3. Bounding worst-case instruction cache performance
4. Data-flow frameworks for worst-case execution time analysis
5. Worst-case space and time complexity of recursive procedures
6. Analysis of pointers and structures
7. Computer-assisted microanalysis of programs
8. Facilitating worst-case execution time analysis for optimized code
9. Deriving annotations for tight calculation of execution time
10. Applying compiler techniques to cache behavior prediction
11. Efficient and precise cache behavior prediction for real-time systems
12. Lambda-upsilon-omega: An assistant algorithms analyzer
13. Automatic average-case analysis of algorithms
14. Generalized partial evaluation
15. Automatic derivation of path and loop annotations in object-oriented real-time programs
16. A retargetable technique for predicting execution time
17. Bounding loop iterations for timing analysis
18. Abstractions for recursive pointer data structures: Improving the analysis and transformation of imperative programs
19. An introduction to partial evaluation
20. Ace: An automatic complexity evaluator
21. The size-change principle for program termination
22. An accurate worst case timing analysis for RISC processors
23. Efficiency by incrementalization: An introduction
24. Automatic accurate time-bound analysis for high-level languages
25. Static caching for incremental computation
26. Systematic derivation of incremental programs
27. Integrating path and timing analysis using instruction-level simulation techniques
28. An integrated path and timing analysis method based on cycle-level symbolic execution
29. Predicting program execution times by analyzing static and dynamic program paths
30. Experiments with a program timing tool based on source-level timing schema
31. Live memory analysis for garbage collection in embedded systems
32. Computing maximum task execution times-a graph-based approach
33. Automatic complexity analysis
34. Analysis of Benchmark characterization and Benchmark performance prediction
35. Machine characterization based on an abstract high-level language machine
36. Complexity analysis for a lazy higher-order language
37. Program improvement by internal specialization
38. Reasoning about time in higher level language software
39. The concept of a supercompiler
40. Automatic accurate live memory analysis for garbage-collected languages
41. Strictness analysis aids time analysis
42. Mechanical program analysis
43. Goal-directed program transformation
44. Value dependence graphs: Representation without taxation
45. The automatic complexity analysis of divide-and-conquer algorithms