Scheduled System Maintenance on December 17th, 2014:
IEEE Xplore will be upgraded between 2:00 and 5:00 PM EST (18:00 - 21:00) UTC. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Normalization for Removing Code Variations in Modular Programs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tiantian Wang ; Sch. of Comput. Sci. & Technol., Harbin Inst. of Technol., Harbin, China ; Xiaohong Su ; Peijun Ma

Code variations are widely believed to impede program analysis. This paper introduces an approach for removing code variations in programs with function calls. Non-recursive programs and recursive programs are handled with different strategies. An inlining algorithm based on system dependence graph is developed to remove the module structure variation in non-recursive programs. Recursive programs are not in lined, but also normalized by performing semantic-preserving transformations on system dependence graphs. As a result, semantically equivalent constructs are transformed to the same system dependence graph representation, so that code variations are removed. This approach has been applied to similar code detection and automatic grading of student programs. Test results show that it can efficiently remove code variations and improve program analysis.

Published in:

Computer Science and Computational Technology, 2008. ISCSCT '08. International Symposium on  (Volume:2 )

Date of Conference:

20-22 Dec. 2008