The complexity of coverage Conference Paper


Author(s): Chatterjee, Krishnendu; de Alfaro, Luca; Majumdar, Ritankar S
Title: The complexity of coverage
Title Series: LNCS
Affiliation
Abstract: We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between the tester and the system, where the system state space is partitioned according to some coverage criterion and the objective of the tester is to maximize the set of partitions (or coverage goals) visited during the game. We show the complexity of the maximal coverage problem for non-deterministic systems is PSPACE-complete, but is NP-complete for deterministic systems. For the special case of non-deterministic systems with a re-initializing “reset” action, which represent running a new test input on a re-initialized system, we show that the complexity is coNP-complete. Our proof technique for reset games uses randomized testing strategies that circumvent the exponentially large memory requirement of deterministic testing strategies.
Conference Title: APLAS: Asian Symposium on Programming Languages and Systems
Volume: 5356
Conference Dates: December 9-11, 2008
Conference Location: Bangalore, India
Publisher: Springer  
Date Published: 2008-12-03
Start Page: 91
End Page: 106
Sponsor: This research was supported in part by the NSF grants CCR-0132780 and CNS-0720884.
URL:
DOI: 10.1007/978-3-540-89330-1_7
Open access: yes (repository)
IST Austria Authors
Related IST Austria Work