QUIC的状态机推理
State machine inference of QUIC
摘要:
QUIC是一种新的传输协议,它在互联网中的UDP之上提供可靠,安全和快速的服务。由于QUIC是在应用程序空间而不是在操作系统内核中实现的,因此动态开发和转出会更有效。目前,有两个并行的规范,一个是Google的,一个是IETF的,并且有一些实现。在本文中,我们将展示如何状态机推理可以应用于自动提取的状态机对应的协议的实现。特别是,我们推断谷歌的QUIC服务器的模型。这是使用黑盒技术完成的,使其可用于协议的任何实现,而不管例如编写代码的程序设计语言或QUIC服务器运行的系统。这使其成为测试和规范目的的有用工具,并使各种(未来)实现更容易比较。
英文摘要:
QUIC is a recent transport protocol that provides reliable, secure and quick service on top of UDP in the internet. As QUIC is implemented in the application space rather than in the operating system's kernel, it is more efficient to dynamically develop and roll out. Currently, there are two parallel specifications, one by Google and one by IETF, and there are a few implementations. In this paper, we show how state machine inference can be applied to automatically extract the state machine corresponding to the protocol from an implementation. In particular, we infer the model of Google's QUIC server. This is done using a black-box technique, making it usable on any implementation of the protocol, regardless of, for example, the programming language the code is written in or the system the QUIC server runs on. This makes it a useful tool for testing and specification purposes, and to make various (future) implementations more easily comparable.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。