Automatic time-bound analysis for a higher-order language

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue , 2002, Pages 75-86

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

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CODES (SYMBOLS); DATA FLOW ANALYSIS; DATA STRUCTURES; INTERACTIVE COMPUTER SYSTEMS; PROGRAM COMPILERS; TIME SHARING PROGRAMS;

AUTOMATIC TIME BOUND ANALYSIS; COMPILER OPTIMIZATION; TIME BOUND FUNCTIONS;

HIGH LEVEL LANGUAGES;

EID: 0036040025     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/503032.503039     Document Type: Conference Paper

References (41)

1. On the false path problem in hard real-time programs
2. Bounding worst-case instruction cache performance
3. Calculating sized types
4. Computer-assisted microanalysis of programs
5. Resource bound certification
6. Facilitating worst-case execution time analysis for optimized code
7. Deriving annotations for tight calculation of execution time
8. Applying compiler techniques to cache behavior prediction
9. Lambda-Upsilon-Omega: An assistant algorithms analyzer
10. Automatic average-case analysis of algorithms
11. Automatic derivation of path and loop annotations in object-oriented real-time programs
12. A retargetable technique for predicting execution time
13. Bounding loop iterations for timing analysis
14. Recursion and dynamic data-structures in bounded space: Towards embedded ML programming
15. Proving the correctness of reactive systems using sized types
16. Ace: An automatic complexity evaluator
17. An accurate worst case timing analysis for RISC processors
18. Automatic accurate time-bound analysis for high-level languages
19. Static caching for incremental computation
20. Systematic derivation of incremental programs
21. Integrating path and timing analysis using instruction-level simulation techniques
22. Predicting program execution times by analyzing static and dynamic program paths
23. Experiments with a program timing tool based on source-level timing schema
24. Static dependent costs for estimating execution time
25. Automatic complexity analysis
26. Analysis of benchmark characterization and benchmark performance prediction
27. Machine characterization based on an abstract high-level language machine
28. Complexity analysis for a lazy higher-order language
29. Reasoning about time in higher level language software
30. Automatic accurate stack space and heap space analysis for high-level languages
31. Mechanical program analysis
32. Value dependence graphs: Representation without taxation
33. The automatic complexity analysis of divide-and-conquer algorithms