A Language-theoretic View on Network Protocols

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.

[1]  Ron Aitchison,et al.  Pro DNS and BIND 10 , 2011 .

[2]  Bin Liu,et al.  NetShield: massive semantics-based vulnerability signature matching for high-speed networks , 2010, SIGCOMM '10.

[3]  Vaughan-Nichols Multipurpose Internet Mail Extensions : MIME ” with RFC 22 , 2017 .

[4]  Larry L. Peterson,et al.  binpac: a yacc for writing application protocol parsers , 2006, IMC '06.

[5]  Somesh Jha,et al.  Protocol Normalization Using Attribute Grammars , 2009, ESORICS.

[6]  Roy T. Fielding,et al.  Hypertext Transfer Protocol (HTTP/1.1): Message Syntax and Routing , 2014, RFC.

[7]  Patrik Jansson,et al.  Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda , 2016, Log. Methods Comput. Sci..

[8]  Nickolai Zeldovich,et al.  Nail: A Practical Tool for Parsing and Generating Data Formats , 2014, OSDI.

[9]  Jon Postel,et al.  User Datagram Protocol , 1980, RFC.

[10]  Nathaniel S. Borenstein,et al.  Multipurpose Internet Mail Extensions (MIME) Part Two: Media Types , 1996, RFC.

[11]  Helen J. Wang,et al.  Generic Application-Level Protocol Analyzer and its Language , 2007, NDSS.

[12]  Mark Handley,et al.  SIP: Session Initiation Protocol , 1999, RFC.

[13]  Yuval Filmus Lower bounds for context-free grammars , 2011, Inf. Process. Lett..

[14]  W. Marsden I and J , 2012 .

[15]  Tara Brough,et al.  Groups with poly-context-free word problem , 2011, Groups Complex. Cryptol..

[16]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[17]  Tarmo Uustalu,et al.  Certified CYK parsing of context-free languages , 2014, J. Log. Algebraic Methods Program..

[18]  Nathaniel S. Borenstein,et al.  Multipurpose Internet Mail Extensions (MIME) Part One: Format of Internet Message Bodies , 1996, RFC.

[19]  Paul V. Mockapetris,et al.  Domain names - implementation and specification , 1987, RFC.

[20]  Sergey Bratus,et al.  The Seven Turrets of Babel: A Taxonomy of LangSec Errors and How to Expunge Them , 2016, 2016 IEEE Cybersecurity Development (SecDev).

[21]  Michel Latteux Intersections de langages algébriques bornés , 2004, Acta Informatica.

[22]  Eric Torng,et al.  FlowSifter: A counting automata approach to layer 7 field extraction for deep flow inspection , 2012, 2012 Proceedings IEEE INFOCOM.

[23]  Dave Crocker,et al.  Augmented BNF for Syntax Specifications: ABNF , 1997, RFC.

[24]  Peter Weiner,et al.  An infinite hierarchy of intersections of context-free languages , 1973, Mathematical systems theory.

[25]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .