[langsec-discuss] Basic results?

Sven Kieske svenkieske at gmail.com
Tue May 27 18:31:39 UTC 2014


-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

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?

regards

Sven
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v2.0.22 (MingW32)

iQGcBAEBAgAGBQJThNoLAAoJEAq0kGAWDrqlSEUL/0VbhguwCsIhzQww9Zw0DlrX
CFhm4G3FGXL1Hsdr6xKxCDjzguz54RpsLCGqW8hHttekezn3DujMdiREdIEu8LxF
8pXVas9Ul3z5yPgpfkqSpil0GqnCCeDzeaAiGJrB3lKkGmVGe5aq4r0M2ZXshIt7
eKWoK8T/5ZWznF1zoZbu2BVA1NvCqXTqwFO7qPtb/Mk2pE75CQZAljX+7k/D0JJz
AEYObGhA9ZWGc65sgpdj4p/dHbFs6of/0DS4e0yI0tuComjAolzZxV65yGcbJrT8
eAOjgyyL1KcK8mymAh5LyTmvgqXaCbUI7E344Ge8puIad2+tYam4zrVjlbK7TsyY
s6dnPBOXBslNkfcS3rfCdQvpndX+El+WvlT+k4wShEFRWnEFOAFPZURcyFxTn+4y
+f84ucwfMsBWDQb5aXKCz9u753tQ02j2kY5bnd4/ATetFG0jzBRcQneZFTmfoyJc
6AyW1Tp4LVoMrQcfEy1/RdZZAIYUnj7jJmhA2bl+PQ==
=QAlL
-----END PGP SIGNATURE-----


More information about the langsec-discuss mailing list