Abstract
Techniques for automatic program recognition, at the algorithmic level, could be of high interest for the area of Software Maintenance, in particular for knowledge based reengineering, because the selection of suitable restructuring strategies is mainly driven by algorithmic features of the code. In this paper a formalism for the specification of algorithmic concepts, based on an automated hierarchical concept parsing recognition technique, is presented. Based on this technique is the design and development of ALCOR, a production rule based system for automatic recognition of algorithmic concepts within programs, aimed at support of knowledge based reengineering for high performance.
This work has been supported by the CNR - Consiglio Nazionale delle Ricerche, Italy (Agenzia 2000 Project ALCOR - n. CNRG00A41A), and by the Campania Reg. government (Projects “L41/96 Smart ISDN” and “Regional Competence Center on Information and Communication Technologies”).
Chapter PDF
References
T.J. Biggerstaff, “The Concept Assignment Problem in Program Understanding”, Procs. IEEE Working Conf. on Reverse Engineering, May 21–23, Baltimore, Maryland, USA, 1993.
B. Di Martino, “ALCOR-an ALgorithmic COncept Recognition tool to support High Level Parallel Program Development”, in: J. Fagerholm, J. Haataja, J. Jrvinen, M. Lyly, P. Rback, V. Savolainen (Eds.): Applied Parallel Computing. Advanced Scientific Computing, Lecture Notes in Computer Science, n. 2367, pp. 150–159, Springer-Verlag, 2002.
A. Bonifacio, B. Di Martino “Algorithmic Concept Recognition support for Skeleton Based Parallel Programming”, Proc. of Int. Workshop on High-Level Parallel Programming Models and Supportive Environments (HIPS’03)-Nice (FR), 22-26/4 2003, Apr. 2003. IEEE CS Press.
J. Ferrante, K.J. Ottenstein and J.D. Warren, “The Program Dependence Graph and its use in Optimization”, ACM Trans. Programming Languages and Systems, 9(3), pp. 319–349, June 1987.
J. Grosh and H. Emmelmann, “A Tool Box for Compiler Construction”, Lecture Notes in Computer Science, Springer-Verlag, n. 477, pp. 106–116, Oct. 1990.
“Puma-A Generator for the Transformation of Attributed Trees”, Compiler Generation Report n. 26, GMD Karlsruhe, July 1991.
M.T. Harandi and J.Q. Ning, “Knowledge-Based Program Analysis”, IEEE Software, pp. 74–81, Jan. 1990.
D. E. Knuth, “Semantics of context-free languages”, Math. Syst. Theory, 2(2) pp. 127–145, 1968.
W. Pugh, “A practical algorithm for Exact Array Dependence Analysis”, Communications of ACM, 8(35), pp. 102–115, Aug. 1992.
H. Vogt, S. Swiestra and M. Kuiper, “Higher Order Attribute Grammars”, Proc. of ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 131–145, June 1989.
L.M. Wills, “Automated Program Recognition: a Feasibility Demonstration”, Artificial Intelligence, 45, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Martino, B., Bonifacio, A. (2003). Specification and Automated Recognition of Algorithmic Concepts with ALCOR. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J.J., Zomaya, A.Y. (eds) Computational Science — ICCS 2003. ICCS 2003. Lecture Notes in Computer Science, vol 2658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44862-4_81
Download citation
DOI: https://doi.org/10.1007/3-540-44862-4_81
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40195-7
Online ISBN: 978-3-540-44862-4
eBook Packages: Springer Book Archive