Toward a Constraint-Satisfaction Framework for
Evaluating Program-Understanding Algorithms
Steven Woods and
Alex Quilici.
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. This
paper addresses this problem by proposing constraint satisfaction as a general
framework for describing program understanding algorithms, demonstrating how to
transform a complex existing program understanding algorithm into an instance
of a constraint satisfaction problem, and showing this facillitates better
understanding of its performance.
Copyright Notice
Copyright 1996 Kluwer Academic Publishers. Published in the Journal
of Automated Software Engineering.
Personal use of this material is permitted. However, permission to
reprint/republish this material for advertising or promotional purposes or for
creating new collective works for resale or redistribution to servers or lists,
or to reuse any copyrighted component of this work in other works, must be
obtained from Kluwer.
The Paper (20 pages)