Using Haskell to script combinatoric testing of web services

I. S.W.B. Prasetya; J. Amorim; T. E.J. Vos; A. Baars

Using Haskell to script combinatoric testing of web services

I. S.W.B. Prasetya^*
, J. Amorim
, T. E.J. Vos
, A. Baars

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference Article in proceeding › Academic › peer-review

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.

Original language	English
Title of host publication	Proceedings of the 6th Iberian Conference on Information Systems and Technologies, CISTI 2011
Publication status	Published - 2011
Externally published	Yes
Event	6th Iberian Conference on Information Systems and Technologies, CISTI 2011 - Chaves, Portugal Duration: 15 Jun 2011 → 18 Jun 2011

Publication series

Series	Proceedings of the Iberian Conference on Information Systems and Technologies, CISTI

Conference

Conference	6th Iberian Conference on Information Systems and Technologies, CISTI 2011
Abbreviated title	CISTI 2011
Country/Territory	Portugal
City	Chaves
Period	15/06/11 → 18/06/11

Keywords

automated testing
combinatoric testing

Cite this

@inproceedings{b5e0752d91014e0887d75e67f3348d98,

title = "Using Haskell to script combinatoric testing of web services",

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 = "automated testing, combinatoric testing",

author = "Prasetya, \{I. S.W.B.\} and J. Amorim and Vos, \{T. E.J.\} and A. Baars",

year = "2011",

language = "English",

isbn = "9789899624757",

series = "Proceedings of the Iberian Conference on Information Systems and Technologies, CISTI ",

publisher = "CISTI",

booktitle = "Proceedings of the 6th Iberian Conference on Information Systems and Technologies, CISTI 2011",

note = "6th Iberian Conference on Information Systems and Technologies, CISTI 2011, CISTI 2011 ; Conference date: 15-06-2011 Through 18-06-2011",

}

Prasetya, ISWB, Amorim, J, Vos, TEJ & Baars, A 2011, Using Haskell to script combinatoric testing of web services. in Proceedings of the 6th Iberian Conference on Information Systems and Technologies, CISTI 2011., 5974321, Proceedings of the Iberian Conference on Information Systems and Technologies, CISTI , 6th Iberian Conference on Information Systems and Technologies, CISTI 2011, Chaves, Portugal, 15/06/11.

Using Haskell to script combinatoric testing of web services. / Prasetya, I. S.W.B.; Amorim, J.; Vos, T. E.J. et al.
Proceedings of the 6th Iberian Conference on Information Systems and Technologies, CISTI 2011. 2011. 5974321 (Proceedings of the Iberian Conference on Information Systems and Technologies, CISTI ).

Research output: Chapter in Book/Report/Conference proceeding › Conference Article in proceeding › Academic › peer-review

TY - GEN

T1 - Using Haskell to script combinatoric testing of web services

AU - Prasetya, I. S.W.B.

AU - Amorim, J.

AU - Vos, T. E.J.

AU - Baars, A.

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - automated testing

KW - combinatoric testing

UR - https://www.scopus.com/pages/publications/80052440645

UR - https://www.researchgate.net/publication/230726890_Using_Haskell_to_script_combinatoric_testing_of_Web_Services

M3 - Conference Article in proceeding

AN - SCOPUS:80052440645

SN - 9789899624757

T3 - Proceedings of the Iberian Conference on Information Systems and Technologies, CISTI

BT - Proceedings of the 6th Iberian Conference on Information Systems and Technologies, CISTI 2011

T2 - 6th Iberian Conference on Information Systems and Technologies, CISTI 2011

Y2 - 15 June 2011 through 18 June 2011

ER -

Using Haskell to script combinatoric testing of web services

Abstract

Publication series

Conference

Keywords

Other files and links

Fingerprint

Cite this