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

Displayed time zone: Guadalajara, Mexico City, Monterrey change

13:30 - 15:00
Session 6Haskell at Illinois Central
Chair(s): Brent Yorgey Hendrix College
13:30
30m
Talk
A Promise Checked Is a Promise Kept: Inspection Testing
Haskell
Joachim Breitner DFINITY Foundation
DOI
14:00
30m
Talk
Branching Processes for QuickCheck Generators
Haskell
Agustín Mista Universidad Nacional de Rosario, Argentina, Alejandro Russo Chalmers University of Technology, Sweden, John Hughes Chalmers University of Technology, Sweden
DOI
14:30
30m
Talk
Coherent Explicit Dictionary Application for Haskell
Haskell
Thomas Winant KU Leuven, Belgium, Dominique Devriese Vrije Universiteit Brussel, Belgium
DOI File Attached