Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jingdong Shu

dblp:249/8412 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Software engineering, system software, and programming languages
1 paper
Program analysis · 100%
Artificial intelligence
1 paper
Deep learning architectures and training · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › document retrieval › domain-specific retrieval
code search
0.412019
Multi-modal Attention Network Learning for Semantic Source Code Retrieval · ASE 2019
Information retrieval › document retrieval › domain-specific retrieval › code search
semantic code search
0.412019
Multi-modal Attention Network Learning for Semantic Source Code Retrieval · ASE 2019
Program analysis › program representation
source code representation
0.412019
Multi-modal Attention Network Learning for Semantic Source Code Retrieval · ASE 2019
Machine learning › Deep learning architectures and training
attention mechanism
0.112019
Multi-modal Attention Network Learning for Semantic Source Code Retrieval · ASE 2019

Methods — techniques the papers use, named apart from their topics

gated graph neural network · 1.1LSTM · 1.1multimodal attention · 0.8Tree-LSTM · 0.8tree-LSTM · 0.4multi-modal attention · 0.4
YearPublicationVenuePosition
2019 Multi-modal Attention Network Learning for Semantic Source Code Retrieval
abstract
Code retrieval techniques and tools have been playing a key role in facilitating software developers to retrieve existing code fragments from available open-source repositories given a user query (e.g., a short natural language text describing the functionality for retrieving a particular code snippet). Despite the existing efforts in improving the effectiveness of code retrieval, there are still two main issues hindering them from being used to accurately retrieve satisfiable code fragments from large-scale repositories when answering complicated queries. First, the existing approaches only consider shallow features of source code such as method names and code tokens, but ignoring structured features such as abstract syntax trees (ASTs) and control-flow graphs (CFGs) of source code, which contains rich and well-defined semantics of source code. Second, although the deep learning-based approach performs well on the representation of source code, it lacks the explainability, making it hard to interpret the retrieval results and almost impossible to understand which features of source code contribute more to the final results. To tackle the two aforementioned issues, this paper proposes MMAN, a novel Multi-Modal Attention Network for semantic source code retrieval. A comprehensive multi-modal representation is developed for representing unstructured and structured features of source code, with one LSTM for the sequential tokens of code, a Tree-LSTM for the AST of code and a GGNN (Gated Graph Neural Network) for the CFG of code. Furthermore, a multi-modal attention fusion layer is applied to assign weights to different parts of each modality of source code and then integrate them into a single hybrid representation. Comprehensive experiments and analysis on a large-scale real-world dataset show that our proposed model can accurately retrieve code snippets and outperforms the state-of-the-art methods.
Yao Wan 0001, Jingdong Shu, Yulei Sui, Guandong Xu, Zhou Zhao 0001, Jian Wu 0001, Philip S. Yu
ASE2