Write a Blog >>
ICFP 2019
Sun 18 - Fri 23 August 2019 Berlin, Germany
Sun 18 Aug 2019 15:20 - 15:40 at Aurora Borealis - Generic Programming and Synthesis Chair(s): Edwin Brady

Since the introduction of QuickCheck, property based testing has proven to be effective for the discovery of bugs. However, defining the properties to test is only part of the story: it is equally important to generate suitable test data. In particular, requiring random test data to satisfy arbitrary preconditions can lead to skewed distributions: for example, naively generating random sorted lists will rarely yield long lists. As a result, developers need to design custom generators carefully—but these generators can become arbitrarily complex. When testing a compiler, for example, it can be quite challenging to define a good generator that is guaranteed to produce well-formed programs. In this brief abstract we propose to address this problem using the observation that well-formed inputs can often be described by (indexed) inductive datatypes. By defining a generic procedure for enumerating indexed datatypes, we can obtain a way of safely generating precise test data.

Sun 18 Aug

tyde-2019-papers
15:20 - 16:40: TyDe 2019 - Generic Programming and Synthesis at Aurora Borealis
Chair(s): Edwin BradyUniversity of St. Andrews, UK
tyde-2019-papers15:20 - 15:40
Talk
Cas van der RestUtrecht University, Wouter SwierstraUtrecht University, Netherlands, Manuel ChakravartyTweag I/O & IOHK
Pre-print
tyde-2019-papers15:40 - 16:00
Talk
Guillaume AllaisUniversity of Strathclyde
Link to publication
tyde-2019-papers16:00 - 16:20
Talk
Bruce CollieUniversity of Edinburgh, Michael O'BoyleUniversity of Edinburgh
Pre-print
tyde-2019-papers16:20 - 16:40
Talk
Peter-Michael OseraGrinnell College
Link to publication