Using attributed flow graph parsing to recognize Clichés in programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1073, Issue , 1996, Pages 170-184

  Wills, Linda Mary ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; GRAPHIC METHODS; VISUAL LANGUAGES;

AGGREGATE DATUM; COMPUTATIONAL STRUCTURE; DESIGN INFORMATION; GRAPH FORMALISMS; GRAPH PARSING; PARSING ALGORITHM; STRUCTURAL COMPONENT; STRUCTURE SHARING;

FLOW GRAPHS;

EID: 21344437651     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61228-9_86     Document Type: Conference Paper

References (28)

1. D. Brotsky. An algorithm for parsing flow graphs. Technical Report 704, MIT Artificial Intelligence Lab., March 1984. Master's thesis.
2. H. Bunke and B. Hailer. A parser for context free plex grammars. In M. Nagl, editor, 15th Int. Workshop on Graph-Theoretic Concepts in Computer Science, pages 136-150. Springer-Verlag, June 1989. LNCS, Vol. 411.
3. W. Dally, et al. The J-Machine: A fine-grain concurrent computer. In Int. Fed. of Info. Processing Societies, 1989.
4. P. Della-Vigna and C. Ghezzi. Context-free graph grammars. Information and Control, 37(2):207-233, 1978.
5. J. Earley. An efficient context-free parsing algorithm. Comm. of the ACM, 13(2):94-102, 1970.
6. 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-56, Houston, Texas, 1976.
7. J. Feder. Plex languages. Information Sciences Journal, 3:225-241, 1971.
8. A. Habel. Hyperedge Replacement: Grammars and Languages. Springer-Verlag, New York, 1992. Lecture Notes in Computer Science Series, Vol. 643.
9. J. Hartman. Automatic control understanding for natural programs. Technical Report AI 91-161, University of Texas at Austin, 1991. PhD thesis.
10. W. L. Johnson. Intention-Based Diagnosis of Novice Programming Errors. Morgan Kaufmann Publishers, Inc., Los Altos, CA, 1986.
11. 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-70. Morgan Kaufmann Publishers, Inc., Los Altos, CA, 1986.
12. V. Kozaczynski and J.Q. Ning. Automated program understanding by concept recognition. Automated Software Engineering, 1(1):61-78, March 1994.
13. S. Letovsky. Plan analysis of programs. RR 662, Yale University, Dec. 1988.
14. U. Lichtblau. Decompilation of control structures by means of graph transformation. In H. Ehrig, editor, LNCS, Vol. 185, pages 284-297. Springer-Verlag, 1985.
15. R. Lutz. Chart parsing of flowgraphs. In Proc. 11th Int. Joint Conf. Artificial Intelligence, pages 116-121, Detroit, Michigan, 1989.
16. U. G. Montanari. Separable graphs, planar graphs, and web grammars. Information and Control, 16(3):243-267, March 1970.
17. T. Pavlidis. Linear and context-free graph grammars. Journal of the ACM, 19(1):11-23, January 1972.
18. K. Peng, T. Yamamoto, and Y. Aoki. A new parsing algorithm for plex grammars. Pattern Recognition, 23(3-4):393-402, 1990.
19. J. L. Pfaltz and A. Rosenfeld. Web grammars. In Proc. 1st Int. Joint Conf. Artificial Intelligence, pages 609-619, Washington, D.C., September 1969.
20. A. Quilici. Memory-based approach to recognizing programming plans. Comm. of the ACM, 37(5):84-93, May 1994.
21. C. Rich and R. C. Waters. The Programmer's Apprentice. Addison-Wesley, Reading, MA and ACM Press, Baltimore, MD, 1990.
22. C. Rich and L. M. Wills. Recognizing a program's design: A graph-parsing approach. IEEE Software, 7(1):82-89, January 1990.
23. A. Rosenfeld and D. Milgram. Web automata and web grammars. In B. Meltzer and D. Michie, editors, Machine Intelligence 7, pages 307-324. John Wiley and Sons, New York, 1972.
24. H. Thompson. Chart parsing and rule schemata in GPSG. In Proc. lgth Annual Meeting of the ACL, Stanford, CA, 1981.
25. L. Wills. Automated program recognition: A feasibility demonstration. Artificial Intelligence, 45(1-2):113-172, 1990.
26. L. Wills. Automated program recognition by graph parsing. Technical Report 1358, MIT Artificial Intelligence Lab., July 1992. PhD Thesis.
27. L. Wills. Flexible control for program recognition. In Proc. 1st Working Conference on Reverse Engineering, Baltimore, MD, May 1993.
28. K. Wittenburg, L. Weitzman, and J. Talley. Unification-based grammars and tabular parsing for graphical languages. TR ACT-OODS-208-91, MCC, 1991.