12 research outputs found
Formal Methods in Conformance Testing: A Probabilistic Refinement
This paper refines the framework of âFormal Methods in Conformance Testingâ by introducing
probabilities for concepts which have a stochastic nature. Test execution is refined into test
runs, where each test run is considered as a stochastic process that returns a possible observa-
tion with a certain probability. This implies that not every possible observation that could be
made, will actually be made. The development process of an implementation from a specifica-
tion is also viewed as a stochastic process that may result in a specific implementation with a
certain probability. Together with a weight assignment on implementations this introduces a
valuation measure on implementations. The test run probabilities and the valuation measures
are integrated in generalized definitions of soundness and exhaustiveness, which can be used
to compare test suites with respect to their ability to accept correct, and to reject erroneous
implementations
Conformance Testing with Labelled Transition Systems: Implementation Relations and Test Generation
This paper studies testing based on labelled transition systems, presenting two test generation algorithms with their corresponding implementation relations. The first algorithm assumes that implementations communicate with their environment via symmetric, synchronous interactions. It is based on the theory of testing equivalence and preorder, as is most of the testing theory for labelled transition systems, and it is found in the literature in some slightly different variations. The second algorithm is based on the assumption that implementations communicate with their environment via inputs and outputs. Such implementations are formalized by restricting the class of labelled transition systems to those systems that can always accept input actions. For these implementations a testing theory is developed, analogous to the theory of testing equivalence and preorder. It consists of implementation relations formalizing the notion of conformance of these implementations with respect to labelled transition system specifications, test cases and test suites, test execution, the notion of passing a test suite, and the test generation algorithm, which is proved to produce sound test suites for one of the implementation relations