Algebraic theory of processes
Markov analysis of software specifications
ACM Transactions on Software Engineering and Methodology (TOSEM)
Statistical testing of software based on a usage model
Software—Practice & Experience
Testing preorders for probabilistic processes
Information and Computation
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
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
Usage model-based automated testing of C++ templates
A-MOST '05 Proceedings of the 1st international workshop on Advances in model-based testing
Specification, testing and implementation relations for symbolic-probabilistic systems
Theoretical Computer Science
A testing scenario for probabilistic automata
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Derivation of a suitable finite test suite for customized probabilistic systems
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
| Hi-index | 0.00 |
In order to test the correctness of an IUT (implementation under test) with respect to a specification, testing its whole behavior is desirable but unfeasible. In some situations, testing the behavior of the IUT assuming that it is stimulated by a given usage model is more appropriate. Though considering this approach to test functional behaviors consists simply in testing a subset of the IUT, to study the probabilistic behavior of systems by using this customized testing approach leads to some new possibilities. If usage models specify the probabilistic behavior of stimuli and specifications define the probabilistic behavior of reactions to these stimuli, then, by composing them, the probabilistic behavior of any behavior is completely specified. So, after a finite set of behaviors of the IUT is checked, we can compute an upper bound of the probability that a user following the usage model finds an error in the IUT. This can be done by considering the worst case scenario, that is, that any unchecked behavior is wrong.