Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System
Paper i proceeding, 2015

This paper presents a generic method for randomly generating well-typed expressions. It starts from a specification of a typing judgment in PLT Redex and uses a specialized solver that employs randomness to find many different valid derivations of the judgment form. Our motivation for building these random terms is to more effectively falsify conjectures as part of the tool-support for semantics models specified in Redex. Accordingly, we evaluate the generator against the other available methods for Redex, as well as the best available custom well-typed term generator. Our results show that our new generator is much more effective than generation techniques that do not explicitly take types into account and is competitive with generation techniques that do, even though they are specialized to particular type-systems and ours is not.

Författare

B. Fetscher

Northwestern University

Koen Lindström Claessen

Chalmers, Data- och informationsteknik, Programvaruteknik

Michal Palka

Chalmers, Data- och informationsteknik, Programvaruteknik

John Hughes

Chalmers, Data- och informationsteknik, Programvaruteknik

R. B. Findler

Northwestern University

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 9032 383-405

Ämneskategorier

Systemvetenskap

DOI

10.1007/978-3-662-46669-8_16

ISBN

978-3-662-46669-8

Mer information

Senast uppdaterat

2018-05-28