JWJunyong Wang

Junyong Wang

*This is an algorithmically generated author record based on publicly available information.

Junyong Wang has a total of 22 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • ContractScanner: Detecting and Localizing Vulnerabilities of Smart Contracts via Graph-Based Semantic Modeling of Source Code

    by Bin Wang, Shan Li, Xiaohan Yuan, Xueshuo Xie, Junyong Wang, Tao Li, Wei Wang

    Smart contract vulnerabilities pose persistent threats to decentralized applications, causing substantial financial losses across the Web 3.0 ecosystem. Although recent deep learning-based detectors improve scalability, they face two key limitations: (i) limited semantic fidelity because bytecode- or sequence-level representations fail to capture contextual dependencies; and (ii) inadequate vulnerability localization, as most approaches are confined to contract-level classification, limiting their audit utility. To address these challenges, we present ContractScanner for joint vulnerability detection and fine-grained localization directly from the source code. First, we propose an anchor-aware semantic slicing method to filter contracts into vulnerability-relevant regions by matching structural anchor patterns and preserving contextual dependencies. Second, we transform these slices into heterogeneous program graphs that encode control, data, and syntactic flows.We then apply a dual-stage reasoning pipeline. A Graph Isomorphism Network (GIN) extracts global structural features for contract-level classification, while a Graph Autoencoder (GAE) reconstructs fine-grained topological patterns to localize vulnerability-critical code regions. Third, to address data scarcity, we introduce anchor-guided G-Mixup, which generates augmented training samples by interpolating feature embeddings of contract slices with similar vulnerability semantics. We evaluate ContractScanner on two real-world benchmarks spanning five major vulnerability types—reentrancy, integer overflow/underflow, timestamp dependency, and callstack depth exhaustion. Our method achieves an average F1-score of 94.74%, significantly outperforming symbolic analyzers, classical learning models, and prior graph-based methods.


  • FedEditor: Efficient and Effective Federated Unlearning in Cooperative Intelligent Transportation Systems

    by Xiaohan Yuan, Jiqiang Liu, Bin Wang, Guorong Chen, Xiangrui Xu, Junyong Wang, Tao Li, Wei Wang

    In cooperative intelligent transportation systems (CITS), federated learning enables vehicles to train a global model without sharing private data. However, the lack of an unlearning mechanism to remove the influence of vehicle-specified data from the global model potentially violates data protection regulations regarding the right to be forgotten. While the existing federated unlearning (FU) methods exhibit promising unlearning effects, their practicality in CITS is hindered due to the time-consuming retraining steps required by other vehicles and the non-negligible performance sacrifice on the un-forgotten data. Therefore, achieving effective unlearning without extensive retraining, while minimizing performance degradation on the un-forgotten data remains a challenge. In this work, we propose FedEditor, an efficient and effective FU framework in CITS that addresses the above challenge by reconfiguring the global model’s representation space to remove critical classification-related knowledge from the unlearned data. Firstly, FedEditor enables vehicles to perform the unlearning process locally on the global model, eliminating the participation of other vehicles and improving efficiency. Secondly, FedEditor captures and aligns the representations of the unlearned data with those of the nearest incorrect class centroid derived from non-training data, ensuring effective unlearning while preserving the un-forgotten data’s knowledge relatively intact for achieving competitive model performance. Finally, FedEditor refines the global model’s output distributions using the vehicles’ remaining data and incorporates a drift-mitigating regularization term, minimizing the negative impact of unlearning operations on model performance. Experimental results show that FedEditor reduces the unlearning rate by up to 99.64% without time-consuming retraining, while limiting the predictive performance loss of the resulting global model to less than 3.88% across five models and seven datasets.


  • Two-in-One Solution: Simultaneously Enhancing Security and Privacy for Data-Driven Models in Mobile Edge Computing

    by Pengrui Liu, Xiaohan Yuan, Wei Wang, Xiangrui Xu, Tao Li, Junyong Wang, Bin Wang, Witold Pedrycz

    Data-driven models are widely employed in Mobile Edge Computing to satisfy the demands of Emerging Consumer Applications. However, previous work demonstrates that data-driven models are susceptible to security threats like Backdoor and Evasion Attacks or privacy threats like Membership Inference Attacks. Numerous existing methods for mitigating these threats have been proposed. However, these methods focus solely on enhancing model security or only on improving model privacy. Ideally, data-driven models should enhance model security and privacy simultaneously. In this paper, we propose methods that combine individual security-enhancing and privacy-enhancing methods to mitigate the security and privacy threats of data-driven models simultaneously. We evaluate the effectiveness of individual security-enhancing methods, individual privacy-enhancing methods, and our methods in simultaneously enhancing model security and privacy. Our comprehensive experimental analysis reveals two-fold insights. First, individual security-enhancing methods can either enhance or diminish model privacy, while individual privacy-enhancing methods face challenges in enhancing model security. Second, our methods improve the effectiveness of simultaneously enhancing model security and privacy compared to the individual methods.


  • Eyes on Federated Recommendation: Targeted Poisoning With Competition and Its Mitigation

    by Yurong Hao, Xihui Chen, Wei Wang, Jiqiang Liu, Tao Li, Junyong Wang, Witold Pedrycz

    Federated recommendation (FR) addresses privacy concerns in recommender systems by training a global model without requiring raw user data to leave individual devices. A server, known as the aggregator, integrates users’ local gradients and updates the global model parameters. However, FR is vulnerable to attacks where malicious users manipulate these updates, known as model poisoning attacks. In this work, we propose a new targeted attack called StairClimbing to promote specific items through model poisoning, and a new defence mechanism CrossEU. StairClimbing adopts a new strategy resembling stair climbing to enable target items to beat competitive items and increase their popularity level by level. Compared to prior attacks, StairClimbing guarantees balanced effectiveness , efficiency and stealthiness simultaneously. Our defence mechanism CrossEU leverages two patterns regarding the lists of items updated by benign users between iterative epochs. Extensive experiments on six real-world datasets demonstrate StairClimbing’s superiority across all three desirable attack properties, even with a small proportion of malicious users (1%). In addition, CrossEU effectively delays the impact of all tested attacks and even eliminates their damage entirely.


  • Multi-Misconfiguration Diagnosis via Identifying Correlated Configuration Parameters

    by Yingnan Zhou, Xue Hu, Sihan Xu, Yan Jia, Yuhao Liu, Junyong Wang, Guangquan Xu, Wei Wang, Shaoying Liu, Thar Baker

    Software configuration requires that the user sets appropriate values to specified variables, known as configuration parameters, which potentially affect the behaviors of software system. It is an essential means for software reliability, but how to ensure correct configurations remains a great challenge, especially when a large number of parameter settings are involved. Existing studies on misconfiguration diagnosis treat all configurations independently, ignoring the constraints and correlations among different configurations. In this paper, we reveal the phenomenon of multi-misconfigurations and present a tool, MMD, for multi-misconfigurations diagnosis. Specifically, MMD consists of two modules: Correlated Configurations Analysis and Primary Misconfigurations Diagnosis. The former determines the correlation among each pair of configurations by analyzing the control and data flows related to each configuration. The latter is responsible for collecting a list of configurations ranked according to their suspiciousness. Combining the outputs of two modules, MMD is able to assist the user in multi-misconfigurations diagnosis. We evaluate MMD on seven popular Java projects: Randoop, Soot, Synoptic, Hdfs, Hbase, Yarn, and Zookeeper. MMD identifies 510 configuration correlations with a 4.9% false positive rate. Furthermore, it effectively diagnoses 22 multi-misconfigurations collected from StackOverflow, outperforming two state-of-the-art baselines.