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

Tiantai Zhang

dblp:09/25 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2023
—ORCID · unresolved

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

Security and privacy · 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
2 papers
Program analysis · 100%
Network and information security
2 papers
Systems and software security · 74% Cryptographic primitives and cryptanalysis · 26%

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

TopicWeightPapersLastEvidence papers
Program analysis
binary analysis
0.712023
OCFI: Make Function Entry Identification Hard Again · ISSTA 2023
Systems and software security
binary analysis
0.612022
Ground Truth for Binary Disassembly is Not Easy · USENIX Security Symposium 2022
Cryptographic primitives and cryptanalysis
obfuscation
0.212023
OCFI: Make Function Entry Identification Hard Again · ISSTA 2023
Program analysis › binary analysis
disassembly
0.212022
Ground Truth for Binary Disassembly is Not Easy · USENIX Security Symposium 2022

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

call frame information analysis · 1.3empirical study · 1.1
YearPublicationVenuePosition
2023 OCFI: Make Function Entry Identification Hard Again
abstract
Function entry identification is a crucial yet challenging task for binary disassemblers that has been the focus of research in the past decades. However, recent researches show that call frame information (CFI) provides accurate and almost complete function entries. With the aid of CFI, disassemblers have significant improvements in function entry detection. CFI is specifically designed for efficient stack unwinding, and every function has corresponding CFI in x64 and aarch64 architectures. Nevertheless, not every function and instruction unwinds the stack at runtime, and this observation has led to the development of techniques such as obfuscation to complicate function detection by disassemblers.
Chengbin Pang, Tiantai Zhang, Xuelan Xu, Linzhang Wang, Bing Mao 0001
ISSTA2
2022 Ground Truth for Binary Disassembly is Not Easy
Chengbin Pang, Tiantai Zhang, Ruotong Yu, Bing Mao 0001, Jun Xu 0024
USENIX Security Symposium2