Challenges to support automated random testing for dynamically typed languages

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/inria-00614769
Contributor : Lse Lse <>
Submitted on : Tuesday, August 16, 2011 - 1:39:26 PM
Last modification on : Thursday, February 21, 2019 - 10:52:50 AM
Long-term archiving on : Monday, November 12, 2012 - 3:26:38 PM

File

Duca11a-IWST11-RandomTesting.p...
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00614769, version 1

Citation

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⟩

Share

Metrics

Record views

293

Files downloads

1650