Notice: This Wiki is now read only and edits are no longer possible. Please see: https://gitlab.eclipse.org/eclipsefdn/helpdesk/-/wikis/Wiki-shutdown-plan for the plan.
Difference between revisions of "Duplicated code detection tool (SDD)"
m (Grammar) |
|||
| Line 3: | Line 3: | ||
'''Mentor''': Pascal Rapicault | '''Mentor''': Pascal Rapicault | ||
| − | Implementing SDD for eclipse environment. SDD is | + | Implementing SDD for eclipse environment. SDD is an algorithm for detecting duplicated parts which are not just identical, but also similar ones in a large amount of source code in a reasonable time. |
== Motivation == | == Motivation == | ||
| − | + | When one is not really paying attention when reviewing other people's code, duplications can happen easily, especially when there are many developers working on the same code base, such as in open source projects. But detecting duplications by people is very ineffective and previous algorithms to detect automatically are too slow for practical purposes or limited in its features. So implementing SDD can be a solution for the problem because SDD can find almost-duplicated (not exactly same) parts practically and Eclipse has a very good infrastructure for SDD UI. | |
== SDD == | == SDD == | ||
| Line 15: | Line 15: | ||
=== How it works === | === How it works === | ||
* coming soon..;) | * coming soon..;) | ||
| − | * Using | + | * Using an Index, Inverted Index |
== Related Works == | == Related Works == | ||
| Line 24: | Line 24: | ||
==External Links== | ==External Links== | ||
[http://oopsla.org/2005/ShowEvent.do?id=560 SDD in OOPSLA2005] | [http://oopsla.org/2005/ShowEvent.do?id=560 SDD in OOPSLA2005] | ||
| + | |||
==Comments,Questions== | ==Comments,Questions== | ||
* feel free to comment, ask | * feel free to comment, ask | ||
Revision as of 10:10, 28 June 2006
Project Lead: Iryoung Jeong
Mentor: Pascal Rapicault
Implementing SDD for eclipse environment. SDD is an algorithm for detecting duplicated parts which are not just identical, but also similar ones in a large amount of source code in a reasonable time.
Motivation
When one is not really paying attention when reviewing other people's code, duplications can happen easily, especially when there are many developers working on the same code base, such as in open source projects. But detecting duplications by people is very ineffective and previous algorithms to detect automatically are too slow for practical purposes or limited in its features. So implementing SDD can be a solution for the problem because SDD can find almost-duplicated (not exactly same) parts practically and Eclipse has a very good infrastructure for SDD UI.
SDD
- The algorithm for detecting similar parts in large source.
- No dependency on specific languages, Not exact parts, Fast
How it works
- coming soon..;)
- Using an Index, Inverted Index
Related Works
External Links
SDD in OOPSLA2005
Comments,Questions
- feel free to comment, ask