[1]
ALIAS C, BARTHOU D. Algorithm recognition based on demand-driven data-flow analysis[C]// WCRE’03: Proceedings of the 10th Working Conference on Reverse Engineering.Washington,DC:IEEE Computer Society,2003:296.
[2]
ALLEN R, KENNEDY K. Optimizing compilers for modern architectures[M]. Klecakova: Elsevier Science, 2001.
[3]
METZGER R,WEN ZHAOFANG. Automatic algorithm recognition and replacement [M]. Cambridge: MIT Press, 2000.
[4]
TAHERKHANI A, MALMI L, KORHONEN A. Algorithm recognition by static analysis and its application in students submissions assessment[C]// Proceedings of the 8th Koli Calling International Conference on Computing Education Research. New York: ACM, 2008:88-91.
[5]
MURRAY W R. Automatic program debugging for intelligent tutoring systems[J]. Computational Intelligence,1987, 3(1):1-16.
[6]
JOHNSON W L, SOLOWAY E. Proust: Knowledge-based program understanding[J]. IEEE Transactions on Software Engineering, 1985,11(5): 267-275.
[7]
KIM S, KIM J H. Algorithm recognition for programming tutoring based on flow graph parsing[J]. Applied Intelligence,1996, 6(2):153-164.
[8]
TAHERKHANI A. Recognizing sorting algorithm with the C4.5 decision tree classifier[C]// IEEE 18th International Conference on Program Comprehension.Washington, DC: IEEE Computer Society, 2010:72-75.
[9]
RICH C. A formal representation for plans in the programmers apprentice[M]. San Francisco: Morgan Kaufmann Publishers Inc., 1986.
[10]
RICH C, WATERS R C. The programmer’s apprentice project: A research overview, AI Memo NO.1004[R]. Cambridge: Massachusetts Institute of Technology Artificial Intelligence Lab (MIT),1987.
[11]
QUILICI A, WOODS S. Toward a constraint-satisfaction framework for evaluating program-understanding algorithms[C]// WPC96: Proceedings of the 4th International Workshop on Program Comprehension.Washington, DC: IEEE Computer Society,1996:55.
[12]
KNUTH D E. The art of computer programming Vol1: Fundamental algorithms third edition[M]. [S.l.]:Addison-Wesley, 1997.
[13]
SIPSER M. Introduction to the theory of computation[M]. 2nd ed. [S.l.]: Thomson Course Technology, 2006:157.
[14]
WATERS R C. The programmer’ apprentice: A session with KBEmacs[J]. IEEE Transaction on Software Engineering, 1985,11(11):1296-1320.
[15]
WILLS L M. Automated program recognition: A feasibility demonstration[J]. Artificial Intelligence,1990, 45(2):113-171.
[16]
BROTSKY D. An algorithm for parsing flow graphs[D]. Cambridge: MIT, 1984.
[17]
LUTZ R. Chart parsing of flowgraphs[C]// IJCAI89: Proceedings of the 11th International Joint Conference on Artificial Intelligence. San Francisco: Morgan Kaufmann Publishers, 1989:116-121.
[18]
WILLS L M. Automated program recognition by graph parsing[D].
Cambridge: Massachusetts Institute of Technology, 1992.
[19]
WOODS S, YANG QIANG. The program understanding problem: Analysis and a heuristic approach[C]// ICSE96: Proceedings of the 18th International Conference on Software Engineering. Washington, DC:IEEE Computer Society,1996:6-15.
[20]
QUILICI A, YANG QIANG, WOODS S. Applying plan recognition algorithms to program understanding[J]. Automated Software Engineering, 1998,5(3):147-181.
[21]
WOODS S, YANG QIANG. Program understanding as constraint satisfaction: Representation and reasoning techniques[J]. Automated Software Engineering, 1998, 5(2):147-181.
[22]
钱剑飞. 基于特征符号的程序理解研究[D]. 杭州: 浙江大学, 2006.
[23]
钱剑飞, 何钦铭, 陈华, 等. 一种基于模糊推理的细匹配方法[J]. 计算机工程, 2007, 33(8):163-167.
[24]
陈华, 陈纯, 唐文彬, 等. 基于后缀树的程序理解Plan自动提取[J]. 浙江大学学报: 工学版, 2008, 42(8):1340-1344.
[25]
BARTHOU D, FEAUTRIER P, REDON X. On the equivalence of two systems of affine recurrence equations RR-4285[R]. INRIA, 2001.
[26]
ZHAO WEI, ZHANG LU, LIU YIN, et al. SNIAFL: Towards a static non-interactive approach to feature location[J]. ACM Transactions on Software Engineering and Methodology, 2006, 15(2):195-226.
[27]
MALETIC J I, MARCUS A. Supporting program comprehension using semantic and structural information[C]// ICSE01: Proceedings of the 23rd International Conference on Software Engineering.Washington, DC: IEEE Computer Society,2001:103-112.
[28]
MARCUS A, MALETIC J I, SERGEYEV A. Recovery of traceability links between software documentation and source code[J]. International Journal of Software Engineering and Knowledge Engineering, 2005,15(5):811-836.
[29]
TIAN K, REVELLE M, POSHYVANYK D. Using latent Dirichlet allocation for automatic categorization of software[C]// MSR09: Proceedings of the 2009 6th IEEE International Working Conference on Mining Software Repositories.Washington, DC: IEEE Computer Society,2009:163-166.
[30]
POSHYVANYK D, GUEHENUEC Y-G, MARCUS A, et al. Combining probabilistic ranking and latent semantic indexing for feature identification[C]// ICPC06: Proceedings of the 14th IEEE International Conference on Program Comprehension. Washington, DC: IEEE Computer Society, 2006:137-146.
[31]
POSHYVANYK D, GETHERS M, MARCUS A. Concept location using formal concept analysis and information retrieval[J/OL].[2012-02-01]. http://www.cs.wayne.edu/~amarcus/ pubs/TOSEM-FCA-LSI-CRC-final.pdf.
[32]
ZHAO WEI, ZHANG LU, SUN JIASU, et al.An objective-oriented approach to program comprehension using multiple information sources[J]. Science in China Series F: Information Sciences, 2008, 51(7):825-847.
[33]
赖冠辉,王晓博,刘超. 代码与文档间关联关系的提取方法研究和改进[J]. 电子学报, 2009, 37(4):22-30.
[34]
TAHERKHANI A. Recognizing sorting algorithms with the C4.5 decision tree classifier[C]// ICPC10: Proceedings of the 2010 IEEE 18th International Conference on Program Comprehension. Washington, DC: IEEE Computer Society, 2010:72-75.
[35]
TAHERKHANI A. Recognizing algorithms using language constructs, software metrics and roles of variables: An experiment with sorting algorithms[J]. Computer Journal, 2011, 54(7):1049-1066.
[36]
王甜甜. 结构语义相似的程序识别方法研究[D].哈尔滨:哈尔滨工业大学, 2009.
[37]
KONTOGIANNIS K A, DEMORI R, MERLO E,et al. Pattern matching for clone and concept detection[M]. Kluwer Academic Publishers, 1996:77-108.
[38]
BAXTER I D, YAHIN A, MOURA L,et al. Clone detection using abstract syntax trees[C]// ICSM98: Proceedings of the International Conference on Software Maintenance. Washington, DC: IEEE Computer Society, 1998:368-377.
[39]
FALKE R, FRENZEL P, KOSCHKE R. Empirical evaluation of clone detection using syntax suffix trees[J]. Empirical Software Engineering, 2008, 13(6):601-643. |