QuickChecking static analysis properties. (September 2017)

• Record Type: Journal Article
• Authors: Midtgaard, Jan; Møller, Anders
• Other Names: Fraser Gordon guestEditor.; Marinov Darko guestEditor.
• Is Part Of: Software testing, verification & reliability. Volume 27:Number 6(2017)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2017-09
• Subjects: domain‐specific languages -- monotonicity -- quickchecking -- static program analysis; Computer software -- Testing -- Periodicals; Computer software -- Verification -- Periodicals; Computer software -- Reliability -- Periodicals; 005.14
• DOI: 10.1002/stvr.1640
• Languages: English
• ISSNs: 0960-0833

Abstract

Summary: A static analysis can check programs for potential errors. A natural question that arises is therefore: who checks the checker? Researchers have given this question varying attention, ranging from basic testing techniques, informal monotonicity arguments, thorough pen‐and‐paper soundness proofs, to verified fixed point checking. In this paper, we demonstrate how quickchecking can be useful to test a range of static analysis properties with limited effort. We show how to check a range of algebraic lattice properties, to help ensure that an implementation follows the formal specification of a lattice. Moreover, we offer a number of generic, type‐safe combinators to check transfer functions and operators on lattices, to help ensure that these are, eg, monotone, strict, or invariant. We substantiate our claims by quickchecking a type analysis for the Lua programming language. Abstract : The combination of QuickCheck (property‐based testing) with (1) a reusable test suite of common algebraic properties and (2) a domain‐specific language of test signatures is effective for locating errors in a static analysis implementation and for increased test coverage of the underlying source code.