A coverage metric for the validation of interacting processes
Proceedings of the conference on Design, automation and test in Europe: Proceedings
| Hi-index | 0.00 |
Verification and validation are two important technologies to assure the reliability and quality of software. Software testing and metrics are two approaches to execute the verification and validation. In sequential computation, there is a fairly sophisticated process with various methodologies and tools available for use in building and demonstrating the correctness of a program being tested. The emergence of concurrent computation in the recent years, however, introduces new testing problems and difficulties that cannot be solved by testing techniques of traditional sequential programs. Many concurrent program testing methodologies are proposed to solve controlled execution and determinism. There are few discusses of concurrent software testing from the inter-task viewpoints. Yet, the common characteristics of concurrent programming are explicit identification of the large grain parallel computation units (tasks), and the explicit inter-task communication via a rendezvous-style mechanism. In this paper, we focus the testing view on the concurrent programming through task decomposition. We propose four testing criteria to test a concurrent program. Programmer can choose an appropriate testing strategy depending on the properties of concurrent programs. Associated with the strategies, four equations are provided to measure the complexity of concurrent programs.