Customized Testing for Probabilistic Systems

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.

[1]  Manuel Núñez,et al.  Algebraic theory of probabilistic processes , 2003, J. Log. Algebraic Methods Program..

[2]  Roberto Segala,et al.  Testing Probabilistic Automata , 1996, CONCUR.

[3]  Jesse H. Poore,et al.  Markov analysis of software specifications , 1993, TSEM.

[4]  Jan Tretmans,et al.  Test Generation with Inputs, Outputs and Repetitive Quiescence , 1996, Softw. Concepts Tools.

[5]  Adam Wolisz,et al.  Formal Techniques for Networked and Distributed Systems - FORTE 2003 , 2003, Lecture Notes in Computer Science.

[6]  Manuel Núñez,et al.  Towards Testing Stochastic Timed Systems , 2003, FORTE.

[7]  Kirk Sayre.  Usage model-based automated testing of C++ templates , 2005, ACM SIGSOFT Softw. Eng. Notes.

[8]  Valentín Valero Ruiz,et al.  Algebraic theory of probabilistic and nondeterministic processes , 2003, J. Log. Algebraic Methods Program..

[9]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[10]  Jesse H. Poore,et al.  Statistical testing of software based on a usage model , 1995, Softw. Pract. Exp..

[11]  David de Frutos-Escrig,et al.  Testing Semantics for Probabilistic LOTOS , 1995, FORTE.

[12]  Manuel Núñez,et al.  Specification, testing and implementation relations for symbolic-probabilistic systems , 2006, Theor. Comput. Sci..

[13]  Frits W. Vaandrager,et al.  A Testing Scenario for Probabilistic Automata , 2003, ICALP.

[14]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[15]  Ivan Christoff,et al.  Testing Equivalences and Fully Abstract Models for Probabilistic Processes , 1990, CONCUR.

[16]  Manuel Núñez,et al.  Encoding PAMR into (Timed) EFSMs , 2002, FORTE.

[17]  Julian Bradfield.  CONCUR '96: Concurrency Theory , 1996 .

[18]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[19]  Rance Cleaveland,et al.  Testing Preorders for Probabilistic Processes , 1992, Inf. Comput..

[20]  Allan Clark,et al.  Semantic-Based Development of Service-Oriented Systems , 2006, FORTE.

[21]  Gregor von Bochmann,et al.  Formal Description Techniques VIII , 1996, IFIP Advances in Information and Communication Technology.