Yun Lin

Yun Lin

Auto-generated profile, based on publicly available information

Yun Lin

Shanghai Jiao Tong University, Shanghai, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
14 February 2019 in IEEE Communications Surveys & Tutorials
Verified
Journal Article
Closed access
Pardeep KumarPardeep Kumar
Pardeep Kumar
YLYun Lin
Yun Lin
GBGuangdong Bai
Guangdong Bai
APAndrew Paverd
Andrew Paverd
JDJin Song Dong
Jin Song Dong
AMAndrew Martin
Andrew Martin
Smart grid (SG) networks are newly upgraded networks of connected objects that greatly improve reliability, efficiency and sustainability of the traditional energy infrastructure. In this respect, the smart metering infrastructure (SMI) plays an important role in controlling, monitoring and managing multiple domains in the SG. Despite the salient features of SMI, security and privacy issues have been under debate because of the large number of heterogeneous devices that are anticipated to be coordinated through public communication networks. This survey paper shows a brief overview of real cyber attack incidents in traditional energy networks and those targeting the smart metering network. Specifically, we present a threat taxonomy considering: (i) threats in system-level security, (ii) threats and/or theft of services, and (iii) threats to privacy. Based on the presented threats, we derive a set of security and privacy requirements for SG metering networks. Furthermore, we discuss various schemes that have been proposed to address these threats, considering the pros and cons of each. Finally, we investigate the open research issues to shed new light on future research directions in smart grid metering networks.

7 January 2025 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
YCYufan Cai
Yufan Cai
ZHZhe Hou
Zhe Hou
DSDavid Sanan
David Sanan
XLXiaokun Luan
Xiaokun Luan
YLYun Lin
Yun Lin
JDJin Song Dong
Jin Song Dong
Recently, the rise of code-centric Large Language Models (LLMs) has reshaped the software engineering world with low-barrier tools like Copilot that can easily generate code. However, there is no correctness guarantee for the code generated by LLMs, which suffer from the hallucination problem, and their output is fraught with risks. Besides, the end-to-end process from specification to code through LLMs is a non-transparent and uncontrolled black box. This opacity makes it difficult for users to understand and trust the generated code. Addressing these challenges is both necessary and critical. In contrast, program refinement transforms high-level specification statements into executable code while preserving correctness. Traditional tools for program refinement are primarily designed for formal methods experts and lack automation and extensibility. We apply program refinement to guide LLM and validate the LLM-generated code while transforming refinement into a more accessible and flexible framework. To initiate this vision, we propose Refine4LLM, an approach that aims to:(1) Formally refine the specifications, (2) Automatically prompt and guide the LLM using refinement calculus, (3) Interact with the LLM to generate the code, (4) Verify that the generated code satisfies the constraints, thus guaranteeing its correctness, (5) Learn and build more advanced refinement laws to extend the refinement calculus. We evaluated Refine4LLM against the state-of-the-art baselines on program refinement and LLMs benchmarks. The experiment results show that Refine4LLM can efficiently generate more robust code and reduce the time for refinement and verification.

18 August 2021
Verified
Conference Paper
Open access
YLYun Lin
Yun Lin
YOYou Sheng Ong
You Sheng Ong
JSJun Sun
Jun Sun
GFGordon Fraser
Gordon Fraser
JDJin Song Dong
Jin Song Dong
Search-based software testing (SBST) generates tests using search algorithms guided by measurements gauging how far a test case is away from exercising a coverage goal. The effectiveness of SBST largely depends on the continuity and monotonicity of the fitness landscape decided by these measurements and the search operators. Unfortunately, the fitness landscape is challenging when the function under test takes object inputs, as classical measurement hardly provide guidance for constructing legitimate object inputs. To overcome this problem, we propose test seeds, i.e., test code skeletons of legitimate objects which enable the use of classical measurements. Given a target branch in a function under test, we first statically analyze the function to build an object construction graph that captures the relation between the operands of the target method and the states of their relevant object inputs. Based on the graph, we synthesize test template code where each "slot" is a mutation point for the search algorithm. This approach can be seamlessly integrated with existing SBST algorithms, and we implemented EvoObj on top of EvoSuite. Our experiments show that EvoObj outperforms EvoSuite with statistical significance on 2750 methods over 103 open source Java projects using state-of-the-art SBST algorithms.

28 December 2020 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
QLQian Li
Qian Li
YQYong Qi
Yong Qi
QHQingyuan Hu
Qingyuan Hu
SQSaiyu Qi
Saiyu Qi
YLYun Lin
Yun Lin
JDJin Song Dong
Jin Song Dong
Adversarial Examples threaten to fool deep learning models to output erroneous predictions with high confidence. Optimization-based methods for constructing such samples have been extensively studied. While being effective in terms of aggression, they typically lack clear interpretation and constraint about their underlying generation process, which thus hinders us from leveraging the produced adversarial samples for model protection in the reverse direction. Hence, we expect them to repair bugs in the pre-trained models by produced additional training data equipped with strong attack ability rather than time-consuming full re-training from scratch. To address these issues, we first study the black-box behaviors and the intrinsic deficiency of neighborhood information in previous optimization-based adversarial attacks and defenses, respectively. Then we introduce a new method dubbed FeaCP, which uses correct predicted samples in disjoint classes to guide the generation of more explainable adversarial samples in the ambiguous region around the decision boundary instead of uncontrolled “blind spots", via convex combination in a feature component-wise manner which takes the individual importance of feature ingredients into account. Our method incorporates the prior fact that for well-separated samples, the path connecting them would go through model’s decision-boundary that lies in a low-density region, however, wherein adversarial examples are spread with high probability, thus having an impact on the ultimate trained model. In our work, the path is constructed by proposed inhomogeneous feature-wise convex interpolation rather than operating on sample-wise level, limiting the search space of FeaCP to obtain an adaptive neighborhood. Finally, we provide detailed insights and extend our method to adversarial fine-tuning using vicinity distribution to optimize the approximated decision boundary, and validate the significance of our FeaCP to model performance. The experimental results show that our method provides competitive performance on various datasets and networks.

25 October 2019 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
HWHaijun Wang
Haijun Wang
YLYun Lin
Yun Lin
ZYZijiang Yang
Zijiang Yang
JSJun Sun
Jun Sun
YLYang Liu
Yang Liu
TLTing Liu
Ting Liu

18 June 2022 in Journal of Systems and Software
Verified
Journal Article
Closed access
JYJiaming Ye
Jiaming Ye
MMMingliang Ma
Mingliang Ma
YLYun Lin
Yun Lin
LMLei Ma
Lei Ma
YXYinxing Xue
Yinxing Xue
JZJianjun Zhao
Jianjun Zhao