loading...
Automated Metamorphic Testing
Dallas, Texas November 03-November 06
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CMPSAC.2003.124531927th Annual International Computer So ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Arnaud Gotlieb, IRISA / INRIA
Bernard Botella, THALES Airborne Systems
Usual techniques for automatic test data generation are based on the assumption that a complete oracle will be available during the testing process. However, there are programs for which this assumption is unreasonable. Recently, Chen et al. [3, 4] proposed to overcome this obstacle by using known relations over the input data and their unknown expected outputs to seek a subclass of faults inside the program. In this paper, we introduce an automatic testing framework able to check these so-called metamorphic relations. The framework makes use of Constraint Logic Programming techniques to find test data that violate a given metamorphic-relation. Circumstances where it can also prove that the program satisfies this relation are presented. The first experimental results we got with a prototype tool build on the top of the test data generator INKA, show that this methodogy can be completely automated.
Citation:
Arnaud Gotlieb, Bernard Botella, "Automated Metamorphic Testing," compsac, pp.34, 27th Annual International Computer Software and Applications Conference, 2003
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions