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

Michael A. Fetterman

dblp:40/5187 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none

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

Systems, architecture and hardware · 3

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%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Memory systems · 84% Processor architecture and microarchitecture · 16%
Software engineering, system software, and programming languages
2 papers
Operating systems · 60% Runtime systems and virtual machines · 40%

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

TopicWeightPapersLastEvidence papers
Memory systems › memory management
memory deduplication
0.112009
Satori: Enlightened Page Sharing · USENIX ATC 2009
Systems and software security › exploitation mitigation
code injection prevention
0.112006
Practical taint-based protection using demand emulation · EuroSys 2006
Operating systems › resource management
memory management
0.012009
Satori: Enlightened Page Sharing · USENIX ATC 2009
Processor architecture and microarchitecture
hardware-assisted security
0.012006
Practical taint-based protection using demand emulation · EuroSys 2006

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

demand emulation · 0.2data tainting · 0.2
YearPublicationVenuePosition
2009 Satori: Enlightened Page Sharing
Grzegorz Milos, Derek Gordon Murray, Steven Hand 0001, Michael A. Fetterman
USENIX ATC4
2008 Execution replay of multiprocessor virtual machines
abstract
Execution replay of virtual machines is a technique which has many important applications, including debugging, fault-tolerance, and security. Execution replay for single processor virtual machines is well-understood, and available commercially. With the advancement of multi-core architectures, however, multiprocessor virtual machines are becoming more important. Our system, SMP-ReVirt, is the first system to log and replay a multiprocessor virtual machine on commodity hardware. We use hardware page protection to detect and accurately replay sharing between virtual cpus of a multi-cpu virtual machine, allowing us to replay the entire operating system and all applications. We have tested our system on a variety of workloads, and find that although sharing under SMP-ReVirt is expensive, for many workloads and applications, including debugging, the overhead is acceptable.
George W. Dunlap, Dominic G. Lucchetti, Michael A. Fetterman, Peter M. Chen
VEE3
2006 Practical taint-based protection using demand emulation
abstract
Many software attacks are based on injecting malicious code into a target host. This paper demonstrates the use of a well-known technique, data tainting, to track data received from the network as it propagates through a system and to prevent its execution. Unlike past approaches to taint tracking, which track tainted data by running the system completely in an emulator or simulator, resulting in considerable execution overhead, our work demonstrates the ability to dynamically switch a running system between virtualized and emulated execution. Using this technique, we are able to explore hardware support for taint-based protection that is deployable in real-world situations, as emulation is only used when tainted data is being processed by the CPU. By modifying the CPU, memory, and I/O devices to support taint tracking and protection, we guarantee that data received from the network may not be executed, even if it is written to, and later read from disk. We demonstrate near native speeds for workloads where little taint data is present.
Alex Ho, Michael A. Fetterman, Andy Warfield, Steven Hand 0001
EuroSys2