Content deleted Content added
No edit summary |
|||
Line 1:
{{refimprove|date=September 2014}}
'''Random testing''' is a black-box software testing technique where programs are tested by generating random, independent inputs. Results of the output are compared against software specifications to verify that the test output is pass or fail.<ref name="Hamlet94"/> In case of absence of specifications the exceptions of the language are used which means if an exception arises during test execution then it means there is a fault in the program.
== History of random testing ==▼
Random testing was first examined by Melvin Breuer in 1971 and initial effort to evaluate its effectiveness was done by Pratima and Vishwani Agrawal in 1975.<ref>[http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1672882&tag=1 Agrawal, P.; Agrawal, V.D., "Probabilistic Analysis of Random Test Generation Method for Irredundant Combinational Logic Networks," Computers, IEEE Transactions on , vol.C-24, no.7, pp.691,695, July 1975]</ref>▼
In software Duran and Ntafos had examined random testing in 1984.<ref>[http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5010257 Duran, J. and S. Ntafos, An evaluation of random testing, IEEE Trans. Software Eng. SE-10 (July, 1984), 438-444]</ref>. Earlier Howden had termed it functional testing in 1980.▼
== Overview ==
Line 46 ⟶ 53:
While this example is limited to simple types (for which a simple random generator can be used), tools targeting object-oriented languages typically explore the program to test and find generators (constructors or methods returning objects of that type) and call them using random inputs (either themselves generated the same way or generated using a pseudo-random generator if possible). Such approaches then maintain a pool of randomly generated objects and use a probability for either reusing a generated object or creating a new one.<ref name="AutoTest"/>
▲== History of random testing ==
▲Random testing was first examined by Melvin Breuer in 1971 and initial effort to evaluate its effectiveness was done by Pratima and Vishwani Agrawal in 1975.<ref>[http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1672882&tag=1 Agrawal, P.; Agrawal, V.D., "Probabilistic Analysis of Random Test Generation Method for Irredundant Combinational Logic Networks," Computers, IEEE Transactions on , vol.C-24, no.7, pp.691,695, July 1975]</ref>
▲In software Duran and Ntafos had examined random testing in 1984.<ref>[http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5010257 Duran, J. and S. Ntafos, An evaluation of random testing, IEEE Trans. Software Eng. SE-10 (July, 1984), 438-444]</ref>. Earlier Howden had termed it functional testing in 1980.
== On randomness ==
| |||