Automated Unit Test Generation for Python · HackerPapers discussions

Automated Unit Test Generation for Python — mentioned by usagitoneko97

Tue, 01 Jun 2021 15:42:47 GMT

Just skimmed through the paper: https://arxiv.org/pdf/2007.14049.pdf, it seems like they are using some sort of heuristically mutating a test suite until it's fully branch covered, based on calculating `branch distance` for each predicate. Why isn't a SMT solver like Z3-solver being used here to solve for the predicate (generating inputs to evaluate to true/false)? Since it's getting so powerful, and python container/dict/string(regex) operation can also be modeled conveniently. And I'm also wondering, whether there is a return based automatic test generation, that start from the return…

Paper and discussion history. A mention is not an endorsement.

Automated Unit Test Generation for Python — mentioned by mmmkkaaayy

Tue, 01 Jun 2021 11:00:46 GMT

There wasn't much info on the GitHub repo about how it actually works. Here's the paper from the authors: https://arxiv.org/abs/2007.14049 From what I gather from the paper, they frame the problem of test generation as a search problem. An evolutionary algorithm randomly mutates a randomly generated test suite. The evolutionary algorithm optimizes for greater branch coverage. Excerpt from the abstract: "Our experiments confirm that evolutionary algorithms can outperform random test generation also in the context of Python, and can even alleviate the problem of absent type information to some…

Paper and discussion history. A mention is not an endorsement.

Automated Unit Test Generation for Python — mentioned by khimaros

Tue, 01 Jun 2021 04:54:47 GMT

preprint available for those curious about how this works: https://arxiv.org/abs/2007.14049

Paper and discussion history. A mention is not an endorsement.