Sciweavers

21 search results - page 3 / 5
» Static contract checking for Haskell
Sort
View
JFP
2006
78views more  JFP 2006»
13 years 4 months ago
Sound and complete models of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive highero...
Matthias Blume, David A. McAllester
FAC
2007
170views more  FAC 2007»
13 years 4 months ago
Are the Logical Foundations of Verifying Compiler Prototypes Matching user Expectations?
Abstract. The Verifying Compiler (VC) project proposals suggest that mainstream software developers are its targeted end-users. Like other software engineering efforts, the VC proj...
Patrice Chalin
SEFM
2005
IEEE
13 years 10 months ago
Omnibus Verification Policies: A flexible, configurable approach to assertion-based software verification
The three main assertion-based verification approaches are: Design by Contract (DBC), Extended Static Checking (ESC) and Verified Design by Contract (VDBC). Each approach offers a...
Thomas Wilson, Savi Maharaj, Robert G. Clark
POPL
2010
ACM
14 years 2 months ago
Contracts Made Manifest
Since Findler and Felleisen [2002] introduced higher-order contracts, many variants have been proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in u...
Benjamin C. Pierce, Michael Greenberg, Stephanie W...
ICFP
2004
ACM
14 years 4 months ago
A sound (and complete) model of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
Matthias Blume, David A. McAllester