Misplaced Pages

Minimal reproducible example

Article snapshot taken from[REDACTED] with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (October 2024) (Learn how and when to remove this message)

In computing, a minimal reproducible example (abbreviated MRE) is a collection of source code and other data files which allow a bug or problem to be demonstrated and reproduced. The important feature of a minimal reproducible example is that it is as small and as simple as possible, such that it is just sufficient to demonstrate the problem, but without any additional complexity or dependencies which will make resolution harder. Furthermore it would probably expose the problem with as low as possible efforts and runtime, to allow testing a new software version as efficiently as possible for the problem.

A minimal reproducible example may also be referred to as a reprex, a minimal working example (MWE), a minimal complete verifiable example (MCVE), or a short self-contained correct example (SSCCE).

External links

References

  1. Haller, Benjamin C. (13 October 2022). "Ten simple rules for reporting a bug". PLOS Computational Biology. 18 (10): e1010540. Bibcode:2022PLSCB..18E0540H. doi:10.1371/journal.pcbi.1010540. PMC 9562159. PMID 36227808., "Rule 6"
Category:
Minimal reproducible example Add topic