Branching Processes for QuickCheck Generators
In QuickCheck (or, more generally, random testing), it is challenging to control random data generators' distributions—specially when it comes to user-defined algebraic data types (ADT). In this paper, we adapt results from an area of mathematics known as branching processes, and show how they help to analytically predict (at compile-time) the expected number of generated constructors, even in the presence of mutually recursive or composite ADTs. Using our probabilistic formulas, we design heuristics capable of automatically adjusting probabilities in order to synthesize generators which distributions are aligned with users' demands. We provide a Haskell implementation of our mechanism in a tool called DRaGeN and perform case studies with real-world applications. When generating random values, our synthesized QuickCheck generators show improvements in code coverage when compared with those automatically derived by state-of-the-art tools.
Fri 28 Sep
|13:30 - 14:00|
Joachim BreitnerDFINITY FoundationDOI
|14:00 - 14:30|
Agustín MistaUniversidad Nacional de Rosario, Argentina, Alejandro RussoChalmers University of Technology, Sweden, John HughesChalmers University of Technology, SwedenDOI
|14:30 - 15:00|