Verification of Polyhedral Optimizations with Constant Loop Bounds in Finite State Space Computations
Authors:
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 493-508
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Verification of Loop and Arithmetic Transformations of Array-Intensive BehaviorsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2013
- When polyhedral transformations meet SIMD code generation2013
- Polyhedral-based data reuse optimization for configurable computing2013
- Equivalence checking of static affine programs using widening to handle recurrencesACM Transactions on Programming Languages and Systems, 2012
- High-performance code generation for stencil computations on GPU architectures2012
- Loop transformationsACM SIGPLAN Notices, 2011
- Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory HierarchiesInternational Journal of Parallel Programming, 2006
- Some efficient solutions to the affine scheduling problem. Part II. Multidimensional timeInternational Journal of Parallel Programming, 1992
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991
- Supernode partitioning1988