{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T16:41:21Z","timestamp":1783096881682,"version":"3.54.6"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540612285","type":"print"},{"value":"9783540683889","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61228-9_86","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T10:17:05Z","timestamp":1153131425000},"page":"170-184","source":"Crossref","is-referenced-by-count":7,"title":["Using attributed flow graph parsing to recognize clich\u00e9s in programs"],"prefix":"10.1007","author":[{"given":"Linda Mary","family":"Wills","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"D. Brotsky. An algorithm for parsing flow graphs. Technical Report 704, MIT Artificial Intelligence Lab., March 1984. Master's thesis.","DOI":"10.21236\/ADA142440"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"H. Bunke and B. Haller. A parser for context free plex grammars. In M. Nagl, editor, 15th Int. Workshop on Graph-Theoretic Concepts in Computer Science, pages 136\u2013150. Springer-Verlag, June 1989. LNCS, Vol. 411.","DOI":"10.1007\/3-540-52292-1_10"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"W. Dally, et al. The J-Machine: A fine-grain concurrent computer. In Int. Fed. of Info. Processing Societies, 1989.","DOI":"10.21236\/ADA211909"},{"issue":"2","key":"12_CR4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(78)90528-4","volume":"37","author":"P. Della-Vigna","year":"1978","unstructured":"P. Della-Vigna and C. Ghezzi. Context-free graph grammars. Information and Control, 37(2):207\u2013233, 1978.","journal-title":"Information and Control"},{"issue":"2","key":"12_CR5","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/362007.362035","volume":"13","author":"J. Earley","year":"1970","unstructured":"J. Earley. An efficient context-free parsing algorithm. Comm. of the ACM, 13(2):94\u2013102, 1970.","journal-title":"Comm. of the ACM"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"R. Farrow, K. Kennedy, and L. Zucconi. Graph grammars and global program data flow analysis. In Proc. 17th Annual IEEE Symposium on Foundations of Computer Science, pages 42\u201356, Houston, Texas, 1976.","DOI":"10.1109\/SFCS.1976.17"},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0020-0255(71)80008-7","volume":"3","author":"J. Feder","year":"1971","unstructured":"J. Feder. Plex languages. Information Sciences Journal, 3:225\u2013241, 1971.","journal-title":"Information Sciences Journal"},{"key":"12_CR8","volume-title":"Lecture Notes in Computer Science Series, Vol. 643","author":"A. Habel","year":"1992","unstructured":"A. Habel. Hyperedge Replacement: Grammars and Languages. Springer-Verlag, New York, 1992. Lecture Notes in Computer Science Series, Vol. 643."},{"key":"12_CR9","series-title":"PhD thesis","volume-title":"Technical Report AI 91-161","author":"J. Hartman","year":"1991","unstructured":"J. Hartman. Automatic control understanding for natural programs. Technical Report AI 91-161, University of Texas at Austin, 1991. PhD thesis."},{"key":"12_CR10","volume-title":"Intention-Based Diagnosis of Novice Programming Errors","author":"W. L. Johnson","year":"1986","unstructured":"W. L. Johnson. Intention-Based Diagnosis of Novice Programming Errors. Morgan Kaufmann Publishers, Inc., Los Altos, CA, 1986."},{"key":"12_CR11","first-page":"35","volume-title":"Readings in Natural Language Processing","author":"M. Kay","year":"1986","unstructured":"M. Kay. Algorithm schemata and data structures in syntactic processing. In B. Grosz, K. Sparck-Jones, and B. Webber, editors, Readings in Natural Language Processing, pages 35\u201370. Morgan Kaufmann Publishers, Inc., Los Altos, CA, 1986."},{"issue":"1","key":"12_CR12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF00871692","volume":"1","author":"V. Kozaczynski","year":"1994","unstructured":"V. Kozaczynski and J.Q. Ning. Automated program understanding by concept recognition. Automated Software Engineering, 1(1):61\u201378, March 1994.","journal-title":"Automated Software Engineering"},{"key":"12_CR13","unstructured":"S. Letovsky. Plan analysis of programs. RR 662, Yale University, Dec. 1988."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"U. Lichtblau. Decompilation of control structures by means of graph transformation. In H. Ehrig, editor, LNCS, Vol. 185, pages 284\u2013297. Springer-Verlag, 1985.","DOI":"10.1007\/3-540-15198-2_18"},{"key":"12_CR15","unstructured":"R. Lutz. Chart parsing of flowgraphs. In Proc. 11th Int. Joint Conf. Artificial Intelligence, pages 116\u2013121, Detroit, Michigan, 1989."},{"issue":"3","key":"12_CR16","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0019-9958(70)90135-X","volume":"16","author":"U. G. Montanari","year":"1970","unstructured":"U. G. Montanari. Separable graphs, planar graphs, and web grammars. Information and Control, 16(3):243\u2013267, March 1970.","journal-title":"Information and Control"},{"issue":"1","key":"12_CR17","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321679.321682","volume":"19","author":"T. Pavlidis","year":"1972","unstructured":"T. Pavlidis. Linear and context-free graph grammars. Journal of the ACM, 19(1):11\u201323, January 1972.","journal-title":"Journal of the ACM"},{"issue":"3\u20134","key":"12_CR18","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0031-3203(90)90026-H","volume":"23","author":"K. Peng","year":"1990","unstructured":"K. Peng, T. Yamamoto, and Y. Aoki. A new parsing algorithm for plex grammars. Pattern Recognition, 23(3\u20134):393\u2013402, 1990.","journal-title":"Pattern Recognition"},{"key":"12_CR19","unstructured":"J. L. Pfaltz and A. Rosenfeld. Web grammars. In Proc. 1st Int. Joint Conf. Artificial Intelligence, pages 609\u2013619, Washington, D.C., September 1969."},{"issue":"5","key":"12_CR20","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/175290.175301","volume":"37","author":"A. Quilici","year":"1994","unstructured":"A. Quilici. Memory-based approach to recognizing programming plans. Comm. of the ACM, 37(5):84\u201393, May 1994.","journal-title":"Comm. of the ACM"},{"key":"12_CR21","volume-title":"The Programmer's Apprentice","author":"C. Rich","year":"1990","unstructured":"C. Rich and R. C. Waters. The Programmer's Apprentice. Addison-Wesley, Reading, MA and ACM Press, Baltimore, MD, 1990."},{"issue":"1","key":"12_CR22","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/52.43053","volume":"7","author":"C. Rich","year":"1990","unstructured":"C. Rich and L. M. Wills. Recognizing a program's design: A graph-parsing approach. IEEE Software, 7(1):82\u201389, January 1990.","journal-title":"IEEE Software"},{"key":"12_CR23","first-page":"307","volume-title":"Machine Intelligence 7","author":"A. Rosenfeld","year":"1972","unstructured":"A. Rosenfeld and D. Milgram. Web automata and web grammars. In B. Meltzer and D. Michie, editors, Machine Intelligence 7, pages 307\u2013324. John Wiley and Sons, New York, 1972."},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"H. Thompson. Chart parsing and rule schemata in GPSG. In Proc. 19th Annual Meeting of the ACL, Stanford, CA, 1981.","DOI":"10.3115\/981923.981966"},{"issue":"1\u20132","key":"12_CR25","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0004-3702(90)90039-3","volume":"45","author":"L. Wills","year":"1990","unstructured":"L. Wills. Automated program recognition: A feasibility demonstration. Artificial Intelligence, 45(1\u20132):113\u2013172, 1990.","journal-title":"Artificial Intelligence"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"L. Wills. Automated program recognition by graph parsing. Technical Report 1358, MIT Artificial Intelligence Lab., July 1992. PhD Thesis.","DOI":"10.21236\/ADA259609"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"L. Wills. Flexible control for program recognition. In Proc. 1st Working Conference on Reverse Engineering, Baltimore, MD, May 1993.","DOI":"10.1109\/WCRE.1993.287771"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"K. Wittenburg, L. Weitzman, and J. Talley. Unification-based grammars and tabular parsing for graphical languages. TR ACT-OODS-208-91, MCC, 1991.","DOI":"10.1016\/S1045-926X(05)80004-7"}],"container-title":["Lecture Notes in Computer Science","Graph Grammars and Their Application to Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61228-9_86","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T22:02:04Z","timestamp":1555711324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61228-9_86"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612285","9783540683889"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-61228-9_86","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}