Program plan matching: Experiments with a constraint-based approach

Science of Computer Programming

Volumn 36, Issue 2, 2000, Pages 285-302

  Quilici, Alex ^a   Woods, Steven ^b   Zhang, Yongjun ^a  

^a University of Hawaii at Manoa   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; PROGRAM DEBUGGING;

PROGRAM PLAN MATCHING;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0033904596     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(99)00039-8     Document Type: Article

References (20)

1. Chin D., Quilici A. DECODE. a cooperative program understanding environment J. Software Maint. 8(1):1996;3-34.
2. van Deursen A., Quilici A., Woods S. Program plan recognition for year 2000 tools. Science Computer Programming. 36:2000;303-324.
3. Hartman J. Automatic control understanding for natural programs, Research Report UT-AI-TR-91-161. 1991;University of Texas at Austin.
4. J. Hartman, Understanding natural programs using proper decomposition, in Proceedings of the International Conference on Software Engineering, Austin TX, 1991, pp. 62-73.
5. J. Hartman, Technical introduction to the first workshop on AI and automated program understanding, in Workshop Notes, AAAI Workshop on AI and Automated Program Understanding, Tenth National Conference on Artificial Intelligence, 1992.
6. Johnson W.L. Intention Based Diagnosis of Novice Programming Errors. 1986;Morgan Kaufman, Los Altos, CA.
7. W. Kozaczynski, J.Q. Ning, Automated program understanding by concept recognition, Automat. Software Eng. 1, 61-78.
8. P. Newcomb, L. Markosian, Automating the modularization of large cobol programs: applications of an enabling technology for reengineering, in Proceedings of the Working Conference on Reverse Engineering, 1993, pp. 222-230.
9. Quilici A. A memory-based approach to recognizing programming plans. Commun. ACM. 37(5):1994;84-93.
10. A. Quilici, S. Woods, Toward a Constraint-satisfaction framework for evaluating program understanding algorithms, J. Automat. Software Eng. 4 (3) (1997).
11. Quilici A., Woods S. Applying plan recognition algorithms to program understanding. J. Automat Software Eng. 5(3):1998;347-372.
12. E. Tsang, Foundations Of Constraint Satisfaction, Academic Press Limited, 24-28 Oval Road, London England, NW1 7DX, 1993.
13. B. Weide, Why program understanding is intractable, in Proceedings of the 17th International Conference on Software Engineering, Seattle, WA, 1995.
14. Wills L.M. Automated program recognition: a feasibility demonstration, artificial intelligence. 45(2):1990;113-172.
15. Wills L.M. Automated program recognition by graph parsing, Ph.D. Thesis. July 1992;MIT.
16. Woods S. A method of program understanding using constraint satisfaction for software reverse engineering, Ph.D. Thesis. July 1996;University of Waterloo.
17. S. Woods, A. Quilici, Some experiments toward understanding how program plan recognition algorithms scale, in Proceedings of the Third Working Conference on Reverse Engineering (WCRE), Monterey, CA, November 1996.
18. S. Woods, Q. Yang, Approaching the program understanding problem: analysis and a heuristic solution, in Proceedings of the 18th International Conference on Software Engineering, Berlin, Germany, 1996.
19. S. Woods, Q. Yang, Program understanding as constraint satisfaction: representation and reasoning techniques, J. Automat. Software Eng. 1997, to appear.
20. Y. Zhang, Scalability experiments in applying constraint-based program understanding algorithms to real-world programs, Masters Thesis, Department of Electrical Engineering, University of Hawaii at Manoa, Honolulu, Hawaii.