期刊文献+

用指针实现的程序的标准化及其应用 被引量:1

Standardization of program implemented with pointers and its application
下载PDF
导出
摘要 为了消除指针程序实现形式的多样化,简化程序分析,提出一种对用指针实现的程序进行标准化的方法.首先将程序表示成系统依赖图,分析指针别名信息;然后制定指针标准化规则并结合已有的代码多样化消除规则,对系统依赖图进行保持语义不变的转换,将语法表示不同但语义等价的程序转换为相同的系统依赖图表示,从而消除代码多样化.最后,将该方法应用到C语言编程题的自动评分系统中,并与人工评分和正确评分结果进行对比,验证了该方法的有效性. In order to facilitate program analysis, a standardization method is proposed to remove variations in programs implemented with pointers. Firstly, a program is represented by a system dependence graph (SDG), and the alias information is analyzed. Then standardization rules for eliminating variations caused by pointers are proposed, and the SDG is transformed according to these rules, so that syntactically different but semantically equivalent codes can be transformed into identical SDGs. Therefore, code variations are removed. The proposed method has been applied to an automatic grading system of C programming language, and the results were compared with those of both manual and strictly precise grading systems to validate the effectiveness of our method.
出处 《哈尔滨工业大学学报》 EI CAS CSCD 北大核心 2009年第3期48-52,共5页 Journal of Harbin Institute of Technology
基金 国家自然科学基金资助项目(60673035)
关键词 指针别名 系统依赖图 程序标准化 别名替换 别名分析 pointer alias SDG program standardization alias replacement alias analysis
  • 相关文献

参考文献7

  • 1王宇颖,李永浩,孙志岗,苏小红.代码多样化消除规则的研究[J].哈尔滨工业大学学报,2005,37(4):526-529. 被引量:5
  • 2HATTORI N, ISHII N. A method to remove variations in source codes [ J ]. Information and Software Technology, 1996, 38(1) :25 -36.
  • 3UENO H. A program normalization to Improve flexibility of knowledge-based program understander [ J ]. IEICE Transaction on Information and Systems, 1998, 81 (12) : 1323 - 1329.
  • 4PANOS E L. JOHNSON T. An optimal algorithm for the construct of the system dependence graph [ J ]. Information Science, 2000, 125(1 -4) : 99 - 131.
  • 5BALMAS F. Displaying dependence graph: a hierarchical approach [ C ]//Proceedings of the Eighth Working Conference on Reverse Engineering. Stuttgart: IEEE Computer Press, 2001 : 261 -270.
  • 6RICCA F, TONELLA P. Construct of the system dependence graph for web application slicing [ C]//Proceedings of the Second IEEE International Workshop on Source Code Analysis and Manipulation. Oakland: IEEE Computer Press, 2002 : 123 - 132.
  • 7LANDI W. Undecidability of static analysis [J]. ACM Letters on Programming Languages and Systems, 1992, 1(4) : 323 -337.

二级参考文献7

  • 1LIVADAS P E, JOHNSON T. An optimal algorithm for the conception of the system dependence graph [J]. ELSEVIER, Information Sciences, 2000:99 - 131.
  • 2HARUKI U. Generalized knowledge- based approach to comprehend Pascal and C programs[J]. IEICE Transac tions on Information and Systems, 2000,4:132-139.
  • 3XU Songwen, CHEE Y S. Transformation-based diagnosis of student programs for programming tutoring system [J].IEEE Tram, Software Engineering, 2003,4:360-383.
  • 4WOODS S, QUILICI A. Some experiment toward understanding how program plan recognition algorithms scale[J]. IEEE Proceedings of WCRE, 1996, 4:21 -30.
  • 5OTT L M, BIEMAN J M. Program slices as an abstraction for cohesion measurement[ J]. Information and Software Technology, 1998:213 - 222.
  • 6KOREL B, RILLING J. Dynamic program slicing in understanding of program execution[ J ]. Proceedings of 5th International Workshop on Program Comprehension,1997:82 - 90.
  • 7HATTORI N, ISHII N. A method to remove variations in source codes[J]. ELSEVIER, Information and Software Technology, 1996:25 - 36.

共引文献4

同被引文献6

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部