Large Language Models for Validating Network Protocol Parsers

Network protocol parsers are essential for enabling correct and secure communication between devices. Bugs in these parsers can introduce critical vulnerabilities, including memory corruption, information leakage, and denial-of-service attacks. An intuitive way to assess parser correctness is to compare the implementation with its official protocol standard. However, this comparison is challenging because protocol standards are typically written in natural language, whereas implementations are in source code. Existing methods like model checking, fuzzing, and differential testing have been used to find parsing bugs, but they either require significant manual effort or ignore the protocol standards, limiting their ability to detect semantic violations. To enable more automated validation of parser implementations against protocol standards, we propose Parval, a multi-agent framework built on large language models (LLMs). Parval leverages the capabilities of LLMs to understand both natural language and code. It transforms both protocol standards and their implementations into a unified intermediate representation, referred to as format specifications, and performs a differential comparison to uncover inconsis-tencies. We evaluate Parval on the Bidirectional Forwarding Detection (BFD) protocol. Our experiments demonstrate that ParValsuccessfully identifies inconsistencies between the implementation and its RFC standard, achieving a low false positive rate of 5.6%. Parval uncovers seven unique bugs, including five previously unknown issues.