lnu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
JClone: Syntax tree based clone detection for Java
Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics. (Software Technology)
2010 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

An unavoidable amount of money is spent on maintaining existing software systems today. Software maintenance cost generally higher than development cost of the system therefore lowering maintenance cost is highly appreciated in software industry.

A significant part of maintenance activities is related to repeating the investigation of problems and applying repeated solutions several times. A software system may contain a common bug in several different places and it might take extra effort and time to fix all existences of this bug. This operation commonly increases the cost of Software Maintenance Activities.

Detecting duplicate code fragments can significantly decrease the time and effort therefore the maintenance cost. Clone code detection can be achieved via analyzing the source code of given software system. An abstract syntax tree based clone detector for java systems is designed and implemented through this study.

This master thesis examines a software engineering process to create an abstract syntax tree based clone detector for the projects implemented in Java programming language.

Place, publisher, year, edition, pages
2010. , p. 55
Keywords [en]
clone detection, abstract syntax tree, java, eclipse, software, maintenance
National Category
Software Engineering
Identifiers
URN: urn:nbn:se:lnu:diva-5455OAI: oai:DiVA.org:lnu-5455DiVA, id: diva2:317253
Presentation
2010-01-22, B3033, Linnaeus University | SE-351 95 Växjö, School of Computer Science, Physics and Mathematics, 12:30 (English)
Uppsok

Supervisors
Examiners
Available from: 2010-05-03 Created: 2010-05-02 Last updated: 2018-01-12Bibliographically approved

Open Access in DiVA

fulltext(3019 kB)7892 downloads
File information
File name FULLTEXT01.pdfFile size 3019 kBChecksum SHA-512
01f3c10f0d0db69b2e863132a26d66bb824630c76e4d4d97c842233e32cf2bc64c03657993654495cb652e894372101f71cf8308e1fd3cb53eebb6a184885f4d
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Bahtiyar, Muhammed Yasin
By organisation
School of Computer Science, Physics and Mathematics
Software Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 7892 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 736 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf