The Complexity of Coverage

Authors:
Krishnendu Chatterjee;Luca Alfaro;Rupak Majumdar
Affiliations:
CE, University of California, Santa Cruz, USA;CE, University of California, Santa Cruz, USA;CS, University of California, Los Angeles, USA
Venue:
APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
Year:
2008

Citing 12
Cited 0

Distinguishing tests for nondeterministic and probabilistic machines

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
Discrete-time control for rectangular hybrid automata

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Testing for Finite State Systems

Proceedings of the 12th International Workshop on Computer Science Logic
The Theory of Timed Automata

Proceedings of the Real-Time: Theory in Practice, REX Workshop
Testing transition systems: an annotated bibliography

Modeling and verification of parallel processes
Optimization problems from feature testing of communication protocols

ICNP '96 Proceedings of the 1996 International Conference on Network Protocols (ICNP '96)
Testing, Optimizaton, and Games

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Introduction to Software Testing

Introduction to Software Testing
A theory of predicate-complete test coverage and generation

FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Play to test

FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing

Quantified Score

Hi-index	0.00

Visualization

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.