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

Henry Hanping Feng

dblp:82/3524 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2004
—ORCID · none

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

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

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

TopicWeightPapersLastEvidence papers
Network security › intrusion detection and prevention
intrusion detection
0.122004
Formalizing Sensitivity in Static Analysis for Intrusion Detection · S&P 2004
Anomaly Detection Using Call Stack Information · S&P 2003
Network security › intrusion detection and prevention › intrusion detection › intrusion detection system
host-based intrusion detection
0.012004
Formalizing Sensitivity in Static Analysis for Intrusion Detection · S&P 2004
Program analysis
static analysis
0.012004
Formalizing Sensitivity in Static Analysis for Intrusion Detection · S&P 2004
Network security › intrusion detection and prevention › intrusion detection
anomaly detection
0.012003
Anomaly Detection Using Call Stack Information · S&P 2003

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

runtime monitoring · 0.1pushdown automata determinization · 0.1return address extraction · 0.0abstract execution path · 0.0
YearPublicationVenuePosition
2004 Formalizing Sensitivity in Static Analysis for Intrusion Detection
abstract
A key function of a host-based intrusion detection system is to monitor program execution. Models constructed using static analysis have the highly desirable feature that they do not produce false alarms; however, they may still miss attacks. Prior work has shown a trade-off between efficiency and precision. In particular, the more accurate models based upon pushdown automata (PDA) are very inefficient to operate due to non-determinism in stack activity. In this paper, we present techniques for determinizing PDA models. We first provide a formal analysis framework of PDA models and introduce the concepts of determinism and stack-determinism. We then present the VP-Static model, which achieves determinism by extracting information about stack activity of the program, and the Dyck model, which achieves stack-determinism by transforming the program and inserting code to expose program state. Our results show that in run-time monitoring, our models slow execution of our test programs by 1% to 135%. This shows that reasonable efficiency needs not be sacrificed for model precision. We also compare the two models and discover that deterministic PDA are more efficient, although stack-deterministic PDA require less memory.
Henry Hanping Feng, Jonathon T. Giffin, Somesh Jha, Wenke Lee, Barton P. Miller
S&P1
2003 Anomaly Detection Using Call Stack Information
abstract
The call stack of a program execution can be a very good information source for intrusion detection. There is no prior work on dynamically extracting information from the call stack and effectively using it to detect exploits. In this paper we propose a new method to do anomaly detection using call stack information. The basic idea is to extract return addresses from the call stack, and generate an abstract execution path between two program execution points. Experiments show that our method can detect some attacks that cannot be detected by other approaches, while its convergence and false positive performance is comparable to or better than the other approaches. We compare our method with other approaches by analyzing their underlying principles and thus achieve a better characterization of their performance, in particular on what and why attacks will be missed by the various approaches.
Henry Hanping Feng, Oleg M. Kolesnikov, Prahlad Fogla, Wenke Lee, Weibo Gong
S&P1