Name
Abstract | ||
|---|---|---|
We address the task of mapping a given textual domain model with the source code of an application which is in the same domain but was developed independently of the domain model. The key novelty of our approach is to use mathematical optimization to find a mapping between the elements in the two sides that maximizes the instances of clusters of related elements on each side being mapped to clusters of similarly related elements on the other side. We describe experiments wherein we apply our approach to the task of matching two real, open-source applications to corresponding industry-standard domain models. In comparison with previous approaches that leverage relationships, but are formulated as heuristics rather than as a principled optimization problem, our approach gives up to 40% higher precision given a desired level of recall. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/ICSME.2016.48 | 2016 IEEE International Conference on Software Maintenance and Evolution (ICSME) |
Keywords | Field | DocType |
feature location in source code,model-driven software engineering,information retrieval | Cluster (physics),Source code,Load modeling,Computer science,Theoretical computer science,Heuristics,Novelty,Optimization problem,Domain model | Conference |
ISSN | ISBN | Citations |
1063-6773 | 978-1-5090-3807-7 | 0 |
PageRank | References | Authors |
0.34 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tejas Patil | 1 | 0 | 0.34 |
| Raghavan Komondoor | 2 | 404 | 30.26 |
| Deepak D'souza | 3 | 239 | 17.90 |
| Indrajit Bhattacharya | 4 | 619 | 33.31 |