{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T07:40:02Z","timestamp":1748072402229,"version":"3.41.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Automated Software Engineering"],"published-print":{"date-parts":[[1998,7]]},"DOI":"10.1023\/a:1008608825390","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T15:12:40Z","timestamp":1040569960000},"page":"347-372","source":"Crossref","is-referenced-by-count":22,"title":["Applying Plan Recognition Algorithms To Program Understanding"],"prefix":"10.1007","volume":"5","author":[{"given":"Alex","family":"Quilici","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Woods","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"164687_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/(SICI)1096-908X(199601)8:1<3::AID-SMR122>3.3.CO;2-9","volume":"8","author":"D. Chin","year":"1996","unstructured":"Chin, D. and Quilici, A. 1996. DECODE: Acooperative program understanding environment. Journal of Software Maintenance, 8: 3-34.","journal-title":"Journal of Software Maintenance"},{"key":"164687_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0004-3702(92)90043-W","volume":"55","author":"R. Dechter","year":"1992","unstructured":"Dechter, R. 1992. From local to global consistency. Artificial Intelligence, 55: 87-107.","journal-title":"Artificial Intelligence"},{"key":"164687_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","volume":"58","author":"E. Freuder","year":"1992","unstructured":"Freuder, E. and Wallace, J. 1992. Partial constraint satisfaction. Artificial Intelligence, 58: 21-70.","journal-title":"Artificial Intelligence"},{"key":"164687_CR4","unstructured":"Hartman, J. 1991a. Automatic control understanding for natural programs. PhD thesis, University of Texas at Austin, Department of Computer Science."},{"key":"164687_CR5","doi-asserted-by":"crossref","unstructured":"Hartman, J. 1991b. Understanding natural programs using proper decomposition. In Proceedings of the International Conference on Software Engineering, Austin, TX, pp. 62-73.","DOI":"10.1109\/ICSE.1991.130624"},{"key":"164687_CR6","volume-title":"A formal theory of plan recognition","author":"H. Kautz","year":"1987","unstructured":"Kautz, H. 1987. A formal theory of plan recognition. PhD thesis, University of Rochester, Department of Computer Science, Rochester, New York."},{"key":"164687_CR7","unstructured":"Kautz, H. and Allen, J. 1986. Generalized plan recognition. In Proceedings of the Fifth National Conference on Artificial Intelligence, Philadelphia, PA, pp. 32-37."},{"key":"164687_CR8","unstructured":"Kondrak, G. and van Beek, P. 1995. A theoretical evaluation of selected backtracking algorithms. Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal, CA, pp. 541-547."},{"key":"164687_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF00871692","volume":"1","author":"W. Kozaczynski","year":"1994","unstructured":"Kozaczynski, W. and Ning, J. 1994. Automated program understanding by concept recognition. Automated Software Engineering, 1: 61-78.","journal-title":"Automated Software Engineering"},{"key":"164687_CR10","first-page":"32","volume":"13","author":"V. Kumar","year":"1992","unstructured":"Kumar, V. 1992. Algorithms for constraint-satisfaction problems. AI Magazine, 13: 32-44.","journal-title":"AI Magazine"},{"key":"164687_CR11","volume-title":"Intention Based Diagnosis of Novice Programming Errors","author":"W.L. Johnson","year":"1986","unstructured":"Johnson, W.L. 1986. Intention Based Diagnosis of Novice Programming Errors. Los Altos, CA: Morgan Kaufman."},{"key":"164687_CR12","first-page":"188","volume":"1","author":"A.K. Mackworth","year":"1985","unstructured":"Mackworth, A.K., Muldter, J. and Havens, W. 1985. Hierarchical arc consistency: exploiting structured domains in constraint satisfaction problems. Computation Intelligence, 1:188-196.","journal-title":"Computation Intelligence"},{"key":"164687_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"Minton, S., Johnston, M., Philips, A. and Laird, P. 1992. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58:161-205.","journal-title":"Artificial Intelligence"},{"key":"164687_CR14","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1111\/j.1467-8640.1989.tb00328.x","volume":"5","author":"B. A. Nadel","year":"1989","unstructured":"Nadel, B. A. 1989. Constraint satisfaction algorithms. Computational Intelligence, 5: 188-224.","journal-title":"Computational Intelligence"},{"key":"164687_CR15","doi-asserted-by":"crossref","unstructured":"Newcomb, P. and Markosian, L. 1993. Automating the modularization of large COBOL programs: application of an enabling technology for reengineering. In Proceedings of the Working Conference on Reverse Engineering, Baltimore, MD, pp. 222-230.","DOI":"10.1109\/WCRE.1993.287762"},{"key":"164687_CR16","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","volume":"9","author":"P. Prosser","year":"1993","unstructured":"Prosser, P. 1993. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9: 268-299.","journal-title":"Computational Intelligence"},{"key":"164687_CR17","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/175290.175301","volume":"37","author":"A. Quilici","year":"1994","unstructured":"Quilici, A. 1994. A memory-based approach to recognizing programming plans. Communications of the ACM, 37: 84-93.","journal-title":"Communications of the ACM"},{"key":"164687_CR18","doi-asserted-by":"crossref","unstructured":"Quilici, A. 1995. Reverse engineering of legacy systems: a path toward success. In Proceedings of the 17th International Conference on Software Engineering, Seattle, WA, pp. 333-336.","DOI":"10.1145\/225014.225046"},{"key":"164687_CR19","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1023\/A:1008674909165","volume":"4","author":"A. Quilici","year":"1997","unstructured":"Quilici, A. and Woods, S. 1997. Toward a constraint-satisfaction framework for program understanding. Journal of Automated Software Engineering, 4: 271-289.","journal-title":"Journal of Automated Software Engineering"},{"key":"164687_CR20","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1111\/j.1467-8640.1992.tb00381.x","volume":"8","author":"G. Sidebottom","year":"1992","unstructured":"Sidebottom, G. and Havens, W.S. 1992. Hierarchical arc consistency for disjoint real intervals in constraint logic programming. Computational Intelligence, 8: 601-623.","journal-title":"Computational Intelligence"},{"key":"164687_CR21","doi-asserted-by":"crossref","unstructured":"Sosic, R. and Gu, J. 1990. A polynomial time algorithm for the n-queens problem. SIGART, 1.","DOI":"10.1145\/101340.101343"},{"key":"164687_CR22","unstructured":"Song, F. and Cohen, R. 1991. Temporal teasoning during plan recognition, In Proceedings of the Ninth National Conference on Artificial Intelligence, Anaheim, CA, pp. 247-252."},{"key":"164687_CR23","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1111\/j.1467-8640.1993.tb00304.x","volume":"9","author":"P. van Beek","year":"1994","unstructured":"van Beek, P., Cohen, R., and Schmidt, K. 1994. From plan critiquing to clarification dialogue for cooperative response generation. Computational Intelligence, 9: 132-154.","journal-title":"Computational Intelligence"},{"key":"164687_CR24","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0004-3702(90)90039-3","volume":"45","author":"L. M. Wills","year":"1990","unstructured":"Wills, L. M. 1990. Automated program recognition: a feasibility demonstration. Artificial Intelligence, 45: 113-172.","journal-title":"Artificial Intelligence"},{"key":"164687_CR25","doi-asserted-by":"crossref","unstructured":"Wills, L. M. 1992. Automated program recognition by Graph Parsing. PhD thesis, MIT, Department of Computer Science.","DOI":"10.21236\/ADA259609"},{"key":"164687_CR26","volume-title":"A method of program understanding using constraint satisfaction for software reverse engineering","author":"S. Woods","year":"1996","unstructured":"Woods, S. 1996. A method of program understanding using constraint satisfaction for software reverse engineering. Ph.D. Thesis, Department of Computer Science, University of Waterloo, Waterloo, Canada."},{"key":"164687_CR27","doi-asserted-by":"crossref","unstructured":"Woods, S. and Yang, Q. 1996. The program understanding problem: Analysis and a heuristic approach In Proceedings of the 18th International Conference on Software Engineering ICSE-96, Berlin, Germany, pp. 6-15.","DOI":"10.1109\/ICSE.1996.493397"},{"key":"164687_CR28","doi-asserted-by":"crossref","unstructured":"Woods, S. and Yang, Q. 1995. Program understanding as constraint satisfaction. In Proceedings of the IEEE Seventh International Workshop on Computer-Aided Software Engineering, Toronto, Ontario, Canada, pp. 318- 327.","DOI":"10.1109\/CASE.1995.465302"},{"key":"164687_CR29","series-title":"Technical Report","volume-title":"Solving partial constraint satisfaction problems using local search and abstraction","author":"Q. Yang","year":"1992","unstructured":"Yang, Q. and Fong, P. 1992. Solving partial constraint satisfaction problems using local search and abstraction. Technical Report CS-92-50, University of Waterloo, Waterloo, Ontario, Canada."},{"key":"164687_CR30","volume-title":"Scalability experiments in applying constraint-based program understanding algorithms to real-world programs","author":"Y. Zhang","year":"1997","unstructured":"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 at Manoa, Honolulu, Hawaii."}],"container-title":["Automated Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008608825390.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008608825390\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008608825390.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T06:58:43Z","timestamp":1748069923000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008608825390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,7]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,7]]}},"alternative-id":["164687"],"URL":"https:\/\/doi.org\/10.1023\/a:1008608825390","relation":{},"ISSN":["0928-8910","1573-7535"],"issn-type":[{"type":"print","value":"0928-8910"},{"type":"electronic","value":"1573-7535"}],"subject":[],"published":{"date-parts":[[1998,7]]}}}