QuickSpec: Guessing Formal Specifications using Testing
Paper i proceeding, 2010

We present QuickSpec, a tool that automatically generates algebraic specifications for sets of pure functions. The tool is based on testing, rather than static analysis or theorem proving. The main challenge QuickSpec faces is to keep the number of generated equations to a minimum while maintaining completeness. We demonstrate how QuickSpec can improve one’s understanding of a program module by exploring the laws that are generated using two case studies: a heap library for Haskell and a fixed-point arithmetic library for Erlang.

Författare

Koen Lindström Claessen

Chalmers, Data- och informationsteknik, Programvaruteknik (Chalmers)

Nicholas Smallbone

Chalmers, Data- och informationsteknik, Programvaruteknik (Chalmers)

John Hughes

Chalmers, Data- och informationsteknik, Programvaruteknik (Chalmers)

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 6143 6-21

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1007/978-3-642-13977-2_3

ISBN

978-3-642-13976-5