Testing Pushdown Systems
Adilson Luiz Bonifacio, Arnaldo Vieira Moura

TL;DR
This paper extends model-based testing to pushdown systems with stacks, introducing a conformance relation and an efficient polynomial-time algorithm for testing reactive systems with complex behaviors.
Contribution
It introduces a new conformance relation and an efficient polynomial-time algorithm for testing pushdown reactive systems with stacks.
Findings
Conformance checking runs in polynomial time.
The approach handles complex pushdown behaviors.
Test suite generation for pushdown systems is feasible.
Abstract
Testing on reactive systems is a well-known laborious activity on software development due to their asynchronous interaction with the environment. In this setting model based testing has been employed when checking conformance and generating test suites of such systems using labeled transition system as a formalism as well as the classical ioco conformance relation. In this work we turn to a more complex scenario where the target systems have an auxiliary memory, a stack. We then studied a more powerful model, the Visibly Pushdown Labeled Transition System (VPTS), its variant Input/Output VPTS (IOVPTS), its associated model Visibly Pushdown Automaton (VPA), and aspects of conformance testing and test suite generation. This scenario is much more challenge since the base model has a pushdown stack to capture more complex behaviors which commonly found on reactive systems. We then defined…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoftware Testing and Debugging Techniques · Formal Methods in Verification · Software Reliability and Analysis Research
