CHOP: Bypassing runtime bounds checking through convex hull Optimization.

Yurong Chen Hongfa Xue Tian Lan Guru Venkataramani

Published in: Comput. Secur. (2020)

Keyphrases

convex hull
convex combinations
point sets
upper bound
feasible solution
convex sets
linear inequalities
lower bound
convex concave
finite set of points
convex polyhedra
computational geometry
data points
extreme points
minimum distance
integer points
valid inequalities
data sets
optimization problems
image sequences