ReTest: Framework for applying TDD in the development of non-deterministic algorithms

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

TDD is a technique traditionally applied in applications with deterministic algorithms, when you have a known input and an expected result. Therefore, the challenge is to implement this technique in applications with non-deterministic algorithms, specifically when several random choices need to be made during its execution. The purpose of this paper is to present the ReTest framework, a JUnit extension, that allows an extension of the TDD technique, to enable its use for the development of non-deterministic algorithms.

Cite

CITATION STYLE

APA

Ivo, A. A. S., & Guerra, E. M. (2017). ReTest: Framework for applying TDD in the development of non-deterministic algorithms. In Communications in Computer and Information Science (Vol. 680, pp. 72–84). Springer Verlag. https://doi.org/10.1007/978-3-319-55907-0_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free