We also only hinted at the nitty-gritty details of how stack overflows work.
而且,在此只有提到了堆叠溢位是如何产生的实质细节。
This optimization transforms recursive calls into local loops, in order to prevent stack overflows.
这一优化将递归调用转换成本地回路,这样可以防止栈溢出。
Heap overflows are generally much harder to exploit than stack overflows (although successful heap overflow attacks do exist).
堆积溢位的利用通常比堆叠溢位更困难(虽然存在一些成功的堆溢位攻击)。
应用推荐