Title :
Using Haskell to script combinatoric testing of Web Services
Author :
Prasetya, I.S.W.B. ; Amorim, J. ; Vos, T.E.J. ; Baars, A.
Author_Institution :
Dept. of Inf. & Comp. Sci., Utrecht Univ., Utrecht, Netherlands
Abstract :
The Classification Tree Method (CTM) is a popular approach in functional testing as it allows the testers to systematically partition the input domain of an SUT, and specifies the combinations they want. We have implemented the approach as a small domain specific language (DSL) embedded in the functional language Haskell. Such an embedding leads to clean syntax and moreover we can natively access Haskell´s full features. This paper will explain the approach, and how it is applied for testing Web Services.
Keywords :
Web services; pattern classification; program testing; tree data structures; CTM; DSL; Haskell; SUT; classification tree method; domain specific language; functional language Haskell; functional testing; script combinatoric testing; web services; Cities and towns; Strips; automated testing; combinatoric testing;
Conference_Titel :
Information Systems and Technologies (CISTI), 2011 6th Iberian Conference on
Conference_Location :
Chaves
Print_ISBN :
978-1-4577-1487-0
