Techniques for automatic program recognition, at the algorithmic level, could be of great interest in the area of program parallelization, because the selection of suitable parallelization strategies is driven by algorithmic features of the code. A technique for the specification and automatic recognition of algorithmic concepts is presented. Its flexibility and expressivity power for specifying 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 the 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
Published in:
Software Engineering for Parallel and Distributed Systems, 1997. Proceedings., Second International Workshop on
Date of Conference: 17-18 May 1997