Static contract checking for haskell
Paper in proceedings, 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

Contract satisfaction

Author

D. N. Xu

University of Cambridge

S. P. Jones

Microsoft Research

Koen Lindström Claessen

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

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

07308566 (ISSN)

41-52

Subject Categories

Computer and Information Science

DOI

10.1145/1480881.1480889

ISBN

978-160558379-2

More information

Latest update

9/6/2018 1