A language-theoretic view on network protocols
From MaRDI portal
(Redirected from Publication:5096096)
Abstract: Input validation is the first line of defense against malformed or malicious inputs. It is therefore critical that the validator (which is often part of the parser) is free of bugs. To build dependable input validators, we propose using parser generators for context-free languages. In the context of network protocols, various works have pointed at context-free languages as falling short to specify precisely or concisely common idioms found in protocols. We review those assessments and perform a rigorous, language-theoretic analysis of several common protocol idioms. We then demonstrate the practical value of our findings by developing a modular, robust, and efficient input validator for HTTP relying on context-free grammars and regular expressions.
Recommendations
Cited in
(6)- A network protocol stack in standard ML
- Peer-to-peer networks: a language theoretic approach
- Protocol Normalization Using Attribute Grammars
- Language Modeling and Encryption on Packet Switched Networks
- Versatile form validation using jSRML
- scientific article; zbMATH DE number 5222364 (Why is no real title available?)
This page was built for publication: A language-theoretic view on network protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096096)