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

Richard Wartell

dblp:05/9988 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2014
—ORCID · none

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

Security and privacy · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 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%

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

TopicWeightPapersLastEvidence papers
Systems and software security
code randomization
0.112012
Binary stirring: self-randomizing instruction addresses of legacy x86 binary code · CCS 2012
Systems and software security
memory safety
0.112012
Binary stirring: self-randomizing instruction addresses of legacy x86 binary code · CCS 2012
Systems and software security › exploitation
code reuse attack
0.012012
Binary stirring: self-randomizing instruction addresses of legacy x86 binary code · CCS 2012
Systems and software security
exploitation
0.012012
Binary stirring: self-randomizing instruction addresses of legacy x86 binary code · CCS 2012

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

binary rewriting · 0.1address space layout randomization · 0.1
YearPublicationVenuePosition
2014 Shingled Graph Disassembly: Finding the Undecideable Path
Richard Wartell, Yan Zhou 0001, Kevin W. Hamlen, Murat Kantarcioglu
PAKDD (1)1
2014 Hippocratic binary instrumentation: First do no harm
Meera Sridhar, Richard Wartell, Kevin W. Hamlen
Sci. Comput. Program.2
2012 Securing untrusted code via compiler-agnostic binary rewriting
abstract
Binary code from untrusted sources remains one of the primary vehicles for malicious software attacks. This paper presents Reins, a new, more general, and lighter-weight binary rewriting and in-lining system to tame and secure untrusted binary programs. Unlike traditional monitors, Reins requires no cooperation from code-producers in the form of source code or debugging symbols, requires no client-side support infrastructure (e.g., a virtual machine or hypervisor), and preserves the behavior of even complex, event-driven, x86 native COTS binaries generated by aggressively optimizing compilers. This makes it exceptionally easy to deploy. The safety of programs rewritten by Reins is independently machine-verifiable, allowing rewriting to be deployed as an untrusted third-party service. An implementation of Reins for Microsoft Windows demonstrates that it is effective and practical for a real-world OS and architecture, introducing only about 2.4% runtime overhead to rewritten binaries.
Richard Wartell, Vishwath Mohan, Kevin W. Hamlen, Zhiqiang Lin 0001
ACSAC1
2012 Binary stirring: self-randomizing instruction addresses of legacy x86 binary code
abstract
Unlike library code, whose instruction addresses can be randomized by address space layout randomization (ASLR), application binary code often has static instruction addresses. Attackers can exploit this limitation to craft robust shell codes for such applications, as demonstrated by a recent attack that reuses instruction gadgets from the static binary code of victim applications.
Richard Wartell, Vishwath Mohan, Kevin W. Hamlen, Zhiqiang Lin 0001
CCS1
2011 Differentiating Code from Data in x86 Binaries
Richard Wartell, Yan Zhou 0001, Kevin W. Hamlen, Murat Kantarcioglu, Bhavani Thuraisingham
ECML/PKDD (3)1