By Topic

Applying Generalization Refactoring to Java Generic 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

4 Author(s)
Lin Chen ; Sch. of Comput. Sci. & Eng., Southeast Univ., Nanjing ; Baowen Xu ; Tianlin Zhou ; Yuming Zhou

In generalization refactoring, preconditions and allowable source code modifications depend on type constraints of the refactored program. Type constraints of parameterized types should be considered when applying the refactoring to generic programs, otherwise type errors may be brought into the refactored program. Some type constraint rules for Java generic programs are presented to verify the preconditions in the refactoring. The type constraints can be solved by traversing a type constraint graph. Based on the type constraint graph, a refactoring algorithm for extract interface is proposed.

Published in:

Semantic Computing and Systems, 2008. WSCS '08. IEEE International Workshop on

Date of Conference:

14-15 July 2008