Model-Based Testing of Networked Applications
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.
Fri 16 JulDisplayed time zone: Brussels, Copenhagen, Madrid, Paris change
Sat 17 JulDisplayed time zone: Brussels, Copenhagen, Madrid, Paris change
02:40 - 03:40
|Validating Static Warnings via Testing Code Fragments|
Ashwin Kallingal Joshy Iowa State University, Xueyuan Chen Iowa State University, Benjamin Steenhoek Iowa State University, Wei Le Iowa State UniversityDOI
|Empirical Evaluation of Smart Contract Testing: What Is the Best Choice?|
Meng Ren Tsinghua University, Zijing Yin Tsinghua University, Fuchen Ma Tsinghua University, Zhenyang Xu University of Waterloo, Yu Jiang Tsinghua University, Chengnian Sun University of Waterloo, Huizhong Li WeBank, Yan Cai Institute of Software at Chinese Academy of SciencesDOI File Attached
|Model-Based Testing of Networked Applications|
Yishuai Li University of Pennsylvania, Benjamin C. Pierce University of Pennsylvania, Steve Zdancewic University of PennsylvaniaDOI Pre-print