Conformance Checking and Pushdown Reactive Systems

Abstract

Due to their asynchronous interactions, testing reactive systems is a  laborious activity present in any software development project. In this setting, the finite memory formalism of Labeled Transition Systems has been used to generate test suites that can be applied to check ioco conformance of implementations to a given specification. In this work we turn to a more complex scenario where a stronger formalism is considered, the Visibly Pushdown Labeled Transition System (VPTS), which allows access to a potentially infinite pushdown memory. We study an extension of the ioco conformance relation to VPTS models and develop polynomial time algorithms to verify conformance for VPTS models in a white-box testing scenario.