Jianlei Chi

Jianlei Chi

Auto-generated profile, based on publicly available information

Jianlei Chi

Xidian University Hangzhou Institute of Technology, Hangzhou, China

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 September 2022 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
JZJiajun Zhou
Jiajun Zhou
CHChenkai Hu
Chenkai Hu
JCJianlei Chi
Jianlei Chi
Jiajing WuJiajing Wu
Jiajing Wu
MSMeng Shen
Meng Shen
QXQi Xuan
Qi Xuan
Blockchain technology has the characteristics of decentralization, traceability and tamper-proof, which creates a reliable decentralized trust mechanism, further accelerating the development of blockchain finance. However, the anonymization of blockchain hinders market regulation, resulting in increasing illegal activities such as money laundering, gambling and phishing fraud on blockchain financial platforms. Thus, financial security has become a top priority in the blockchain ecosystem, calling for effective market regulation. In this paper, we consider identifying Ethereum accounts from a graph classification perspective, and propose an end-to-end graph neural network framework named Ethident, to characterize the behavior patterns of accounts and further achieve account de-anonymization. Specifically, we first construct an Account Interaction Graph (AIG) using raw Ethereum data. Then we design a hierarchical graph attention encoder named HGATE as the backbone of our framework, which can effectively characterize the node-level account features and subgraph-level behavior patterns. For alleviating account label scarcity, we further introduce contrastive self-supervision mechanism as regularization to jointly train our framework. Comprehensive experiments on Ethereum datasets demonstrate that our framework achieves superior performance in account identification, yielding 1.13% $\sim ~4.93$ % relative improvement over previous state-of-the-art. Furthermore, detailed analyses illustrate the effectiveness of Ethident in identifying and understanding the behavior of known participants in Ethereum (e.g. exchanges, miners, etc.), as well as that of the lawbreakers (e.g. phishing scammers, hackers, etc.), which may aid in risk assessment and market regulation.

7 March 2022 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
JCJianlei Chi
Jianlei Chi
YQYu Qu
Yu Qu
TLTing Liu
Ting Liu
QZQinghua Zheng
Qinghua Zheng
HYHeng Yin
Heng Yin
Software vulnerabilities are now reported unprecedentedly due to the recent development of automated vulnerability hunting tools. However, fixing vulnerabilities still mainly depends on programmers' manual efforts. Developers need to deeply understand the vulnerability and affect the system's functions as little as possible. In this paper, with the advancement of Neural Machine Translation (NMT) techniques, we provide a novel approach called SeqTrans to exploit historical vulnerability fixes to provide suggestions and automatically fix the source code. To capture the contextual information around the vulnerable code, we propose to leverage data-flow dependencies to construct code sequences and feed them into the state-of-the-art transformer model. The fine-tuning strategy has been introduced to overcome the small sample size problem. We evaluate SeqTrans on a dataset containing 1,282 commits that fix 624 CVEs in 205 Java projects. Results show that the accuracy of SeqTrans outperforms the latest techniques and achieves 23.3% in statement-level fix and 25.3% in CVE-level fix. In the meantime, we look deep inside the result and observe that the NMT model performs very well in certain kinds of vulnerabilities like CWE-287 (Improper Authentication) and CWE-863 (Incorrect Authorization).

14 January 2019 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
YQYu Qu
Yu Qu
QZQinghua Zheng
Qinghua Zheng
JCJianlei Chi
Jianlei Chi
YJYangxu Jin
Yangxu Jin
AHAncheng He
Ancheng He
TLTing Liu
Ting Liu
In recent years, Complex Network theory and graph algorithms have been proved to be effective in predicting software bugs. On the other hand, as a widely-used algorithm in Complex Network theory, k-core decomposition has been used in software engineering domain to identify key classes. Intuitively, key classes are more likely to be buggy since they participate in more functions or have more interactions and dependencies. However, there is no existing research uses k-core decomposition to analyze software bugs. To fill this gap, we firstly use k-core decomposition on Class Dependency Networks to analyze software bug distribution from a new perspective. An interesting and widely existed tendency is observed: for classes in k-cores with larger k values, there is a stronger possibility for them to be buggy. Based on this observation, we then propose a simple but effective equation named as top-core which improves the order of classes in the suspicious class list produced by effort-aware bug prediction models. Based on an empirical study on 18 open-source Java systems, we show that the bug prediction models' performances are significantly improved in 85.2% experiments in the cross-validation scenario and in 80.95% experiments in the forward-release scenario, after using top-core. The models' average performances are improved by 11.5% and 12.6%, respectively. It is concluded that the proposed top-core equation can help the testers or code reviewers locate the real bugs more quickly and easily in software bug prediction practices.

22 June 2025 in Proceedings of the ACM on Software Engineering
Verified
Journal Article
Open access
JCJianlei Chi
Jianlei Chi
XWXiaotian Wang
Xiaotian Wang
YHYuhan Huang
Yuhan Huang
LYLechen Yu
Lechen Yu
DCDi Cui
Di Cui
JSJun Sun
Jun Sun
Synchronizing production and test code, known as PT co-evolution, is critical for software quality. Given the significant manual effort involved, researchers have tried automating PT co-evolution using predefined heuristics and machine learning models. However, existing solutions are still incomplete. Most approaches only detect and flag obsolete test cases, leaving developers to manually update them. Meanwhile, existing solutions may suffer from low accuracy, especially when applied to real-world software projects. In this paper, we propose ReAccept, a novel approach leveraging large language models (LLMs), retrievalaugmented generation (RAG), and dynamic validation to fully automate PT co-evolution with high accuracy. ReAccept employs an experience-guided approach to generate prompt templates for the identification and subsequent update processes. After updating a test case, ReAccept performs dynamic validation by checking syntax, verifying semantics, and assessing test coverage. If the validation fails, ReAccept leverages the error messages to iteratively refine the patch. To evaluate ReAccept's effectiveness, we conducted extensive experiments with a dataset of 537 Java projects and compared ReAccept's performance with several stateof-the-art methods. The evaluation results show that ReAccept achieved an update accuracy of 60.16% on the correctly identified obsolete test code, surpassing the state-of-the-art technique CEPROT by 90%. These findings demonstrate that ReAccept can effectively maintain test code, improve overall software quality, and significantly reduce maintenance effort.

23 September 2025 in Information Fusion
Verified
Journal Article
Closed access
XZXiaodong Zhang
Xiaodong Zhang
JBJie Bao
Jie Bao
JCJianlei Chi
Jianlei Chi
JSJun Sun
Jun Sun
ZYZijiang Yang
Zijiang Yang

3 September 2016
Verified
Conference Paper
Open access
PDF file
WJWuxia Jin
Wuxia Jin
TLTing Liu
Ting Liu
YQYu Qu
Yu Qu
JCJianlei Chi
Jianlei Chi
DCDi Cui
Di Cui
QZQinghua Zheng
Qinghua Zheng
Instead of developing single-server software system for the powerful computers, the software is turning from large single-server to multi-server system such as distributed system. This change introduces a new challenge for the software quality measurement, since the current software analysis methods for single-server software could not observe and assess the correlation among the components on different nodes. In this paper, a new dynamic cohesion approach is proposed for distributed system. We extend Calling Network model for distributed system by differentiating methods of components deployed on different nodes. Two new cohesion metrics are proposed to describe the correlation at component level, by extending the cohesion metric of single-server software system. The experiments, conducted on a distributed systems-Netflix RSS Reader, present how to trace the various system functions accomplished on three nodes, how to abstract dynamic behaviors using our model among different nodes and how to evaluate the software cohesion on distributed system.