Model-Based Testing of Networked Applications
Abstract
We present a principled automatic testing framework for application-layer protocols. The key innovation is a domain-specific embedded language for writing nondeterministic models of the behavior of networked servers. These models are defined within the Coq interactive theorem prover, supporting a smooth transition from testing to formal verification. Given a server model, we show how to automatically derive a tester that probes the server for unexpected behaviors. We address the uncertainties caused by both the server's internal choices and the network delaying messages nondeterministically. The derived tester accepts server implementations whose possible behaviors are a subset of those allowed by the nondeterministic model. We demonstrate the effectiveness of this framework by using it to specify and test a fragment of the HTTP/1.1 protocol, showing that the automatically derived tester can capture RFC violations in buggy server implementations, including the latest versions of Apache and Nginx.
Keywords
Cite
@article{arxiv.2102.00378,
title = {Model-Based Testing of Networked Applications},
author = {Yishuai Li and Benjamin C. Pierce and Steve Zdancewic},
journal= {arXiv preprint arXiv:2102.00378},
year = {2021}
}
Comments
11 pages, 15 figures