Skip to main content
×
Home
    • Aa
    • Aa

Quick specifications for the busy programmer

  • NICHOLAS SMALLBONE (a1), MOA JOHANSSON (a1), KOEN CLAESSEN (a1) and MAXIMILIAN ALGEHED (a1)
Abstract
Abstract

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.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

J. C. Baez (2002) The octonions. Bull. Am. Math. Soc. 39, 145205.

B. Buchberger , A. Creciun , T. Jebelean , L. Kovacs , T. Kutsia , K. Nakagawa , F. Piroi , N. Popov , J. Robu , M. Rosenkranz & W. Windsteiger (2006) Theorema: Towards computer-aided mathematical theory exploration. J. Appl. Log. 4 (4), 470504.

M. D. Ernst , J.f H. Perkins , P. J. Guo , S. McCamant , C. Pacheco , M. S. Tschantz & C. Xiao (2007) The Daikon system for dynamic detection of likely invariants. Sci. Comput. Program. 69 (1–3), 3545.

P. Henderson (2002) Functional geometry. Higher-Order Symbol. Comput. 15 (4), 349365.

M. Johansson , L. Dixon & A. Bundy (2011) Conjecture synthesis for inductive theories. J. Autom. Reason. 47 (3), 251289.

D. E. Knuth & P. B. Bendix (1983) Simple word problems in universal algebras. In Automation of Reasoning, JrgH. Siekmann & G. Wrightson (eds), Symbolic Computation. Berlin Heidelberg: Springer, pp. 342376.

O. Montano-Rivas , R. McCasland , L. Dixon & A. Bundy (2012) Scheme-based theorem discovery and concept invention. Expert Syst. Appl. 39 (2), 16371646.

R. Moufang (1935) Zur struktur von alternativekörpen. Math. Ann. 110, 416430.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 14 *
Loading metrics...

Abstract views

Total abstract views: 71 *
Loading metrics...

* Views captured on Cambridge Core between 10th July 2017 - 27th July 2017. This data will be updated every 24 hours.