Verification of source code transformations by program equivalence checking

Authors:
K. C. Shashidhar;Maurice Bruynooghe;Francky Catthoor;Gerda Janssens
Affiliations:
Interuniversitair Micro-Elektronica Centrum (IMEC) vzw, Leuven, Belgium;Departement Computerwetenschappen, Katholieke Universiteit Leuven, Belgium;Interuniversitair Micro-Elektronica Centrum (IMEC) vzw, Leuven, Belgium;Departement Computerwetenschappen, Katholieke Universiteit Leuven, Belgium
Venue:
CC'05 Proceedings of the 14th international conference on Compiler Construction
Year:
2005

Citing 14
Cited 6

Array expansion

ICS '88 Proceedings of the 2nd international conference on Supercomputing
Efficiently computing static single assignment form and the control dependence graph

ACM Transactions on Programming Languages and Systems (TOPLAS)
A practical algorithm for exact array dependence analysis

Communications of the ACM
Transitive closure of infinite graphs and its applications

International Journal of Parallel Programming - Special issue: selected papers from the eighth international workshop on languages and compilers for parallel computing
Translation validation for an optimizing compiler

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Optimizing compilers for modern architectures: a dependence-based approach

Optimizing compilers for modern architectures: a dependence-based approach
Dependence Analysis for Supercomputing

Dependence Analysis for Supercomputing
Custom Memory Management Methodology: Exploration of Memory Organisation for Embedded Multimedia System Design

Custom Memory Management Methodology: Exploration of Memory Organisation for Embedded Multimedia System Design
Conversion of control dependence to data dependence

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
High Performance Compilers for Parallel Computing

High Performance Compilers for Parallel Computing
On the Equivalence of Two Systems of Affine Recurrence Equations (Research Note)

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
An Efficient Algorithm for Pointer-to-Array Access Conversion for Compiling and Optimizing DSP Applications

IWIA '01 Proceedings of the Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'01)
Fractal symbolic analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source Code

Proceedings of the conference on Design, Automation and Test in Europe - Volume 2

A practical dynamic single assignment transformation

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Experience with Widening Based Equivalence Checking in Realistic Multimedia Systems

Journal of Electronic Testing: Theory and Applications
Transformation to dynamic single assignment using a simple data flow analysis

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Equivalence checking of static affine programs using widening to handle recurrences

ACM Transactions on Programming Languages and Systems (TOPLAS)
Data-driven equivalence checking

Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Typically, a combination of manual and automated transformations is applied when algorithms for digital signal processing are adapted for energy and performance-efficient embedded systems. This poses severe verification problems. Verification becomes easier after converting the code into dynamic single-assignment form (DSA). This paper describes a method to prove equivalence between two programs in DSA where subscripts to array variables and loop bounds are (piecewise) affine expressions. For such programs, geometric modeling can be used and it can be shown, for groups of elements at once, that the outputs in both programs are the same function of the inputs.