• Home
  • Search
  • An Equivalence Checking Framework for Array-Intensive Programs
  • https://doi.org/10.1007/978-3-319-68167-2_6Copy DOI Icon

An Equivalence Checking Framework for Array-Intensive Programs

  • Jan 1, 2017
  • Kunal Banerjee +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

Array-intensive programs often undergo extensive loop transformations and arithmetic transformations during code optimization. Accordingly, translation validation of array-intensive programs requires manipulation of intervals of integers (representing domains of array indices) and relations over such intervals to account for loop transformations and simplification of arithmetic expressions to handle arithmetic transformations. Translation validation becomes more challenging in the presence of recurrences because recurrences lead to cycles in the data-dependence graph of a program which make dependence analyses and simplifications (through closed-form representations) of the data transformations difficult. To address the problem of translation validation of array-intensive programs, we have developed an equivalence checking framework, where both the original program and the optimized program are modeled as array data-dependence graphs (ADDGs), that can handle loop and arithmetic transformations along with most of the recurrences.

Similar Papers
  • Conference Article
  • Citations3

Translation validation of loop and arithmetic transformations in the presence of recurrences

  • Jun 13, 2016
  • Kunal Banerjee +2
  • Research Article
  • Citations1

Translation validation of loop and arithmetic transformations in the presence of recurrences

  • Jun 13, 2016
  • ACM SIGPLAN Notices
  • Kunal Banerjee +2
  • Research Article
  • Citations24

Verification of Loop and Arithmetic Transformations of Array-Intensive Behaviors

  • Nov 01, 2013
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • Chandan Karfa +3
  • Front Matter

Preface: Volume 65, Issue 2

  • Apr 01, 2002
  • Electronic Notes in Theoretical Computer Science
  • Jens Knoop +1
  • Front Matter
  • Citations1

Parallelization techniques for numerical modelling

  • Jul 01, 1999
  • Parallel Computing
  • Götz Alefeld +2
  • Research Article
  • Citations7

Enhanced applicability of loop transformations

  • Jan 01, 2007
  • Data Archiving and Networked Services (DANS)
  • Martin Palkovič
  • Conference Article
  • Citations22

Global memory optimisation for embedded systems allowed by code duplication

  • Jan 01, 2005
  • Martin Palkovic +2
  • Conference Article
  • Citations3

Code optimization of parallel programs

  • Apr 06, 2008
  • Vivek Sarkar
  • Book Chapter
  • Citations7

Challenges in Code Optimization of Parallel Programs

  • Jan 01, 2009
  • Vivek Sarkar
  • Research Article
  • Citations8

Validating More Loop Optimizations

  • Nov 25, 2005
  • Electronic Notes in Theoretical Computer Science
  • Ying Hu +3
  • Conference Article
  • Citations6

Experimentation with SMT solvers and theorem provers for verification of loop and arithmetic transformations

  • Oct 17, 2013
  • Chandan Karfa +3
  • Conference Article
  • Citations4

A translation validation framework for symbolic value propagation based equivalence checking of FSMDAs

  • Sep 01, 2015
  • Kunal Banerjee +2
  • Research Article
  • Citations53

Predictive Modeling in a Polyhedral Optimization Space

  • Feb 21, 2013
  • International Journal of Parallel Programming
  • Eunjung Park +5
  • Research Article
  • Citations23

A SIMD optimization framework for retargetable compilers

  • Mar 30, 2009
  • ACM Transactions on Architecture and Code Optimization
  • Manuel Hohenauer +4
  • Dissertation

Performance improvement of CMS simulation via loop transformation

  • Jan 01, 2021
  • Teerit Ploensin
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.