Pengcheng Cao

dblp:213/9991 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
4since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Software testing · 75% Program analysis · 25%
Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 100%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%
Network and information security
1 paper
Blockchain and cryptocurrency security · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning and data management
active learning
1.012026
DALL: Data Labeling via Data Programming and Active Learning Enhanced by Large Language Models · CHI 2026
Machine learning and data management
data annotation
1.012026
DALL: Data Labeling via Data Programming and Active Learning Enhanced by Large Language Models · CHI 2026
Program analysis › symbolic execution
dynamic symbolic execution
0.612022
Probabilistic Path Prioritization for Hybrid Fuzzing · IEEE Trans. Dependable Secur. Comput. 2022
Software testing
fuzzing
0.612022
Probabilistic Path Prioritization for Hybrid Fuzzing · IEEE Trans. Dependable Secur. Comput. 2022
Software testing › fuzzing
hybrid fuzzing
0.612022
Probabilistic Path Prioritization for Hybrid Fuzzing · IEEE Trans. Dependable Secur. Comput. 2022
Software testing › test optimization
path prioritization
0.612022
Probabilistic Path Prioritization for Hybrid Fuzzing · IEEE Trans. Dependable Secur. Comput. 2022
Natural language and speech › Information extraction and text analysis › data annotation
LLM-based annotation
0.312026
DALL: Data Labeling via Data Programming and Active Learning Enhanced by Large Language Models · CHI 2026
Blockchain and cryptocurrency security › smart contract security
vulnerability detection
0.212022
Probabilistic Path Prioritization for Hybrid Fuzzing · IEEE Trans. Dependable Secur. Comput. 2022

Methods — techniques the papers use, named apart from their topics

large language model · 2.0data programming · 2.0active learning · 2.0probabilistic path prioritization · 1.1monte carlo methods · 0.6monte carlo method · 0.6
YearPublicationVenuePosition
2026 DALL: Data Labeling via Data Programming and Active Learning Enhanced by Large Language Models
abstract
Deep learning models for natural language processing rely heavily on high-quality labeled datasets. However, existing labeling approaches often struggle to balance label quality with labeling cost. To address this challenge, we propose DALL, a text labeling framework that integrates data programming, active learning, and large language models. DALL introduces a structured specification that allows users and large language models to define labeling functions via configuration, rather than code. Active learning identifies informative instances for review, and the large language model analyzes these instances to help users correct labels and to refine or suggest labeling functions. We implement DALL as an interactive labeling system for text labeling tasks. Comparative, ablation, and usability studies demonstrate DALL’s efficiency, the effectiveness of its modules, and its usability.
Guozheng Li 0002, Shaoxiang Wang, Yu Zhang 0043, Pengcheng Cao, Chi Harold Liu
CHI5
2025 Pruning remote photoplethysmography networks using weight-gradient joint criterion
Changchen Zhao, Shunhao Zhang, Pengcheng Cao, Shichao Cheng
Expert Syst. Appl.3
2025 WTC3D: An Efficient Neural Network for Noncontact Pulse Acquisition in Internet of Medical Things
abstract
Vision-based physiological monitoring is an emerging technology that enables a more convenient access of cardiovascular health status in many medical industrial applications. This article aims to achieve efficient and accurate identification of pulse waveforms by proposing a weighted temporally consistent 3-D (WTC3D) convolution, in which a spatial weight template is incorporated between the spatial and temporal kernels as a constraint for the temporal kernel. WTC3D employs a temporal kernel to keep temporal consistency and a spatial weight template to impose spatial diversity during the remote photoplethysmography (rPPG) feature learning. A WTC3D-based network with a hybrid loss function is designed for pulse prediction. Experiments on three datasets demonstrate the effectiveness of the proposed approach. By considering the temporal propagation characteristics of the pulse signal in the video, WTC3D convolution not only enables efficient pulse feature learning, but also advances the deployment of rPPG networks on source-limited Internet of medical things devices.
Changchen Zhao, Pengcheng Cao, Bin Huang 0014, Huiling Chen 0001, Jing Li 0027
IEEE Trans. Ind. Informatics2
2022 Probabilistic Path Prioritization for Hybrid Fuzzing
abstract
Hybrid fuzzing that combines fuzzing and concolic execution has become an advanced technique for software vulnerability detection. Based on the observation that fuzzing and concolic execution are complementary in nature, state-of-the-art hybrid fuzzing systems deploy “optimal concolic testing” and “demand launch” strategies. Although these ideas sound intriguing, we point out several fundamental limitations in them, due to unrealistic or oversimplified assumptions. Further, we propose a novel “discriminative dispatch” strategy and design a probabilistic hybrid fuzzing system to better utilize the capability of concolic execution. Specifically, we design a Monte Carlo-based probabilistic path prioritization model to quantify each path’s difficulty, and then prioritize them for concolic execution. Our model assigns the most difficult paths to concolic execution. We implement a prototype named${\sf DigFuzz}$and evaluate our system with two representative datasets and real-world programs. Results show that the concolic execution in${\sf DigFuzz}$outperforms than those in state-of-the-art hybrid fuzzing systems in every major aspect. In particular, the concolic execution in${\sf DigFuzz}$contributes to discovering more vulnerabilities (12 versus 5) and producing more code coverage (18.9 versus 3.8 percent) on the CQE dataset than the concolic execution in Driller.
Lei Zhao 0012, Pengcheng Cao, Yue Duan, Heng Yin 0001, Jifeng Xuan
IEEE Trans. Dependable Secur. Comput.2
2018 A Wireless Covert Channel Based on Constellation Shaping Modulation
abstract
Wireless covert channel is an emerging covert communication technique which conceals the very existence of secret information in wireless signal including GSM, CDMA, and LTE. The secret message bits are always modulated into artificial noise superposed with cover signal, which is then demodulated with the shared codebook at the receiver. In this paper, we first extend the traditional KS test and regularity test in covert timing channel detection into wireless covert channel, which can be used to reveal the very existence of secret data in wireless covert channel from the aspect of multiorder statistics. In order to improve the undetectability, a wireless covert channel for OFDM-based communication system based on constellation shaping modulation is proposed, which generates additional constellation points around the standard points in normal constellations. The carrier signal is then modulated with the dirty constellation and the secret message bits are represented by the selection mode of the additional constellation points; shaping modulation is employed to keep the distribution of constellation errors unchanged. Experimental results show that the proposed wireless covert channel scheme can resist various statistical detections. The communication reliability under typical interference is also proved.
Pengcheng Cao, Weiwei Liu 0002, Guangjie Liu 0001, Xiaopeng Ji, Jiangtao Zhai, Yuewei Dai
Secur. Commun. Networks1