A Formal Analysis of Iterated TDD
<|reference_start|>A Formal Analysis of Iterated TDD: In this paper we formally analyze the software methodology called (iterated) Test Driven Development (TDD). We formally define Specification, Software, Testing, Equivalence Partitions, Coupling, to argue about the nature of the software development in terms of TDD. We formalize Iterative TDD and find a context in which iterated TDD ``provably produce'' ``provably correct code'' from ``specifications'' while being stable in terms of iterated code churns. We demonstrate that outside this context iterated TDD will exhibit chaotic behavior, implying unpredictable messy amount of code churn. We argue that the research finding of ``ineffective'' iterated TDD found by earlier researches are due to missing this context, while the findings of ``effective'' iterated TDD is due to accidentally falling into the context or simply placebo.<|reference_end|>
@article{ruparel2024a,
    title={A Formal Analysis of Iterated TDD},
    author={Hemil Ruparel, Nabarun Mondal},
    journal={arXiv preprint arXiv:2407.12839},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.12839},
    primaryClass={cs.SE cs.SY eess.SY math.DS math.OC}
}