|
|
|
|
|
|
by maradydd
3076 days ago
|
|
|
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 |
|
|