Matching dependence-related queries in the system dependence graph.

In software maintenance and evolution, it is common that developers want to apply a change to a number of similar places. Due to the size and complexity of the code base, it is challenging for developers to locate all the places that need the change. A main challenge in locating the places that need...

Full description

Saved in:
Bibliographic Details
Main Authors: WANG, Xiaoyin, LO, David, CHENG, Jiefeng, ZHANG, Lu, MEI, Hong, YU, Jeffrey Xu
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2010
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/1349
https://ink.library.smu.edu.sg/context/sis_research/article/2348/viewcontent/ase10_codesearch.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-2348
record_format dspace
spelling sg-smu-ink.sis_research-23482020-04-24T06:04:31Z Matching dependence-related queries in the system dependence graph. WANG, Xiaoyin LO, David CHENG, Jiefeng ZHANG, Lu MEI, Hong YU, Jeffrey Xu In software maintenance and evolution, it is common that developers want to apply a change to a number of similar places. Due to the size and complexity of the code base, it is challenging for developers to locate all the places that need the change. A main challenge in locating the places that need the change is that, these places share certain common dependence conditions but existing code searching techniques can hardly handle dependence relations satisfactorily. In this paper, we propose a technique that enables developers to make queries involving dependence conditions and textual conditions on the system dependence graph of the program. We carried out an empirical evaluation on four searching tasks taken from the development history of two real-world projects. The results of our evaluation indicate that, compared with code-clone detection, our technique is able to locate many required code elements that code-clone detection cannot locate, and compared with text search, our technique is able to effectively reduce false positives without losing any required code elements. 2010-09-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/1349 info:doi/10.1145/1858996.1859091 https://ink.library.smu.edu.sg/context/sis_research/article/2348/viewcontent/ase10_codesearch.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University System Dependence Graph Code Search Graph Indexing Software Engineering
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic System Dependence Graph
Code Search
Graph Indexing
Software Engineering
spellingShingle System Dependence Graph
Code Search
Graph Indexing
Software Engineering
WANG, Xiaoyin
LO, David
CHENG, Jiefeng
ZHANG, Lu
MEI, Hong
YU, Jeffrey Xu
Matching dependence-related queries in the system dependence graph.
description In software maintenance and evolution, it is common that developers want to apply a change to a number of similar places. Due to the size and complexity of the code base, it is challenging for developers to locate all the places that need the change. A main challenge in locating the places that need the change is that, these places share certain common dependence conditions but existing code searching techniques can hardly handle dependence relations satisfactorily. In this paper, we propose a technique that enables developers to make queries involving dependence conditions and textual conditions on the system dependence graph of the program. We carried out an empirical evaluation on four searching tasks taken from the development history of two real-world projects. The results of our evaluation indicate that, compared with code-clone detection, our technique is able to locate many required code elements that code-clone detection cannot locate, and compared with text search, our technique is able to effectively reduce false positives without losing any required code elements.
format text
author WANG, Xiaoyin
LO, David
CHENG, Jiefeng
ZHANG, Lu
MEI, Hong
YU, Jeffrey Xu
author_facet WANG, Xiaoyin
LO, David
CHENG, Jiefeng
ZHANG, Lu
MEI, Hong
YU, Jeffrey Xu
author_sort WANG, Xiaoyin
title Matching dependence-related queries in the system dependence graph.
title_short Matching dependence-related queries in the system dependence graph.
title_full Matching dependence-related queries in the system dependence graph.
title_fullStr Matching dependence-related queries in the system dependence graph.
title_full_unstemmed Matching dependence-related queries in the system dependence graph.
title_sort matching dependence-related queries in the system dependence graph.
publisher Institutional Knowledge at Singapore Management University
publishDate 2010
url https://ink.library.smu.edu.sg/sis_research/1349
https://ink.library.smu.edu.sg/context/sis_research/article/2348/viewcontent/ase10_codesearch.pdf
_version_ 1770570974089969664