A Taxonomy of High Level Software Clones
Journal Title: International Journal of Computer Science & Engineering Technology - Year 2012, Vol 3, Issue 9
Abstract
The idea of software clones is linked with similarity, which can occur at various levels of abstraction. Simple clones i.e. clones at lower levels of abstraction are classified in literature, however; high level clones are not. We propose and exemplify a consolidated yet novel taxonomy of high level clones. Our discussion augments thus far knowledge of high level clone types and their specialized detection techniques. Clone taxonomies can help in further analysis of high level clone phenomenon like in prioritizing clones for reengineering and for specifying reengineering guidelines.
Authors and Affiliations
Niyati Baliyan , Dr. Vidushi Sharma
Keywords
Related Articles
- EP ID EP150969
- DOI -
- Views 132
- Downloads 0
Energy Cost and QoS based management of Data Centers Resources in Cloud Computing
Cloud computing is the evolutionary step to transform a large part of the Information and Communication Technology industry. It is the result of the efforts to provide the opportunity to focus on hardware and software co...
Centralized Bandwidth Distribution And Utility Provider
This paper is focused the problem faced by large offices and companies. It is helpful to keep observation on employees work for saving companies valuable time. Also it can control his activity. It provides server desktop...
A Survey of Various Load Balancing Techniques and Proposed Load Balancing Method in Cloud Computing.
The Cloud Computing data Centre has abundant hosts as well as Solicitation requests. A Cloud Computing platform that manoeuvre behind the corporate firewall and within control of an organisation IT department. Cloud deal...
A System Framework for Player Selection
The performance of Indian sport person has been pathetic at International level. The performance in any sport or game is a combine effect of various parameters like the Body Posture and Body Type, Diet, Exercise, Trainin...
Dynamic Time Quantum in Shortest Job First Scheduling Algorithm (DTQSJF) for Unpredictable Burst Time of Processes
In multitasking and time sharing operating system the performance of the CPU depends on waiting time, response time, turnaround time, context switches from the process mainly depends on the scheduling algorithm. Shortest...