Specification and Automatic Recognition of Algorithmic Concepts within Programs
Beniamino Di Martino · 1997
In this paper a formalism for the specification of algorithmic concepts recognition is presented. It is coupled to an automated hierarchical concept parsing recognition technique. It allows for a successful handling of the languages and the kind of codes, algorithms and optimizations connected to scientific and high performance computing. Its flexibility and expressivity power for the specification of the hierarchy, the constraints and the relationships among concepts is exemplified through a case study. 1 Introduction The problem of assigning concepts to code does not seem to be automatically solvable in its general form [2], because the concepts oriented to human domains are inherently ambiguous, and their recognition heavily relies on a priori knowledge on the particular domain. Nevertheless, if the recognition is limited to the algorithmic level, the task seems to be manageable. The winning strategy [16, 8] is to structure the recognition process as an increasingly abstraction pro...