Validation of code-improving transformations for embedded systems

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2003, Pages 684-691

  Van Engelen, Robert ^a   Whalley, David ^a   Yuan, Xin ^a  

^a Florida State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; CONSTRAINT THEORY; MATHEMATICAL TRANSFORMATIONS; PROGRAM COMPILERS; ROBOT PROGRAMMING; SEMANTICS;

ASSEMBLY CODES;

EMBEDDED SYSTEMS;

EID: 0037998934     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. O. Bachmann, P.S. Wang, and E.V. Zima. Chains of recurrences - a method to expedite the evaluation of closed -form functions. In International Symposium on Symbolic and Algebraic Computing, pages 242-249, Oxford, 1994. ACM.
2. M. E. Benitez and J. W. Davidson. A Portable Global Optimizer and Linker. In Proceedings of the SIGPLAN '88 Symposium on Programming Language Design and Implementation, pages 329-338, June 1988.
3. th European Symposium on Programming (ESOP'96), LNCS 1058, Linköping, Sweden, April 1996. Springer.
4. A. Cimatti and et. al. A Provably Correct Embedded Verifier for the Certification of Safety Critical Software. In International Conference on Computer Aided Verification, pages 202-213, June 1997.
5. P. Dybjer. Using Domain Algebras to Prove the Correctness of a Compiler. Lecture Notes in Computer Science, 182:329-338, 1986.
6. J. Guttman, J. Ramsdell, and M. Wand. VLISP: a Verified Implementation of Scheme. Lisp and Symbolic Computation, 8:5-32, 1995.
7. S. Horwitz. Identifying the Semantic and Textual Differences between Two Versions of a Program. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 234-245, 1990.
8. J. Moore. A Mechanically Verified Language Implementation. Journal of Automated Reasoning, 5:461-492, 1989.
9. F. Morris. Advice on Structuring Compilers and Proving Them Correct. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 144-152, 1973.
10. G. Necula. Proof-Carrying Code. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 106-119, January 1997.
11. G. Necula and P. Lee. The Design and Implementation of a Certifying Compiler. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 333-344, 1998.
12. G. C. Necula. Translation Validation for an Optimizing Compiler. In Proceedings of the SIGPLAN '00 Symposium on Programming Language Design and Implementation, pages 83-94, June 2000.
13. M. Rinard and D. Marinov. Credible Compilation with Pointers. In Proceedings of the FLoC Workshop on Run-Time Result Verfication, 1999.
14. D. Tarditi, J. Morrisett, P. Cheng, C. Stone, R. Harper, and P. Lee. TIL: A Type-Directed Optimizing Compiler for ML. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 181-192, 1996.
15. J. Thatcher, E. Wagner, and J. Wright. More on Advice on Structuring Compilers and Proving Them Correct. In Proceedings of a Workshop on Semantics-Directed Compiler Generation, pages 165-188, 1994.
16. R. van Engelen, L. Walters, and G. Cats. Ctadel: A generator of multi-platform high performance codes for pde-based scientific applications. In Proceedings of the 10th ACM International Conference on Supercomputing, pages 86-93, May 1996.
17. R.A. van Engelen. Symbolic evaluation of chains of recurrences for loop optimization. Technical report, TR-000102, Computer Science Deptartment, Florida State University, 2000.
18. R.A. van Engelen, David Whalley, and Xin Yuan. Automatic validation of code-improving transformations. Technical report, TR-000601, Computer Science Deptartment, Florida State University, 2000.
19. M. Weiser. Program Slicing. IEEE Transactions on Software Engineering, 10(4):352-357, July 1984.
20. J. Wielemaker, SWI-Prolog Reference Manual. University of Amsterdam, 1995. Available by anonymous ftp from swi.psy.uva.nl.