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

Hailong Xiong

dblp:62/8071 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0001-8544-4994ORCID · reported

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

Software engineering, systems software and programming languages · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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
Systems and software security · 100%
Software engineering, system software, and programming languages
1 paper
Program analysis · 100%

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

TopicWeightPapersLastEvidence papers
Systems and software security
exploitation
0.612022
Automated Use-After-Free Detection and Exploit Mitigation: How Far Have We Gone? · IEEE Trans. Software Eng. 2022
Systems and software security
memory safety
0.612022
Automated Use-After-Free Detection and Exploit Mitigation: How Far Have We Gone? · IEEE Trans. Software Eng. 2022
Systems and software security › memory safety › memory error detection
use-after-free detection
0.612022
Automated Use-After-Free Detection and Exploit Mitigation: How Far Have We Gone? · IEEE Trans. Software Eng. 2022
Systems and software security › memory safety › memory corruption defense
use-after-free prevention
0.612022
Automated Use-After-Free Detection and Exploit Mitigation: How Far Have We Gone? · IEEE Trans. Software Eng. 2022
Program analysis
dynamic analysis
0.212022
Automated Use-After-Free Detection and Exploit Mitigation: How Far Have We Gone? · IEEE Trans. Software Eng. 2022
Program analysis › dynamic analysis
memory error detection
0.212022
Automated Use-After-Free Detection and Exploit Mitigation: How Far Have We Gone? · IEEE Trans. Software Eng. 2022
Program analysis
static analysis
0.212022
Automated Use-After-Free Detection and Exploit Mitigation: How Far Have We Gone? · IEEE Trans. Software Eng. 2022

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

static analysis · 1.1empirical evaluation · 1.1dynamic analysis · 1.1
YearPublicationVenuePosition
2022 Automated Use-After-Free Detection and Exploit Mitigation: How Far Have We Gone?
abstract
C/C++ programs frequently encounter memory errors, such as Use-After-Free (UAF), buffer overflow, and integer overflow. Among these memory errors, UAF vulnerabilities are increasingly being exploited by attackers to disrupt critical software systems, leading to serious consequences, such as remote code execution and data breaches. Researchers have proposed dozens of approaches to detect UAFs in testing environments and to mitigate UAF exploit in production environments. However, to the best of our knowledge, no comprehensive studies have evaluated and compared these approaches. In this paper, we shed light on the current UAF detection and exploit mitigation approaches and provide a systematic overview, comprehensive comparison, and evaluation. Specifically, we evaluate the effectiveness and efficiency of publicly available UAF detection and exploit mitigation tools. The experimental results show that static UAF detectors are suitable for detecting intra-procedural UAFs but are not sufficient to detect inter-procedural UAFs in real-world programs. Dynamic UAF detectors are still the first choice for detecting inter-procedural UAFs. Our evaluation also demonstrates that the runtime overhead of existing UAF exploit mitigation tools is relatively stable whereas the memory overhead may vary dramatically with respect to different programs. Finally, we envision potential valuable future research directions.
Binfa Gui, Wei Song 0003, Hailong Xiong, Jeff Huang 0001
IEEE Trans. Software Eng.3
2009 Source Seeking for Two Nonholonomic Models of Fish Locomotion
abstract
In this paper, we present a method of locomotion control for underwater vehicles that are propelled by a periodic deformation of the vehicle body, which is similar to the way a fish moves. We have developed control laws employing ldquoextremum seekingrdquo for two different ldquofishrdquo models. The first model consists of three rigid body links and relies on a 2-degree-of-freedom (DOF) movement that propels the fish without relying on vortices. The second fish model uses a Joukowski airfoil that has only 1 DOF in its movement and, thus, relies on vortex shedding for propulsion. We achieve model-free and position-free ldquosource seeking,rdquo and, if position is available, navigation along a predetermined path.
Jennie Cochran, Eva Kanso, Scott David Kelly, Hailong Xiong, Miroslav Krstic
IEEE Trans. Robotics4