EUVIMEDEUVIMED entdecken
StudienprotokollOpen Access · CC BY 4.0

Validating Network Protocol Parsers with Traceable RFC Document Interpretation

Mingwei Zheng, Danning Xie, Qingkai Shi, Chengpeng Wang, Xiangyu Zhang

Proceedings of the ACM on Software Engineering · 22.06.2025 · 2 (ISSTA) · 1772-1794

DOI: 10.1145/3728955 ↗

Kurz gefasst

Studienprotokoll in der Zeitschrift Proceedings of the ACM on Software Engineering, online erschienen am 22.06.2025. Verfasst von Mingwei Zheng und 4 weiteren Autor:innen. Die Arbeit wurde bisher 16-mal zitiert (Crossref) und nennt 60 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Science Foundation, DARPA, ONR.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Validating the correctness of network protocol implementations is highly challenging due to the oracle and traceability problems. The former determines when a protocol implementation can be considered buggy, especially when the bugs do not cause any observable symptoms. The latter allows developers to understand how an implementation violates the protocol specification, thereby facilitating bug fixes. Unlike existing works that rarely take both problems into account, this work considers both and provides an effective solution using recent advances in large language models (LLMs). Our key observation is that network protocols are often released with structured specification documents, a.k.a. RFC documents, which can be systematically translated to formal protocol message specifications via LLMs. Such specifications, which may contain errors due to the hallucination of LLMs, are used as a quasi-oracle to validate protocol parsers, while the validation results in return gradually refine the oracle. Since the oracle is derived from the document, any bugs we find in a protocol implementation can be traced back to the document, thus addressing the traceability problem. We have extensively evaluated our approach using nine network protocols and their implementations written in C, Python, and Go. The results show that our approach outperforms the state-of-the-art and has detected 69 bugs, with 36 confirmed. The project also demonstrates the potential for fully automating software validation based on natural language specifications, a process previously considered predominantly manual due to the need to understand specification documents and derive expected outputs for test inputs.

Förderung

  • National Science Foundation
  • DARPA
  • ONR

Zitieren

APA

Zheng, M., Xie, D., Shi, Q., Wang, C., & Zhang, X. (2025). Validating Network Protocol Parsers with Traceable RFC Document Interpretation. Proceedings of the ACM on Software Engineering, 2(ISSTA), 1772-1794. https://doi.org/10.1145/3728955

Vancouver

Zheng M, Xie D, Shi Q, Wang C, Zhang X. Validating Network Protocol Parsers with Traceable RFC Document Interpretation. Proceedings of the ACM on Software Engineering. 2025;2(ISSTA):1772-1794. doi:10.1145/3728955

BibTeX
@article{Zheng2025,
  author = {Zheng, Mingwei and Xie, Danning and Shi, Qingkai and Wang, Chengpeng and Zhang, Xiangyu},
  title = {Validating Network Protocol Parsers with Traceable RFC Document Interpretation},
  journal = {Proceedings of the ACM on Software Engineering},
  year = {2025},
  volume = {2},
  number = {ISSTA},
  pages = {1772--1794},
  doi = {10.1145/3728955}
}
Kostenlos starten →