Most existing work only considers instruction-level features, which to some extent overlooks certain syntax and semantic information in the assembly code segments, affecting the accuracy of the ...

A modified lower bound for binary codes with covering radius one is derived. Let K/sub q/(n,R) denote the minimum cardinality of a q-ary code with covering radius R. The new bound shows that K/sub ...