Haodi Ping

Haodi Ping

Auto-generated profile, based on publicly available information

Haodi Ping

Beijing University of Technology, Beijing, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
12 February 2018 in Personal and Ubiquitous Computing
Verified
Journal Article
Closed access
PDF file
HPHaodi Ping
Haodi Ping
ZZZhangbing Zhou
Zhangbing Zhou
ZSZhensheng Shi
Zhensheng Shi
TRTaj Rahman
Taj Rahman

4 October 2025 in ACM Transactions on Software Engineering and Methodology
Verified
Journal Article
Open access
JWJinfeng Wen
Jinfeng Wen
ZCZhenpeng Chen
Zhenpeng Chen
JZJianshu Zhao
Jianshu Zhao
FSFederica Sarro
Federica Sarro
HPHaodi Ping
Haodi Ping
XLXuanzhe Liu
Xuanzhe Liu
Serverless computing is a popular cloud computing paradigm that has found widespread adoption across various online workloads. It allows software engineers to develop cloud applications as a set of functions (called serverless functions ). However, accurately measuring the performance (i.e., end-to-end response latency) of serverless functions is challenging due to the highly dynamic nature of the environment in which they run. To tackle this problem, a potential solution is to apply checks of performance testing techniques to determine how many repetitions of a given serverless function across a range of inputs are needed to cater to the performance fluctuation. However, the available literature lacks performance testing approaches designed explicitly for serverless computing. In this article, we propose the first serverless computing-oriented performance testing (SCOPE) approach. SCOPE takes into account the unique performance characteristics of serverless functions, such as their short execution durations and on-demand triggering. As such, SCOPE is designed as a fine-grained analysis approach. SCOPE incorporates the accuracy check and the consistency check to obtain the accurate and reliable performance of serverless functions. The evaluation shows that SCOPE provides testing results with 97.25% accuracy, 33.83 percentage points higher than the best currently available technique. Moreover, the superiority of SCOPE over the state-of-the-art holds on all functions that we study.

12 March 2026 in ACM Transactions on Software Engineering and Methodology
Verified
Journal Article
Open access
JWJinfeng Wen
Jinfeng Wen
ZCZhenpeng Chen
Zhenpeng Chen
ZZZixi Zhu
Zixi Zhu
FSFederica Sarro
Federica Sarro
YLYi Liu
Yi Liu
SWShangguang Wang
Shangguang Wang
Serverless computing is a popular cloud computing paradigm that enables developers to build applications at the function level, known as serverless applications. The Serverless Application Model (AWS SAM) is the most widely adopted configuration schema. However, misconfigurations pose a significant challenge due to the complexity of serverless configurations and the limitations of traditional data-driven techniques. Recent advancements in Large Language Models (LLMs), pre-trained on large-scale public data, offer promising potential for identifying and explaining misconfigurations. In this article, we present SlsDetector , the first framework that harnesses the capabilities of LLMs to perform static misconfiguration detection in serverless applications. SlsDetector utilizes effective prompt engineering with zero-shot prompting to identify configuration issues. It designs multi-dimensional constraints aligned with serverless configuration characteristics and leverages the Chain of Thought technique to enhance LLM inferences, alongside generating structured responses. We evaluate SlsDetector on a curated dataset of 110 configuration files, which includes correct configurations, real-world misconfigurations, and intentionally injected errors. Our results show that SlsDetector , based on ChatGPT-4o (one of the most representative LLMs), achieves a precision of 72.88%, recall of 88.18%, and F1-score of 79.75%, outperforming state-of-the-art data-driven methods by 53.82, 17.40, and 49.72 percentage points, respectively. We further investigate the generalization capability of SlsDetector across recent LLMs, including Llama 3.1 (405B) Instruct Turbo, Gemini 1.5 Pro, and DeepSeek V3, with consistently high effectiveness.

11 August 2020 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
HPHaodi Ping
Haodi Ping
Yongcai WangYongcai Wang
Yongcai Wang
DLDeying Li
Deying Li
TSTianyuan Sun
Tianyuan Sun
Inferring network topology via inter-node distance measurements is an important problem. It is challenging when the distance measurements are sparse because the lack of edge constraints may lead to ambiguous realizations that differ greatly from the ground truth. The flipping ambiguities are caused by binary vertex cut sets in 2D and triple vertex cut sets in 3D, which are called separators . This paper investigates conditions on whether the flipping ambiguities caused by these separators can be disambiguated using neighborhood, full graph, and component-level conditions. Accordingly, local flipping-free condition (LFFC), global flipping-free condition (GFFC), and component-based flipping free condition (CFFC) are proposed. Then a disambiguating framework based on a combinatorial application of these conditions is proposed. It detects separators and first disambiguate separators locally by LFFC, which converts the graph to a binary tree, whose leaf nodes are flipping-free components and edges are LFFC unsolvable separators. Then the CFFC condition is further applied to disambiguate LFFC unsolvable separators between components. If $k$ and $g$ separators are disambiguated by LFFC and CFFC respectively, the number of ambiguous solutions for network localization will be reduced by ${2^{k+g}}$ times. Finally, the flipping-free components realize node coordinates in their local coordinate systems and a residue-based weighted component stitching algorithm (RWCS) is proposed to iteratively synchronize components’ local coordinates to generate global coordinates of the network. Extensive simulations show the LFFC, CFFC and RWCS frameworks are efficient, which resolve a major portion of flipping ambiguities and greatly improve the localization accuracy than the state of art algorithms in various sparse network settings.

8 December 2022 in ACM Transactions on Sensor Networks
Verified
Journal Article
Open access
HPHaodi Ping
Haodi Ping
Yongcai WangYongcai Wang
Yongcai Wang
XSXingfa Shen
Xingfa Shen
DLDeying Li
Deying Li
WCWenping Chen
Wenping Chen
Determining whether nodes can be uniquely localized, called localizability detection, is a concomitant problem in network localization. Localizability detection under the traditional Non-Linear Localization (NLL) schema has been well explored, whereas localizability under the emerging Barycentric coordinate-based Linear Localization (BLL) schema has not been well investigated. Non-awareness of the node localizability in BLL may cause theoretically localizable nodes to converge to wrong locations because their locations are impacted by the wrong locations of the unlocalizable nodes through the iterative location propagation. In this article, the deficiency of existing localizability theories and algorithms in BLL is firstly investigated and then a necessary condition and a sufficient condition for BLL node localizability detection are proposed. Based on these two conditions, an efficient Iterative Maximum Flow (IMF) algorithm is designed to identify BLL localizable nodes, and only localizable nodes are selected to enable a Localizability Aware Barycentric Linear Localization (LABLL) algorithm, which can guarantee the locations of the localizable nodes converging correctly. The proposed IMF and LABLL algorithms are validated by both theoretical analysis and experimental evaluations.

4 February 2023 in Results in Control and Optimization
Verified
Journal Article
Open access
HPHaodi Ping
Haodi Ping
Yongcai WangYongcai Wang
Yongcai Wang
CWChengcun Wei
Chengcun Wei
JXJin Xi
Jin Xi
TZTaoming Zhang
Taoming Zhang
YGYong Gao
Yong Gao