Patil, Tejas and Komondoor, Raghavan and D'Souza, Deepak and Bhattacharya, Indrajit (2016) An Optimization Approach for Matching Textual Domain Models with Existing Code. In: 32nd IEEE International Conference on Software Maintenance and Evolution (ICSME), OCT 02-10, 2016, Releigh, NC, pp. 134-144.
![]() |
PDF
32nd_IEEE_Int_Con_Sof_Mai_Evo_134_2016.pdf - Published Version Restricted to Registered users only Download (275kB) | Request a copy |
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.
Item Type: | Conference Proceedings |
---|---|
Series.: | Proceedings-IEEE International Conference on Software Maintenance |
Additional Information: | Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA |
Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
Date Deposited: | 29 Jul 2017 10:22 |
Last Modified: | 29 Jul 2017 10:22 |
URI: | http://eprints.iisc.ac.in/id/eprint/57526 |
Actions (login required)
![]() |
View Item |