Some experiments toward understanding how program plan recognition algorithms scale
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Over the past decade, researchers in program understanding have formulated many program understanding algorithms but have published few studies of their relative scalability. Consequently, it is difficult to understand the relative limitations of these algorithms and to determine whether the field of program understanding is making progress. The paper attempts to address this deficiency by formalizing the search strategies of several different program understanding algorithms as constraint satisfaction problems, and by presenting some preliminary empirical scalability results for these constraint-based implementations. These initial results suggest that, at least under certain conditions, constraint-based program understanding is close to being applicable to real-world programs.Keywords
This publication has 20 references indexed in Scilit:
- Solving Part-Type Selection and Operation Allocation Problems in an FMS: An Approach Using Constraints-Based Fast Simulated Annealing AlgorithmIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 2006
- Automating the modularization of large COBOL programs: application of an enabling technology for reengineeringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Applying plan recognition algorithms to program understandingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Toward a constraint-satisfaction framework for evaluating program-understanding algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A theoretical evaluation of selected backtracking algorithmsArtificial Intelligence, 1997
- A memory-based approach to recognizing programming plansCommunications of the ACM, 1994
- Automated program understanding by concept recognitionAutomated Software Engineering, 1994
- HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEMComputational Intelligence, 1993
- Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problemsArtificial Intelligence, 1992
- Constraint satisfaction algorithms1Computational Intelligence, 1989