Automatic accurate time-bound analysis for high-level languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1474, Issue , 1998, Pages 31-40

  Liu, Yanhong A ^a   Gomez, Gustavo ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; EMBEDDED SYSTEMS; PROGRAM COMPILERS;

INPUT PARAMETER; MEASUREMENTS OF; SOURCE LANGUAGE; SYMBOLIC EVALUATION; TIME BOUND; WORST-CASE TIME;

HIGH LEVEL LANGUAGES;

EID: 84958950738     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0057778     Document Type: Conference Paper

References (26)

1. P. Altenbernd. On the false path problem in hard real-time programs. In Proceedings of the 8th EuroMicro Workshop on Real-Time Systems, pages 102-107, L'Aquila, June 1996.
2. B. Bjtrner, A. P. Ershov, and N. D. Jones, editors. Partial Evaluation and Mixed Computation. North-HoUand, Amsterdam, 1988.
3. Cadence Research Systems. Chez Scheme System Manual. Cadence Research Systems, Bloomington, Indiana, revision 2.4 edition, July 1994.
4. D. R. Chase, M. Wegman, and F. K. Zadeck. Analysis of pointers and structures. In Proceedings o/ the ACM SIGPLAN 'gO Conference on Programming Language Design and Implementation, pages 296-310. ACM, New York, June 1990.
5. J. Engblom, P. Altenbernd, and A. Ermedahl. Facilitating worst-case execution time analysis for optimized code. In Proceedings of the lOth EuroMicro Workshop on Real-Time Systems, Berlin, Germany, June 1998.
6. A. Ermedahl and J. Gustafsson. Deriving annotations for tight calculation of execution time. In In Proceedings of Euro-Par'97, volume 1300 of Lecture Notes in Computer Science, pages 1298-1307. Springer-Verlag, Berlin, Aug. 1997.
7. C. Ferdinand, F. Martin, and R. Wilhelm. Applying compiler techniques to cache behavior prediction. In Proceedings of the ACM SIGPLAN 1997 Workshop on Languages, Compilers, and Tools ]or Real-Time Systems, pages 37-46, 1997.
8. P. Flajolet, B. Salvy, and P. Zimmermann. Automatic average-case analysis of algorithms. Theoretical Computer Science, Series A, 79(1):37-109, Feb. 1991.
9. C. Healy, M. SjSdin, V. Rustagi, and D. Whalley. Bounding loop iterations for timing analysis. In Proceedings of the IEEE Real-Time Applications Symposium. IEEE CS Press, Los Alamitos, Calif., June 1998.
10. N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs, N.J., 1993.
11. D. E. Knuth. The Art of Computer Programming, volume 1. Addison-Wesley, Reading, Mass., 1968.
12. D. Le M6tayer. Ace: An automatic complexity evaluator. ACM Trans. Program. Lang. Syst., 10(2):248-266, Apr. 1988.
13. S.-S. Lira, Y. H. Bae, G. T. Jang, B.-D. Rhee, S. L. Min, C. Y. Park, H. Shin, K. Park, S.-M. Moon, and C.-S. Kim. An accurate worst case timing analysis for RISC processors. IEEE Trans. Softw. Eng., 21(7):593-604, July 1995.
14. Y. A. Liu and G. Gomezes. Automatic accurate time-bound analysis for high-level languages. Technical Report TR 508, Computer Science Department, Indiana University, Bloomington, Indiana, Apr. 1998.
15. Y. A. Liu, S. D. Stoller, and T. Teitelbaum. Static caching for incremental computation. ACM Trans. Program. Lang. Syst., 20(3), May 1998.
16. Y. A. Liu and T. Teitelbaum. Systematic derivation of incremental programs. Sci. Comput. Program., 24(1):1-39, Feb. 1995.
17. T. Lundqvist and P. StenstrSm. Integrating path and timing analysis using instruction-level simulation techniques. Technical Report No. 98-3, Department of Computer Engineering, Chalmers University of Technology, GSteborg, Sweden, 1998.
18. C. Y. Park. Predicting program execution times by analyzing static and dynamic program paths. Real-Time Systems, 5:31-62, 1993.
19. C. Y. Park and A. C. Shaw. Experiments with a program timing tool based on source-level timing schema. IEEE Computer, 24(5):48-57, 1991.
20. M. Rosendahl. Automatic complexity analysis. In Proceedings of the 4th International Conference on Functional Programming Languages and Computer Architecture, pages 144-156. ACM, New York, Sept. 1989.
21. R. H. Saavedra and A. J. Smith. Analysis of benchmark characterization and benchmark performance prediction. ACM Transactions on Computer Systems, 14(4):344-384, Nov. 1996.
22. D. Sands. Complexity analysis for a lazy higher-order language. In Proceedings of the 3rd European Symposium on Programming, volume 432 of Lecture Notes in Computer Science, pages 361-376. Springer-Verlag, Berlin, May 1990.
23. A. Shaw. Reasoning about time in higher level language software. IEEE Trans. Solw. Eng., 15(7):875-889, July 1989.
24. th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, Jan. 1988.
25. B. Wegbreit. Mechanical program analysis. Commun. ACM, 18(9):528-538, Sept. 1975.
26. D. Weise, R. F. Crew, M. Ernst, and B. Steensgaard. Value dependence graphs: Representation without taxation. In Conference Record of the $1st Annual ACM Symposium on Principles of Programming Languages. ACM, New York, Jan. 1994.