Quick Specifications for the Busy Programmer
Artikel i vetenskaplig tidskrift, 2017

QuickSpec is a theory exploration system which tests a Haskell program to find equational properties of it, automatically. The equations can be used to help understand the program, or as lemmas to help prove the program correct. QuickSpec is largely automatic: the user just supplies the functions to be tested and QuickCheck data generators. Previous theory exploration systems, including earlier versions of QuickSpec itself, scaled poorly. This paper describes a new architecture for theory exploration with which we can find vastly more complex laws than before, and much faster. We demonstrate theory exploration in QuickSpec on problems both from functional programming and mathematics.

Författare

Nicholas Smallbone

Programvaruteknik

Moa Johansson

Programvaruteknik

Koen Lindström Claessen

Programvaruteknik

Maximilian Algehed

Chalmers, Data- och informationsteknik

Journal of Functional Programming

0956-7968 (ISSN) 1469-7653 (eISSN)

Vol. 27

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1017/S0956796817000090

Mer information

Skapat

2017-10-08