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

Douglas Low

dblp:91/2320 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1998
—ORCID · unresolved

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

Software 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%
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
Systems and software security › software protection
code obfuscation
0.011998
Manufacturing Cheap, Resilient, and Stealthy Opaque Constructs · POPL 1998
Systems and software security › software protection › code obfuscation
control flow obfuscation
0.011998
Manufacturing Cheap, Resilient, and Stealthy Opaque Constructs · POPL 1998
Program analysis › static analysis
pointer analysis
0.011998
Manufacturing Cheap, Resilient, and Stealthy Opaque Constructs · POPL 1998
Program analysis
static analysis
0.011998
Manufacturing Cheap, Resilient, and Stealthy Opaque Constructs · POPL 1998

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

code transformation · 0.0
YearPublicationVenuePosition
1998 Manufacturing Cheap, Resilient, and Stealthy Opaque Constructs
abstract
It has become common to distribute software in forms that are isomorphic to the original source code. An important example is Java bytecode. Since such codes are easy to decompile, they increase the risk of malicious reverse engineering attacks.In this paper we describe the design of a Java code obfuscator, a tool which - through the application of code transformations - converts a Java program into an equivalent one that is more difficult to reverse engineer.We describe a number of transformations which obfuscate control-flow. Transformations are evaluated with respect to potency (To what degree is a human reader confused?), resilience (How well are automatic deobfuscation attacks resisted?), cost (How much time/space overhead is added?), and stealth (How well does obfuscated code blend in with the original code?).The resilience of many control-altering transformations rely on the resilience of opaque predicates. These are boolean valued expressions whose values are known to the obfuscator but difficult to determine for an automatic deobfuscator. We show how to construct resilient, cheap, and stealthy opaque predicates based on the intractability of certain static analysis problems such as alias analysis.
Christian S. Collberg, Clark D. Thomborson, Douglas Low
POPL3