Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques

Automated Software Engineering

Volumn 5, Issue 2, 1998, Pages 147-181

  Woods, Steven ^a   Yang, Qiang ^b  

^a University of Hawaii at Manoa   (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC PROGRAMMING; HIGH LEVEL LANGUAGES; SOFTWARE ENGINEERING;

LEGACY CODE; PROGRAM UNDERSTANDING; REVERSE ENGINEERING; SOFTWARE REUSE; SOURCE CODE;

CONSTRAINT THEORY;

EID: 0032051308     PISSN: 09288910     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008655230736     Document Type: Article

References (51)

1. Carberry, S. 1988. Modeling the user's plans and goals. Computational Linguistics, 14(3):23-37.
2. Carberry, S. 1990. Incorporating default inferences into plan recognition. Proc. of the 8th AAAI, vol. 1, pp. 471-478.
3. Cooper, M.C. 1989. An optimal k-consistency algorithm. Artificial Intelligence, 41:89-95.
4. Freuder, E.C. 1982. A sufficient condition of backtrack-free search. Journal of the ACM, 29(1):23-32.
5. Haralick, R.M. and Elliott, G.L. 1980. Increasing tree-search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263-313.
6. Holte, R., Mkadmi, T., Zimmer, R., and MacDonald, A. 1995. Speeding up problem-solving by abstraction: A graph-oriented approach. Technical report TR-95-07, University of Ottawa.
7. Kautz, H. and Allen, J. 1986. Generalized plan recognition. Proc. of the Fifth National Conference on Artificial Intelligence, Philadelphia, Pennsylvania, pp. 32-37.
8. Kazman, R. and Burth, M. 1997. Assessing architectural complexity. URL: http://www.cgl.uwaterloo. ca/~rnkazman/assessing.ps.
9. Kontogiannis, K., DeMori, R., Bernstein, R., and Merlo, M. 1994. Localization of design concepts in legacy systems. Proc. of the Int. Conf. on Software Maintenance, pp. 414-423.
10. Kontogiannis, K., Galler, M., and DeMori, R. 1995. Detecting code similarity using patterns. Working Notes of the Third Workshop on AI and Software Engineering: Breaking the Toy Mold (AISE), pp. 68-73.
11. Kozaczynski, W. and Ning, J.Q. 1994. Automated program understanding by concept recognition. Automated Software Engineering, 1:61-78.
12. Kumar, V. 1992. Algorithms for constraint-satisfaction problems. AI Magazine, pp. 32-44.
13. Mackworth, A.K. 1977. Consistency in networks of relations. Artificial Intelligence, 8:99-118.
14. Mackworth, A., Mulder, J., and Havens, W. 1985. Hierarchial arc consistency: Exploiting structured domains in constraint satisfaction problems. Computational Intelligence, 1:188-126.
15. Minton, S. 1990. Quantitative results concerning the utility of explanation-based learning. Artificial Intelligence, 42:363-391.
16. Mohr, R. and Henderson, T.C. 1986. Arc and path consistency revisited. Artificial Intelligence, 28:225-233.
17. Müller, H., Tilley, M., Orgun, M.A., Corrie, B., and Madhavji, N. 1992. A reverse engineering environment based on spatial and visual software interconnection modules. Proc. of the Fifth ACM SIGSOFT Symp. on Software Development Environments (SIGSOFT '92), ACM Software Engineering Notes, pp. 88-98.
18. Müller, H., Orgun, M.A., Tilley, S.R., and Uhl, J.S. 1993. A reverse engineering approach to subsytem structure identification. Journal of Software Maintenance, 5(4):181-204.
19. Müller, H., Wong, K., and Tilley, S.R. 1994. Understanding software systems using reverse engineering technology. Proc. of the Colloquini on Object Orientation in Databases and Software Engineering, pp. 88-98.
20. Nadel, B.A. 1989. Constraint satisfaction algorithms. Computational Intelligence, 5:188-224.
21. Newcomb, P. and Markosian, L. 1993. Automating the modularization of large COBOL programs: Application of an enabling technology for re-engineering. Proc. of the Working Conf. on Reverse Engineering, pp. 222-230.
22. Quilici, A. 1994. A memory-based approach to recognizing programming plans. Communications of the ACM, 37(5):84-93.
23. Quilici, A. 1995. Toward practical automated program understanding. Working Notes of the Third Workshop on AI and Software Engineering: Breaking the Toy Mold (AISE-95), In conjunction with the Fourteenth Int'l Joint Conference on Artificial Intelligence.
24. Quilici, A. and Chin, D. 1994. A cooperative program understanding environment. Proc. of the Ninth Knowledge-Based Software Engineering Conf., Monterey, CA, pp. 125-132.
25. Quilici, A. and Chin, D. 1995. DECODE: A cooperative environment for reverse-engineering legacy software. Proc. of the Second Working Conf. on Reverse-Engineering, pp. 156-165. IEEE Computer Society Press.
26. Quilici, A. and Woods, S. 1997. Toward a constraint-satisfaction framework for evaluating program-understanding algorithms. Journal of Automated Software Engineering, 3(4):271-289.
27. Quilici, A., Woods, S., and Zhang, Y. 1997a. Some new experiements in program plan recognition. Proc. of the Fourth Working Conf. on Reverse-Engineering. IEEE Computer Society Press.
28. Quilici, A., Yang, Q., and Woods, S. 1997b. Applying plan recognition algorithms to program understanding. URL: http://spectra.eng.hawaii.edu/~sgwoods/Sub/AuSE-prpu-paper.html, submitted for publication.
29. Rich, C. and Waters, R.C. 1988. The programmer's apprentice: A research overview. IEEE Comput., 21(11):10-25.
30. Rich, C. and Waters, R.C. 1990. The Programmer's Apprentice. Addison-Wesley: Reading, MA.
31. Rugaber, S., Stirewalt, K., and Wills, L. 1995. The interleaving problem in program understanding. Proc. of the Second Working Conf. on Reverse-Engineering, 10662 Los Vaqueros Circle, Los Alamitos CA 90720-1264, IEEE Computer Society Press, pp. 166-175.
32. Tsang, E. 1993. Foundations of Constraint Satisfaction. 24-28 Oval Road, London England, NW1 7DX: Academic Press Limited.
33. van Beek, P., Cohen, R., and Schmidt, K. 1993. From plan critiquing to clarification dialogue for cooperative response generation. Computational Intelligence, 9(3).
34. van Deursen, A., Woods, S., and Quilici, A. 1997. Program plan recognition for year 2000 tools. Proc. of the Fourth Working Conf. on Reverse-Engineering. IEEE Computer Society Press.
35. Van Hentenryck, P., Deville, Y., and Teng, C.-M. 1992. A generic arc-consistency algorithm and its specializations. Artificial Intelligence, 57:291-321.
36. Wills, L.M. 1990. Automated program recognition: A feasibility demonstration. Artificial Intelligence, 45(2):113-172.
37. Wills, L.M. 1992. Automated Program Recognition by Graph Parsing. Ph.D. thesis, MIT.
38. Woods, S. 1993. A method of interactive recognition of spatially defined model deployment templates using abstraction. Proc. of the Knowledge Based Systems and Robotics Workshop, Government of Canada, pp. 665-675.
39. Woods, S. 1996. A Method of Program Understanding, Using Constraint Satisfaction for Software Reverse Engineering. Ph.D. thesis, University of Waterloo.
40. Woods, S., Quilici, A., and Yang, Q. 1995. Program understanding: A constraint satisfaction modeling framework; understanding as plan recognition. Technical Report CS 95-52, University of Waterloo, Department of Computer Science.
41. Woods, S. and Yang, Q. 1995a. Constraint-based plan recognition in legacy code. Working Notes of the Third Workshop on AI and Software Engineering: Breaking the Toy Mold (AISE).
42. Woods, S. and Yang, Q. 1995b. Program understanding as constraint satisfaction. Proc. of the IEEE Seventh Int. Workshop on Computer-Aided Software Engineering (CASE), IEEE Computer Society Press, pp. 318-327. Also appears in the Proc. of the 1995 Second Working Conf. on Reverse Engineering (WCRE).
43. Woods, S. and Yang, Q. 1995b. Program understanding as constraint satisfaction. Proc. of the IEEE Seventh Int. Workshop on Computer-Aided Software Engineering (CASE), IEEE Computer Society Press, pp. 318-327. Also appears in the Proc. of the 1995 Second Working Conf. on Reverse Engineering (WCRE).
44. Woods, S. and Quilici, A. 1996a. A constraint-satisfaction framework for evaluating program-understanding algorithms. Proc. of the 4th IEEE Workshop on Program Comprehension (WPC-96), Berlin, Germany.
45. Woods, S. and Quilici, A. 1996b. Some experiments toward understanding how program plan recognition algorithms scale. Proc. of the Third Working Conf. on Reverse-Engineering.
46. Woods, S. and Yang, Q. 1996a. Approaching the program understanding problem: Analysis and a heuristic solution. Proc. of the 18th Int. Conf. on Software Engineering, IEEE Computer Society Press, Berlin, Germany.
47. Woods, S. and Yang, Q. 1996b. Approaching the program understanding problem: Analysis and a heuristic solution. Proc. of the 18th Int. Conf. on Software Engineering, IEEE Computer Society Press, Berlin, Germany.
48. Woods, S., Quilici, A., and Yang, Q. 1997. Constraint-based Design Recovery for Software Reengineering: Theory and Experiments. Kluwer Academic Publishers, University of Hawaii at Manoa (USA), Simon Fraser University (Canada). URL: http://www.wkap.com/.
49. Yang, Q. 1990. Formalizing planning knowledge for hierarchical planning. Computational Intelligence, 6.
50. Yang, Q. 1992. A theory of conflict resolution in planning. Artificial Intelligence, 58(1-3):361-392. Special Issue on Constraint-directed Reasoning.
51. Zhang, Y. 1997. Scalability Experiments in Applying Constraint-Based Program Understanding Algorithms to Real-World Programs. Masters thesis, Department of Electrical Engineering, University of Hawaii, Manoa.