Parsifal: a Pragmatic Solution to the Binary Parsing Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Parsifal: a Pragmatic Solution to the Binary Parsing Problem

Résumé

Parsers are pervasive software basic blocks: as soon as a program needs to communicate with another program or to read a file, a parser is involved. However, writing robust parsers can be difficult, as is revealed by the amount of bugs and vulnerabilities related to programming errors in parsers. It is especially true for network analysis tools, which led the network and protocols laboratory of the French Network and Information Security Agency (ANSSI) to write custom tools. One of them, Parsifal, is a generic framework to describe parsers in OCaml, and gave us some insight into binary formats and parsers. After describing our tool, this article presents some use cases and lessons we learned about format complexity, parser robustness and the role the language used played.
Fichier non déposé

Dates et versions

hal-01020138 , version 1 (07-07-2014)

Identifiants

  • HAL Id : hal-01020138 , version 1

Citer

Olivier Levillain. Parsifal: a Pragmatic Solution to the Binary Parsing Problem. LangSec Workshop at IEEE Security & Privacy, May 2014, San Jose, United States. ⟨hal-01020138⟩
147 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More