Algebraic theory of processes
Computer Networks and ISDN Systems - Protocol specification, testing and verification
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Testing preorders for probabilistic processes
Information and Computation
Approximation algorithms
Testing Semantics for Probabilistic LOTOS
Proceedings of the IFIP TC6 Eighth International Conference on Formal Description Techniques VIII
Encoding PAMR into (Timed) EFSMs
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Fault Model-Driven Test Derivation from Finite State Models: Annotated Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Testing Equivalences and Fully Abstract Models for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Testing Probabilistic Automata
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Specification, testing and implementation relations for symbolic-probabilistic systems
Theoretical Computer Science
Weak Mutation Testing and Completeness of Test Sets
IEEE Transactions on Software Engineering
Testing Programs with the Aid of a Compiler
IEEE Transactions on Software Engineering
A testing scenario for probabilistic automata
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A logic for assessing sets of heterogeneous testing hypotheses
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Customized testing for probabilistic systems
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
A formal framework for software product lines
Information and Software Technology
| Hi-index | 0.01 |
In order to check the conformance of an IUT (implementation under test) with respect to a specification, it is not feasible, in general, to test the whole set of IUT available behaviors. In some situations, testing the behavior of the IUT assuming that it is stimulated by a given usage model is more appropriate. Specifically, if we consider that specifications and usage models are defined in probabilistic terms, then by applying a finite set of tests to the IUT we can compute a relevant metric: An upper bound of the probability that a user following the usage model finds an error in the IUT. We also present a method to find an optimal (with respect to the number of inputs) set of tests that minimizes that upper bound.