Generating Models of Infinite-State Communication Protocols using Regular Inference with AbstractionF. Aarts, B. Jonsson, J. Uijen, and F.W. Vaandrager. Generating Models of Infinite-State Communication Protocols using Regular Inference with Abstraction. Formal Methods in System Design 46(1):1-41, 2015. doi:10.1007/s10703-014-0216-x This is the full version of the ICTSS 2010 paper of Aarts, Jonsson, and Uijen.
AbstractIn order to facilitate model-based verification and validation, effort is underway to develop techniques for generating models of communication system components from observations of their external behavior. Most previous such work has employed regular inference techniques which generate modest-size finite-state models. They typically suppress parameters of messages, although these have a significant impact on control flow in many communication protocols. We present a framework, which adapts regular inference to include data parameters in messages and states for generating components with large or infinite message alphabets. A main idea is to adapt the framework of predicate abstraction, successfully used in formal verification. Since we are in a black-box setting, the abstraction must be supplied externally, using information about how the component manages data parameters. We have implemented our techniques by connecting the LearnLib tool for regular inference with an implementation of SIP in ns-2 and an implementation of TCP in Windows 8, and generated models of SIP and TCP components.