Generating Optimised and Formally Checked Packet Parsing Code - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Generating Optimised and Formally Checked Packet Parsing Code

(1) , (1) , (1)
Sebastien Mondet
  • Function : Author
  • PersonId : 1013403
Ion Alberdi
  • Function : Author
  • PersonId : 941303
Thomas Plagemann
  • Function : Author
  • PersonId : 1013405


While implementing distributed applications, the parsing of binary packets is a very difficult and error-prone task the developer has to face. Moreover, these programming mistakes are often the source of distant vulnerabilities. In this paper we present a code-generation library, called Promiwag, for creating optimised and safe packet parsing code. Its input is concise human-readable descriptions of the protocols and the interests of the application in specific pieces of information. Promiwag follows a dependency-based algorithm, and uses high-level optimisation techniques to generate minimal parsing automatons. These automatons can be compiled into C or OCaml code for efficient execution, and to annotatedWhy code. This latter output is then used to automatically prove that for any possible input packet, the generated code cannot perform any illegal memory access, and that no infinite loop can be triggered. We have used our code generator to implement a pretty-printer for Internet protocols, and we provide experimental results on the performance of the generated code.
Fichier principal
Vignette du fichier
978-3-642-21424-0_14_Chapter.pdf (165.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01567597 , version 1 (24-07-2017)


Attribution - CC BY 4.0



Sebastien Mondet, Ion Alberdi, Thomas Plagemann. Generating Optimised and Formally Checked Packet Parsing Code. 26th International Information Security Conference (SEC), Jun 2011, Lucerne, Switzerland. pp.173-184, ⟨10.1007/978-3-642-21424-0_14⟩. ⟨hal-01567597⟩
84 View
255 Download



Gmail Facebook Twitter LinkedIn More