Deriving Compositional Random Generators
Paper in proceeding, 2019
In this work, we develop an extensible framework for deriving compositional generators, which can be easily combined in different ways in order to fit developers’ demands using a simple type level description language. Our framework relies on familiar ideas from the à la Carte technique for writing composable interpreters in Haskell. In particular, we adapt this technique with the machinery required in the scope of random generation, showing how concepts like generation frequency or terminal constructions can also be expressed in the same type-level fashion. We provide an implementation of our ideas, and evaluate its performance using real world examples.
Haskell
type-level programming
random testing
Author
Claudio Agustin Mista
Chalmers, Computer Science and Engineering (Chalmers), Information Security
Alejandro Russo
Chalmers, Computer Science and Engineering (Chalmers), Information Security
ACM International Conference Proceeding Series
Vol. 25 September 2019
978-145037562-7 (ISBN)
Singapore, Singapore,
Octopi: Säker Programering för Sakernas Internet
Swedish Foundation for Strategic Research (SSF) (RIT17-0023), 2018-03-01 -- 2023-02-28.
WebSec: Securing Web-driven Systems
Swedish Foundation for Strategic Research (SSF) (RIT17-0011), 2018-03-01 -- 2023-02-28.
Areas of Advance
Information and Communication Technology
Subject Categories
Embedded Systems
Computer Science
Computer Systems
DOI
10.1145/3412932.3412943
ISBN
9781450375627