{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T06:07:02Z","timestamp":1673417222485},"reference-count":20,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4886,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2000,3]]},"DOI":"10.1016\/s0167-6423(99)00039-8","type":"journal-article","created":{"date-parts":[[2002,10,31]],"date-time":"2002-10-31T21:12:04Z","timestamp":1036098724000},"page":"285-302","source":"Crossref","is-referenced-by-count":5,"title":["Program plan matching: experiments with a constraint-based approach"],"prefix":"10.1016","volume":"36","author":[{"given":"Alex","family":"Quilici","sequence":"first","affiliation":[]},{"given":"Steven","family":"Woods","sequence":"additional","affiliation":[]},{"given":"Yongjun","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0167-6423(99)00039-8_BIB1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/(SICI)1096-908X(199601)8:1<3::AID-SMR122>3.0.CO;2-I","article-title":"DECODE","volume":"8","author":"Chin","year":"1996","journal-title":"J. Software Maint."},{"key":"10.1016\/S0167-6423(99)00039-8_BIB2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0167-6423(99)00040-4","article-title":"Program plan recognition for year 2000 tools","volume":"36","author":"van Deursen","year":"2000","journal-title":"Science Computer Programming"},{"key":"10.1016\/S0167-6423(99)00039-8_BIB3","series-title":"Automatic control understanding for natural programs, Research Report UT-AI-TR-91-161","author":"Hartman","year":"1991"},{"key":"10.1016\/S0167-6423(99)00039-8_BIB4","doi-asserted-by":"crossref","unstructured":"J. Hartman, Understanding natural programs using proper decomposition, in Proceedings of the International Conference on Software Engineering, Austin TX, 1991, pp. 62\u201373.","DOI":"10.1109\/ICSE.1991.130624"},{"key":"10.1016\/S0167-6423(99)00039-8_BIB5","unstructured":"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."},{"key":"10.1016\/S0167-6423(99)00039-8_BIB6","series-title":"Intention Based Diagnosis of Novice Programming Errors","author":"Johnson","year":"1986"},{"key":"10.1016\/S0167-6423(99)00039-8_BIB7","doi-asserted-by":"crossref","unstructured":"W. Kozaczynski, J.Q. Ning, Automated program understanding by concept recognition, Automat. Software Eng. 1, 61\u201378.","DOI":"10.1007\/BF00871692"},{"key":"10.1016\/S0167-6423(99)00039-8_BIB8","doi-asserted-by":"crossref","unstructured":"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\u2013230.","DOI":"10.1109\/WCRE.1993.287762"},{"issue":"5","key":"10.1016\/S0167-6423(99)00039-8_BIB9","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/175290.175301","article-title":"A memory-based approach to recognizing programming plans","volume":"37","author":"Quilici","year":"1994","journal-title":"Commun. ACM"},{"key":"10.1016\/S0167-6423(99)00039-8_BIB10","doi-asserted-by":"crossref","unstructured":"A. Quilici, S. Woods, Toward a Constraint-satisfaction framework for evaluating program understanding algorithms, J. Automat. Software Eng. 4 (3) (1997).","DOI":"10.1023\/A:1008674909165"},{"issue":"3","key":"10.1016\/S0167-6423(99)00039-8_BIB11","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1023\/A:1008608825390","article-title":"Applying plan recognition algorithms to program understanding","volume":"5","author":"Quilici","year":"1998","journal-title":"J. Automat Software Eng."},{"key":"10.1016\/S0167-6423(99)00039-8_BIB12","unstructured":"E. Tsang, Foundations Of Constraint Satisfaction, Academic Press Limited, 24\u201328 Oval Road, London England, NW1 7DX, 1993."},{"key":"10.1016\/S0167-6423(99)00039-8_BIB13","unstructured":"B. Weide, Why program understanding is intractable, in Proceedings of the 17th International Conference on Software Engineering, Seattle, WA, 1995."},{"issue":"2","key":"10.1016\/S0167-6423(99)00039-8_BIB14","first-page":"113","volume":"45","author":"Wills","year":"1990","journal-title":"Automated program recognition: a feasibility demonstration, artificial intelligence"},{"key":"10.1016\/S0167-6423(99)00039-8_BIB15","series-title":"Automated program recognition by graph parsing, Ph.D. Thesis","author":"Wills","year":"1992"},{"key":"10.1016\/S0167-6423(99)00039-8_BIB16","series-title":"A method of program understanding using constraint satisfaction for software reverse engineering, Ph.D. Thesis","author":"Woods","year":"1996"},{"key":"10.1016\/S0167-6423(99)00039-8_BIB17","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/WCRE.1996.558813"},{"key":"10.1016\/S0167-6423(99)00039-8_BIB18","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/ICSE.1996.493397"},{"key":"10.1016\/S0167-6423(99)00039-8_BIB19","unstructured":"S. Woods, Q. Yang, Program understanding as constraint satisfaction: representation and reasoning techniques, J. Automat. Software Eng. 1997, to appear."},{"key":"10.1016\/S0167-6423(99)00039-8_BIB20","unstructured":"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."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642399000398?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642399000398?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T19:36:32Z","timestamp":1578684992000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642399000398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":20,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0167642399000398"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6423(99)00039-8","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}