Sciweavers

310 search results - page 1 / 62
» Sound and complete models of contracts
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
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
DAGSTUHL
2004
13 years 6 months ago
Making Specifications Complete Through Models
Good components need precise contracts. In the practice of Design by ContractTM , applications and libraries typically express, in their postconditions and class invariants, only a...
Bernd Schoeller, Tobias Widmer, Bertrand Meyer
IFM
2009
Springer
183views Formal Methods» more  IFM 2009»
13 years 2 months ago
Challenges in the Specification of Full Contracts
Abstract. The complete specification of full contracts -- contracts which include tolerated exceptions, and which enable reasoning about the contracts themselves, can be achieved u...
Gordon J. Pace, Gerardo Schneider
TIC
2000
Springer
124views System Software» more  TIC 2000»
13 years 8 months ago
Sound and Complete Elimination of Singleton Kinds
Singleton kinds provide an elegant device for expressing type equality information resulting from modern module languages, but they can severely complicate the metatheory of langu...
Karl Crary