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

Edward Carter

dblp:37/2364 · 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

Software engineering, systems software and programming languages · 2Theory of computation · 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
Digital forensics and information hiding · 77% Systems and software security · 23%

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

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding › watermarking
software watermarking
0.012004
Dynamic path-based software watermarking · PLDI 2004

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

error-correcting codes · 0.0dynamic branching analysis · 0.0
YearPublicationVenuePosition
2009 More on graph theoretic software watermarks: Implementation, analysis, and attacks
Christian S. Collberg, Andrew Huntwork, Edward Carter, Gregg M. Townsend, Michael Stepp
Inf. Softw. Technol.3
2004 Dynamic path-based software watermarking
abstract
Software watermarking is a tool used to combat software piracy by embedding identifying information into a program. Most existing proposals for software watermarking have the shortcoming that the mark can be destroyed via fairly straightforward semantics-preserving code transformations. This paper introduces path-based watermarking, a new approach to software watermarking based on the dynamic branching behavior of programs. The advantage of this technique is that error-correcting and tamper-proofing techniques can be used to make path-based watermarks resilient against a wide variety of attacks. Experimental results, using both Java bytecode and IA-32 native code, indicate that even relatively large watermarks can be embedded into programs at modest cost.
Christian S. Collberg, Edward Carter, Saumya K. Debray, Andrew Huntwork, John D. Kececioglu, Cullen Linn, Michael Stepp
PLDI2
2003 Graph-Based Approaches to Software Watermarking
Christian S. Collberg, Stephen G. Kobourov, Edward Carter, Clark D. Thomborson
WG3