CHOP applies convex hull optimization to runtime profiles to eliminate an average of 80.12% of dynamic bounds checks, yielding up to 95.80% performance improvement over SoftBound on evaluated benchmarks.
SoK: Sanitizing for Security
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
The C and C++ programming languages are notoriously insecure yet remain indispensable. Developers therefore resort to a multi-pronged approach to find security issues before adversaries. These include manual, static, and dynamic program analysis. Dynamic bug finding tools --- henceforth "sanitizers" --- can find bugs that elude other types of analysis because they observe the actual execution of a program, and can therefore directly observe incorrect program behavior as it happens. A vast number of sanitizers have been prototyped by academics and refined by practitioners. We provide a systematic overview of sanitizers with an emphasis on their role in finding security issues. Specifically, we taxonomize the available tools and the security vulnerabilities they cover, describe their performance and compatibility properties, and highlight various trade-offs.
fields
cs.PL 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
CHOP: Bypassing Runtime Bounds Checking Through Convex Hull OPtimization
CHOP applies convex hull optimization to runtime profiles to eliminate an average of 80.12% of dynamic bounds checks, yielding up to 95.80% performance improvement over SoftBound on evaluated benchmarks.