The Complexity of Coverage

Details The Complexity of Coverage The Complexity of Coverage

2008-04-29

arxiv.org/abs/0804.4525v1

Computer Science

Programming Languages

15 Pages, 1 Figure

Scientific paper

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 again co-NP-complete. Our proof technique for reset games uses randomized testing strategies that circumvent the exponentially large memory requirement in the deterministic case.

Affiliated with

Also associated with

No associations

Rating

The Complexity of Coverage does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Complexity of Coverage, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of Coverage will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-209314