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

Jiasheng Jiang

dblp:322/2416 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2026
0000-0003-0875-5793ORCID · reported

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

Security and privacy · 2 · 2 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 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
3 papers
Program analysis · 61% Software maintenance and evolution · 29% Empirical software engineering · 10%
Network and information security
2 papers
Systems and software security · 63% Blockchain and cryptocurrency security · 20% Web and mobile security · 17%

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

TopicWeightPapersLastEvidence papers
Program analysis › error detection
API misuse detection
1.822026
SFA-Miner: Mining Path-Sensitive API Usage Patterns Via Symbolic Finite Automata · SP 2026
APP-Miner: Detecting API Misuses via Automatically Mining API Path Patterns · SP 2024
Software maintenance and evolution › API usage
API usage pattern mining
1.822026
SFA-Miner: Mining Path-Sensitive API Usage Patterns Via Symbolic Finite Automata · SP 2026
APP-Miner: Detecting API Misuses via Automatically Mining API Path Patterns · SP 2024
Program analysis
static analysis
1.822026
SFA-Miner: Mining Path-Sensitive API Usage Patterns Via Symbolic Finite Automata · SP 2026
APP-Miner: Detecting API Misuses via Automatically Mining API Path Patterns · SP 2024
Program analysis
symbolic finite automata
1.012026
SFA-Miner: Mining Path-Sensitive API Usage Patterns Via Symbolic Finite Automata · SP 2026
Empirical software engineering
frequent subgraph mining
0.812024
APP-Miner: Detecting API Misuses via Automatically Mining API Path Patterns · SP 2024
Web and mobile security
mobile security
0.712023
Scalably Detecting Third-Party Android Libraries With Two-Stage Bloom Filtering · IEEE Trans. Software Eng. 2023
Systems and software security › software supply chain security
third-party library detection
0.712023
Scalably Detecting Third-Party Android Libraries With Two-Stage Bloom Filtering · IEEE Trans. Software Eng. 2023
Systems and software security › program analysis
dynamic symbolic execution
0.612022
Precise Dynamic Symbolic Execution for Nonuniform Data Access in Smart Contracts · IEEE Trans. Computers 2022
Systems and software security › program analysis
integer overflow detection
0.612022
Precise Dynamic Symbolic Execution for Nonuniform Data Access in Smart Contracts · IEEE Trans. Computers 2022
Blockchain and cryptocurrency security
smart contract security
0.612022
Precise Dynamic Symbolic Execution for Nonuniform Data Access in Smart Contracts · IEEE Trans. Computers 2022
Systems and software security
vulnerability discovery
0.612022
Precise Dynamic Symbolic Execution for Nonuniform Data Access in Smart Contracts · IEEE Trans. Computers 2022
Software maintenance and evolution › software ecosystems
library identification
0.212023
Scalably Detecting Third-Party Android Libraries With Two-Stage Bloom Filtering · IEEE Trans. Software Eng. 2023
Software maintenance and evolution
software ecosystems
0.212023
Scalably Detecting Third-Party Android Libraries With Two-Stage Bloom Filtering · IEEE Trans. Software Eng. 2023
Blockchain and cryptocurrency security › smart contract security
smart contract vulnerability
0.212022
Precise Dynamic Symbolic Execution for Nonuniform Data Access in Smart Contracts · IEEE Trans. Computers 2022

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

set inclusion · 1.3entropy-based metric · 1.3bloom filter · 1.3symbolic finite automata · 1.0frequent subgraph mining · 0.8operational semantics · 0.6dynamic symbolic execution · 0.6
YearPublicationVenuePosition
2026 SFA-Miner: Mining Path-Sensitive API Usage Patterns Via Symbolic Finite Automata
Jiasheng Jiang, Mingwei Zheng, Qingkai Shi, Xiangyu Zhang 0001
SP1
2024 APP-Miner: Detecting API Misuses via Automatically Mining API Path Patterns
abstract
Extracting API patterns from the source code has been extensively employed to detect API misuses. However, recent studies manually provide pattern templates as prerequisites, requiring prior software knowledge and limiting their extraction scope. This paper presents APP-Miner (API path pattern miner), a novel static analysis framework for extracting API path patterns via a frequent subgraph mining technique without pattern templates. The critical insight is that API patterns usually consist of APIs’ data-related operations and are commonplace. Therefore, we define API paths as the control flow graphs composed of APIs’ data-related operations, and thereby the maximum frequent subgraphs of the API paths are the probable API path patterns. We implemented APP-Miner and extensively evaluated it on four widely used open-source software: Linux kernel, OpenSSL, FFmpeg, and Apache httpd. We found 116, 35, 3, and 3 new API misuses from the above systems, respectively. Moreover, we gained 19 CVEs.
Jiasheng Jiang, JingZheng Wu, Xiang Ling 0001, Tianyue Luo, Sheng Qu
SP1
2023 Scalably Detecting Third-Party Android Libraries With Two-Stage Bloom Filtering
abstract
Third-party library (TPL) detection is important for Android app security analysis nowadays. Unfortunately, the existing techniques often suffer from poor scalability. In some situations, the detection time cost is even unacceptable. Although a few existing methods run relatively fast, they cannot provide enough effectiveness, especially for non-structure-preserving obfuscated apps, e.g., repackaged and flattened. In this paper, we treat TPLs detection as a set inclusion problem to effectively and efficiently analyze obfuscated apps, and develop a scalable two-stage detection approach,Libloom. Specifically, the package and class signatures are encoded into two levels of Bloom filters respectively. At the first stage, the package filters are used to identify a limited number of candidate TPLs via set overlapping measurement to avoid unnecessary class-level set analysis. Subsequently, with the class filters, a similarity score is computed between the query app and each candidate to detect the integrated TPLs, and a novel entropy-based metric is presented to specially handle the repackaged and flattened apps. We have evaluatedLibloomon some large-scale benchmarks involving tens of thousands of TPL instances. The experiment results demonstrate thatLibloomoutperforms state-of-the-art tools in both effectiveness and efficiency. Especially, the proposed two-stage method can run about ten times faster than the straightforward class-level analysis on flattened apps, and without loss of accuracy.
Jianjun Huang 0001, Jiasheng Jiang, Wei You 0001, Bin Liang 0002, JingZheng Wu
IEEE Trans. Software Eng.3
2022 Precise Dynamic Symbolic Execution for Nonuniform Data Access in Smart Contracts
abstract
Dynamic symbolic execution (DSE) has been successfully adopted for vulnerability detection in desktop and mobile platforms. Unfortunately, we cannot simply extrapolate those techniques to smart contracts. The major challenge is that smart contracts exhibit a nonuniform data access mode. Other than accessing the data via uniform addresses, smart contracts compromise multiple addressing modes, including flat address mode and key-value mode. More seriously, accessing a key-value table usually involves additional hash operations to obtain the keys. In this paper, we propose a DSE framework to resolve the nonuniform data access in smart contracts. More specifically, we exactly track the symbolic variables with concrete addresses and compute the actual/hash keys for table-like accesses. We also take the symbolic keys into account to distinguish data accesses incidentally with the same concrete keys resulting from artificially generated values. We describe the DSE framework in operational semantics. On top of the framework, we implement an integer overflow detectorNovaand a multi-transactional vulnerability detectorMtvd. The experiments show thatNovaoutperforms state-of-the-art analysis tools in detecting the integer overflows with much higher precision and recall, 94.2 and 93.0 percent, respectively.Mtvdsuccessfully reports three ether leaking vulnerabilities and one suicidal issue from real-world smart contracts.
Jianjun Huang 0001, Jiasheng Jiang, Wei You 0001, Bin Liang 0002
IEEE Trans. Computers2