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.
Pr-miner: automatically extracting implicit program- ming rules and detecting violations in large software code,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.