Toward A Constraint-Satisfaction Frameworkfor Evaluating Program-Understanding Algorithms

Authors:
Alex Quilici;Steven Woods
Affiliations:
Department of Electrical Engineering, University of Hawaii at Manoa, 2540 Dole St, Holmes 483, Honolulu, HI 96822/ E-mail: alex&commat/wiliki.eng.hawaii.edu;Department of Electrical Engineering, University of Hawaii at Manoa, 2540 Dole St., Holmes 483, Honolulu, HI 96822/ E-mail: sgwoods&commat/spectra.eng.hawaii.edu
Venue:
Automated Software Engineering
Year:
1997

Citing 17
Cited 2

Intention-based diagnosis of errors in novice programs

Intention-based diagnosis of errors in novice programs
Constraint satisfaction algorithms

Computational Intelligence
A polynomial time algorithm for the N-Queens problem

ACM SIGART Bulletin
Automated program recognition: a feasibility demonstration

Artificial Intelligence
From local to global consistency

Artificial Intelligence
Algorithms for constraint-satisfaction problems: a survey

AI Magazine
Partial constraint satisfaction

Artificial Intelligence - Special volume on constraint-based reasoning
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems

Artificial Intelligence - Special volume on constraint-based reasoning
Program Concept Recognition and Transformation

IEEE Transactions on Software Engineering - Special issue on software maintenance
Automated program recognition by graph parsing

Automated program recognition by graph parsing
A memory-based approach to recognizing programming plans

Communications of the ACM
The program understanding problem: analysis and a heuristic approach

Proceedings of the 18th international conference on Software engineering
DECODE: a co-operative program understanding environment

Journal of Software Maintenance: Research and Practice
Understanding natural programs using proper decomposition

ICSE '91 Proceedings of the 13th international conference on Software engineering
Program Comprehension During Software Maintenance and Evolution

Computer
Program Understanding as Constraint Satisfaction

CASE '95 Proceedings of the Seventh International Workshop on Computer-Aided Software Engineering
A theoretical evaluation of selected backtracking algorithms

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques

Automated Software Engineering
Applying Plan Recognition Algorithms To Program Understanding

Automated Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Different program understanding algorithms often use different representational frameworks and takeadvantage of numerous heuristic tricks. This situation makes it is difficult to compare theseapproaches and their performance. This paper addresses this problem byproposing constraint satisfaction as a general framework fordescribing program understanding algorithms, demonstrating how to tranform a complex existing program understanding algorithm intoan instance of a constraint satisfaction problem, and showing how facilitates better understanding of its performance.