Write a Blog >>
ICFP 2018
Sun 23 - Sat 29 September 2018 St. Louis, Missouri, United States
Fri 28 Sep 2018 14:00 - 14:30 at Illinois Central - Session 6 Chair(s): Brent Yorgey

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
Times are displayed in time zone: Guadalajara, Mexico City, Monterrey change

13:30 - 15:00: Session 6Haskell at Illinois Central
Chair(s): Brent YorgeyHendrix College
13:30 - 14:00
A Promise Checked Is a Promise Kept: Inspection Testing
Joachim BreitnerDFINITY Foundation
14:00 - 14:30
Branching Processes for QuickCheck Generators
Agustín MistaUniversidad Nacional de Rosario, Argentina, Alejandro RussoChalmers University of Technology, Sweden, John HughesChalmers University of Technology, Sweden
14:30 - 15:00
Coherent Explicit Dictionary Application for Haskell
Thomas WinantKU Leuven, Belgium, Dominique DevrieseVrije Universiteit Brussel, Belgium
DOI File Attached