Static Contract Checking for Haskell
Artikel i vetenskaplig tidskrift, 2009

Program errors are hard to detect and are costly both to programmers who spend significant efforts in debugging, and for systems that are guarded by runtime checks. Static verification techniques have been applied to imperative and object-oriented languages, like Java and C#, but few have been applied to a higher-order lazy functional language, like Haskell. In this paper, we describe a sound and automatic static verification framework for Haskell, that is based on contracts and symbolic execution. Our approach is modular and gives precise blame assignments at compile-time in the presence of higher-order functions and laziness.

static

contract checking

functional language

verification

contract satisfaction

Författare

D. N. Xu

University of Cambridge

S. P. Jones

Microsoft Research

Koen Lindström Claessen

Chalmers, Data- och informationsteknik, Programvaruteknik (Chalmers)

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

0362-1340 (ISSN)

Vol. 44 1 41-52

Ämneskategorier

Data- och informationsvetenskap