Challenges to support automated random testing for dynamically typed languages

Authors:
Stéphane Ducasse;Manuel Oriol;Alexandre Bergel
Affiliations:
RMoD -- INRIA Lille Nord Europe, France;University of York, UK;University of Chile, Chile
Venue:
Proceedings of the International Workshop on Smalltalk Technologies
Year:
2011

Citing 7
Cited 0

Wrappers to the Rescue

ECCOP '98 Proceedings of the 12th European Conference on Object-Oriented Programming
On the Predictability of Random Tests for Object-Oriented Software

ICST '08 Proceedings of the 2008 International Conference on Software Testing, Verification, and Validation
Finding Faults: Manual Testing vs. Random+ Testing vs. User Reports

ISSRE '08 Proceedings of the 2008 19th International Symposium on Software Reliability Engineering
Fast type reconstruction for dynamically typed programming languages

DLS '09 Proceedings of the 5th symposium on Dynamic languages
Testing .NET Code with YETI

ICECCS '10 Proceedings of the 2010 15th IEEE International Conference on Engineering of Complex Computer Systems
The Qualitas Corpus: A Curated Collection of Java Code for Empirical Studies

APSEC '10 Proceedings of the 2010 Asia Pacific Software Engineering Conference
On the number and nature of faults found by random testing

Software Testing, Verification & Reliability

Quantified Score

Hi-index	0.00

Visualization

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.