Toward a constraint-satisfaction framework for evaluating program-understanding algorithms
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Different program understanding algorithms often use different representational frameworks and take advantage of numerous heuristic tricks. This situation makes it difficult to compare these approaches and their performance. The paper addresses this problem by proposing constraint satisfaction as a general framework for describing program understanding algorithms, demonstrating how to transform a relatively complex existing program understanding algorithm into an instance of a constraint satisfaction problem, and showing how this facilitates better understanding of its performance.Keywords
This publication has 18 references indexed in Scilit:
- A hybrid approach to recognizing programming plansPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Program understanding as constraint satisfactionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Program comprehension during software maintenance and evolutionComputer, 1995
- A memory-based approach to recognizing programming plansCommunications of the ACM, 1994
- HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEMComputational Intelligence, 1993
- Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problemsArtificial Intelligence, 1992
- Automated Program Recognition by Graph ParsingPublished by Defense Technical Information Center (DTIC) ,1992
- A polynomial time algorithm for the N-Queens problemACM SIGART Bulletin, 1990
- Automated program recognitionArtificial Intelligence, 1990
- Constraint satisfaction algorithms1Computational Intelligence, 1989