QuickSpec: Guessing Formal Specifications using Testing
Paper in proceedings, 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.

Author

Koen Lindström Claessen

Chalmers, Computer Science and Engineering (Chalmers), Software Engineering and Technology (Chalmers)

Nicholas Smallbone

Chalmers, Computer Science and Engineering (Chalmers), Software Engineering and Technology (Chalmers)

John Hughes

Chalmers, Computer Science and Engineering (Chalmers), Software Engineering and Technology (Chalmers)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 6143 6-21

Subject Categories

Computer and Information Science

DOI

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

ISBN

978-3-642-13976-5

More information

Created

10/6/2017