Context-sensitive domain-independent algorithm composition and selection
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
| Hi-index | 0.00 |
Techniques for automatic program recognition, at the algorithmic level, could be of high interest for the area of Program Parallelization, because the selection of suitable parallelization strategies is driven by algorithmic features of code. In this paper a technique for the specification and automatic recognition of algorithmic concepts is presented. Its flexibility and expressivity power to specify the hierarchy, the constraints and the relationships among concepts allow it to deal with recognition of algorithmic concepts within optimized code, Irregular computations, and in presence of code sharing, delocalization, implementation variations and other problems related to program recognition in the context of the imperative languages typically used for scientific computation.