Challenges to support automated random testing for dynamically typed languages

Stéphane Ducasse (1) , Manuel Oriol (2) , Alexandre Bergel (3)

1 RMOD - Analyses and Languages Constructs for Object-Oriented Application Evolution
2 CS-YORK - Department of Computer Science [York]
3 DCC - Computer Science Department [Santiago]

Automated random testing is a proven way to identify bugs and precondition violations, and this even in well tested libraries. In the context of statically typed languages, current automated random testing tools heavily take advantage of static method declaration (argument types, thrown exceptions) to constrain input domains while testing and to identify errors. For such reason, automated random testing has not been investigated in the context of dynamically typed languages. In this paper we present the key challenges that have to be addressed to support automated testing in dynamic languages.

Domaines: Langage de programmation [cs.PL]

Stéphane Ducasse, Manuel Oriol, Alexandre Bergel. Challenges to support automated random testing for dynamically typed languages. International Workshop on Smalltalk Technologies, Aug 2011, Edinburgh, United Kingdom. ⟨inria-00614769⟩