Clotho: A Racket Library for Parametric Randomness
Programs such as simulators and fuzz testers often use randomness to walk through a large state space in search of interesting paths or outcomes. These explorations can be made more efficient by employing heuristics that “zero-in” on paths through the state space that are more likely to lead to interesting solutions. Given one path that exhibits a desired property, it may be beneficial to generate and explore similar paths to determine if they produce similarly interesting results. When the random decisions made during this path exploration can be manipulated in such a way that they correspond to discrete structural changes in the result, we call it parametric randomness.
Many programming languages, including Racket, provide only simple randomness primitives, making the implementation of parametric randomness somewhat difficult. To address this deficiency, we present Clotho: a Racket library for parametric randomness, designed to be both easy to use and flexible. Clotho supports multiple strategies for using parametric randomness in Racket applications without hassle.
Clotho: A Racket Library for Parametric Randomness (scheme20-final1.pdf) | 445KiB |
Fri 28 AugDisplayed time zone: Eastern Time (US & Canada) change
11:30 - 13:00 | |||
11:30 30mTalk | Clotho: A Racket Library for Parametric Randomness Scheme File Attached | ||
12:00 30mTalk | Scheme for scientific computing Scheme Francesco Montanari Universidad Autónoma de Madrid File Attached | ||
12:30 10mTalk | Designing a Programming Environment Based on the Program Design Recipe (Lightning Talk) Scheme Junya Nose Tokyo Institute of Technology, Youyou Cong Tokyo Institute of Technology, Hidehiko Masuhara Tokyo Institute of Technology File Attached | ||
12:40 10mTalk | On Teaching Type Systems as Macros (Lightning Talk) Scheme Youyou Cong Tokyo Institute of Technology, Naoya Furudono Tokyo Institute of Technology, Hidehiko Masuhara Tokyo Institute of Technology File Attached | ||
12:50 10mTalk | Programming with Petri Nets to Reason about Concurrency (Lightning Talk) Scheme Julien Lepiller Yale University File Attached |