[langsec-discuss] Basic results?
svenkieske at gmail.com
Tue May 27 18:31:39 UTC 2014
-----BEGIN PGP SIGNED MESSAGE-----
On 27.05.2014 09:17, Peter Bex wrote:
> I don't know if this is at all what you're looking for, but
> recently I was reminded of one effective, practical way that such
> things have been dealt with in the past: the Berkeley Packet
> Filter. It is basically a bytecode for programs which decide
> whether to accept a network packet and how much data of the packet
> should be captured.
It's nice you mention this filter.
I may add that this is also used by the command line tool "tc"
which in turn is used by e.g. libvirt and many more tools
to accomplish traffic control (quality of service) on many modern
network devices and cloud platforms.
PS: I got a question regarding languages which do just allow a limited
number of recursions or loops within one given program:
Could this feature not be easily bypassed if I can store
intermediary results e.g. in a file and just re-run the code
with these results as an input, again and again?
Must a language, or better the runtime environment, not detect or
disable this use case?
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v2.0.22 (MingW32)
-----END PGP SIGNATURE-----
More information about the langsec-discuss