[langsec-discuss] Basic results?
bascule at gmail.com
Thu Jan 19 18:17:03 UTC 2017
On Tue, May 27, 2014 at 12:17 AM, Peter Bex <Peter.Bex at xs4all.nl> wrote:
> This is run within the kernel context, and arbitrary code in this bytecode
> can be uploaded. It reins in power by allowing only a fixed length for the
> program and by allowing only jumps to forward addresses, which precludes
> loop, making it effectively non-Turing complete.
What's particularly interesting is extended BPF (eBPF) allows backwards
jumps, with a catch:
"Every jump is mapped and, while backward jumps are allowed, jumps to
previously executed parts of the program are not, so loops should not be
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the langsec-discuss