Mengda He

Mengda He

Auto-generated profile, based on publicly available information

Mengda He

Teesside University, Middlesbrough, United Kingdom

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
12 April 2024
Verified
Conference Paper
Open access
ZXZhiwu Xu
Zhiwu Xu
BWBohao Wu
Bohao Wu
CWCheng Wen
Cheng Wen
BZBin Zhang
Bin Zhang
SQShengchao Qin
Shengchao Qin
MHMengda He
Mengda He
Rust libraries are ubiquitous in Rust-based software development. Guaranteeing their correctness and reliability requires thorough analysis and testing. Fuzzing is a popular bug-finding solution, yet it requires writing fuzz targets for libraries. Recently, some automatic fuzz target generation methods have been proposed. However, two challenges remain: (1) how to generate diverse API sequences that prioritize unsafe code and interactions to reveal bugs in Rust libraries; (2) how to provide support for the generic APIs and verify both syntactic and semantic validity of the fuzz targets to enable more comprehensive testing of Rust libraries. In this paper, we propose RPG, an automatic fuzz target synthesis technique to support Rust library fuzzing. RPG uses a pool-based search to generate diverse and unsafe API sequences, and synthesizes fuzz targets with generic support and validity check. The experimental results demonstrate that RPG enhances both the quality of the generated fuzz targets and the bug-finding ability through pool-based generation and generic support, substantially outperforming the state-of-the-art. Moreover, RPG has discovered 25 previously unknown bugs from 50 well-known Rust libraries available on Crates.io.

21 December 2024 in Expert Systems with Applications
Verified
Journal Article
Open access
CRChirine Riachy
Chirine Riachy
MHMengda He
Mengda He
SJSina Joneidy
Sina Joneidy
SQShengchao Qin
Shengchao Qin
TPTim Payne
Tim Payne
Claudio AngioneClaudio Angione
Claudio Angione

5 September 2024 in Formal Aspects of Computing
Verified
Journal Article
Open access
LXLili Xiao
Lili Xiao
HZHuibiao Zhu
Huibiao Zhu
Sini ChenSini Chen
Sini Chen
MHMengda He
Mengda He
SQShengchao Qin
Shengchao Qin
The C and C++ languages introduced the relaxed-memory concurrency into the language specification for efficiency purposes in 2011. Trace semantics can provide the mathematical foundation for the proposed C++11 memory model, and there is a lack of investigation of trace semantics for C++11. The Promising Semantics (PS) of Kang et al. provides the standard SC-style operational semantics for the C++11 concurrency model, where “SC” refers to “Sequential Consistency”. Inspired by PS, in this article we first investigate the trace semantics for the relaxed read and write accesses under C++11, acting in the denotational semantics style. In our semantic model, a trace is in the form of a sequence of snapshots, and the snapshots record the modification in the relevant global or local variables, and the thread view. Moreover, the trace semantics for the release/acquire accesses under C++11 is also explored, based on the separated thread views and newly added message views. When considering this trace model, different accesses bring in their unique snapshots, and make distinguished effects on the production of the sequences. For any given program, the proposed trace semantics in this article produces all the valid traces directly. Furthermore, our trace semantics, together with that for TSO and MCA ARMv8, has the possibility to be the foundation of the meta model of the trace semantics for weak memory models.

23 June 2025 in Journal of Circuits, Systems and Computers
Verified
Journal Article
Closed access
LXLili Xiao
Lili Xiao
ZHZhiru Hou
Zhiru Hou
HZHuibiao Zhu
Huibiao Zhu
MHMengda He
Mengda He
SQShengchao Qin
Shengchao Qin