Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Just FTR, your critique is answered by Stefan Lucks, Norina Grosch, and Joshua Koenig's paper[0] from last year's langsec workshop at IEEE Security and Privacy. They define a formalism, calc-regular languages, to handle length-prefixed strings.

[0] http://spw17.langsec.org/papers.html#calc-regular



Thanks, this looks promising! I'll take a look.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: