Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chunpeng Yan

dblp:84/5500 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
1since 2021 · last 2025
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author

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.

Network and information security
1 paper
Blockchain and cryptocurrency security · 50% Systems and software security · 50%
Software engineering, system software, and programming languages
1 paper
Program analysis · 100%

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

TopicWeightPapersLastEvidence papers
Systems and software security › vulnerability management › patch management
patch presence test
0.912025
Lares: LLM-driven Code Slice Semantic Search for Patch Presence Testing · ASE 2025
Blockchain and cryptocurrency security › smart contract security
vulnerability detection
0.912025
Lares: LLM-driven Code Slice Semantic Search for Patch Presence Testing · ASE 2025
Program analysis
binary analysis
0.312025
Lares: LLM-driven Code Slice Semantic Search for Patch Presence Testing · ASE 2025

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

semantic search · 1.7large language model · 1.7SMT solver · 1.7
YearPublicationVenuePosition
2025 Lares: LLM-driven Code Slice Semantic Search for Patch Presence Testing
abstract
In modern software ecosystems, 1-day vulnerabilities pose significant security risks due to extensive code reuse. Identifying vulnerable functions in target binaries alone is insufficient; it is also crucial to determine whether these functions have been patched. Existing methods, however, suffer from limited usability and accuracy. They often depend on the compilation process to extract features, requiring substantial manual effort and failing for certain software. Moreover, they cannot reliably differentiate between code changes caused by patches or compilation variations.To overcome these limitations, we propose Lares, a scalable and accurate method for patch presence testing. Lares introduces Code Slice Semantic Search, which directly extracts features from the patch source code and identifies semantically equivalent code slices in the pseudocode of the target binary. By eliminating the need for the compilation process, Lares improves usability, while leveraging large language models (LLMs) for code analysis and SMT solvers for logical reasoning to enhance accuracy. Experimental results show that Lares achieves superior precision, recall, and usability. Furthermore, it is the first work to evaluate patch presence testing across optimization levels, architectures, and compilers. The datasets and source code used in this article are available at https://github.com/Siyuan-Li201/Lares.
Siyuan Li 0014, Yaowen Zheng, Hong Li 0004, Jingdong Guo, Chaopeng Dong, Chunpeng Yan, Weijie Wang 0005, Yimo Ren, Limin Sun 0001, Hongsong Zhu
ASE6
2009 Bounds on distributed TDOA-based localization of OFDM sources
abstract
One main drawback of using Time Difference of Arrival (TDOA) methods for source localization and navigation is that they require centralization of multiple copies of a signal. This paper considers blindly estimating the location of a Cyclic Prefix (CP) in an Orthogonal Frequency Division Multiplexing (OFDM) signal, enabling distributed TDOA computation up to an integer ambiguity. This ambiguity can be resolved using integer least-squares methods, if enough TDOAs are available. The contributions of this paper are derivation of the Cramer-Rao Lower Bound (CRLB) on locating the CP, and hence on the underlying source localization problem.
Richard Martin 0001, Chunpeng Yan, H. Howard Fan
ICASSP2
2009 Robust NLoS multipath mitigation for TOA estimation
abstract
A technique that consists of correlation followed by thresholding is widely used to mitigate multipath effects, especially in the presence of non-line-of-sight (NLoS) effects, for TOA estimation. In practice, an accurate threshold that the technique relies on is difficult to obtain, since optimizing the threshold requires prior knowledge of channel statistics and signal/noise power, which are not always known a priori nor are easy to estimate. In this paper, we propose a new thresholding method that does not rely on such prior knowledge and is robust against an inaccurate threshold.
Chunpeng Yan, H. Howard Fan, Richard Martin 0001
ICASSP1
2008 Asynchronous differential TDOA for non-GPS navigation using signals of opportunity
abstract
Non-GPS navigation techniques that use signals of opportunity (e.g. TV/AM broadcast signals with known source locations) without aid of satellite-based location systems (e.g. GPS) are promising since they use readily available strong signals that are not susceptible to blockage or jamming. However, problems such as large asynchronous clock offsets among receivers and large broadcast signal frequency offsets arise because broadcast signals are not dedicated for ranging purposes. In this paper, we propose an asynchronous differential time-difference-of-arrival (TDOA) positioning method to overcome the problems of biased signal frequencies and asynchronous receiver clocks. The proposed method eliminates the need for synchronous receiver clocks in the TDOA method and relaxes the tight timing constraint between receivers as required by the double-difference method in the differential GPS (dGPS).
Chunpeng Yan, H. Howard Fan
ICASSP1
2007 Asynchronous Differential TDOA for Sensor Self-Localization
abstract
Most methods for sensor self-localization require either synchronization or round trip communications among the networked sensors. A differential time-difference-of-arrival (dTDOA) method is proposed in this paper that does not require such time synchronization nor round trip communications, thus greatly reduces demand on sensor communications resources and makes implementation much easier. Theoretical results are presented for the principle of the new method and simulations are also given that confirm the effectiveness of the proposed method.
H. Howard Fan, Chunpeng Yan
ICASSP (2)2
2007 Asynchronous Self-Localization of Sensor Networks with Large Clock Drift
abstract
Large clock offsets and drifts impose many difficulties on sensor self-localization. We have proposed a differential time-difference-of-arrival (dTDOA) localization method in [1] to overcome the problem caused by asynchronous clock offsets. In this paper, the dTDOA method is extended to combat clock drifts by a two-stage clock-drift cancellation method. Furthermore, based on the clock-drift cancellation, a maximum likelihood estimation (MLE) method that is theoretically optimal for sensor locations is derived. The method can achieve sensor localization using a single round of time-of-arrival (TOA) measurements, and thus greatly reduces the communications burden and timing constraint.
Chunpeng Yan, H. Howard Fan
MobiQuitous1