Verification of source code transformations by program equivalence checking

Lecture Notes in Computer Science

Volumn 3443, Issue , 2005, Pages 221-236

  Shashidhar, K C ^a,b   Bruynooghe, Maurice ^b   Catthoor, Francky ^a,b   Janssens, Gerda ^b  

^a IMEC   (Belgium)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER PROGRAMMING; DATA PROCESSING; EMBEDDED SYSTEMS; PROBLEM SOLVING;

ARRAY VARIABLES; CODE TRANSFORMATIONS; SOURCE CODE; VERIFICATION PROBLEMS;

DIGITAL SIGNAL PROCESSING;

EID: 24644471061     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31985-6_15     Document Type: Conference Paper

References (17)

1. J. R. Allen, K. Kennedy, C. Porterfield, and J. D. Warren. Conversion of control dependence to data dependence. In POPL, pp. 177-189. ACM, 1983.
2. R. Allen and K. Kennedy. Optimizing Compilers for Modern Architectures. Morgan Kaufmann Publishers, 2001.
3. U. Banerjee. Dependence Analysis for Supercomputing. Kluwer Publishers, 1988.
4. D. Barthou, P. Feautrier, and X. Redon. On the equivalence of two systems of affine recurrence equations. In 8th Euro-Par, pp. 309-313. Springer, 2002.
5. F. Catthoor, S. Wuytack, E. de Greef, F. Balasa, L. Nachtergaele, and A. Vandecappelle. Custom Memory Management Methodology: Exploration of Memory Organization for Embedded Multimedia System Design. Kluwer Publishers, 1998.
6. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, 1991.
7. P. Feautrier. Array expansion. In ICS, pp 429-441. ACM, 1988.
8. B. Goldberg, L. Zuck, and C. Barrett. Into the loops: Practical issues in translation validation for optimizing compilers. In International Workshop on Compiler Optimization Meets Compiler Verification, ENTCS. Elsevier, 2004.
9. W. Kelly, W. Pugh, E. Rosser, and T. Shpeisman. Transitive closure of infinite graphs and its applications. Intl. Journ. of Parallel Prog., 24(6):579-598, 1996.
10. N. Mateev, V. Menon, and K. Pingali. Fractal symbolic analysis. A CM Transactions on Programming Languages and Systems, 25(6):776-813, 2003.
11. G. C. Necula. Translation validation for an optimizing compiler. In SIGPLAN Programming Language Design and Implementation, pp. 83-95. ACM, 2000.
12. W. Pugh. A practical algorithm for exact array dependence analysis. Communications of the ACM, 35(8):102-114, 1992.
13. K. C. Shashidhar, M. Bruynooghe, F. Catthoor, and G. Janssens. Functional equivalence checking for verification of algebraic transformations on array-intensive source code. In Design, Automation and Test in Europe. IEEE, 2005.
14. K. C. Shashidhar, M. Bruynooghe, F. Catthoor, and G. Janssens. Automatic Verification of Source Code Transformations on Array-Intensive Programs: Demonstration with Real-life Examples. Tech. Rep. CW 401, Dept. of Computer Science, Katholieke Universiteit Leuven, Belgium, 2005.
15. R. A. van Engelen and K. A. Gallivan. An efficient algorithm for pointer-to-array access conversion for compiling and optimizing DSP applications. In International Workshop on Innovative Architectures for Future Generation High-Performance Processors and Systems, pp. 80-89. IEEE, 2001.
16. P. Vanbroekhoven, G. Janssens, M. Bruynooghe, H. Corporaal, and F. Catthoor. A step towards a scalable dynamic single assignment conversion. Tech. Rep. CW 360, Dept. of Computer Science, Katholieke Universiteit Leuven, Belgium, 2003.
17. M. Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley Publishing Company, 1996.