We introduce the blame calculus, which adds the notion of blame from Findler and
Felleisen's contracts to a system similar to Siek and Taha's gradual types and Flanagan's …

Communicating finite state machines (CFSMs) represent processes which communicate by
asynchronous exchanges of messages via FIFO channels. Their major impact has been in …

Gradual type systems offer a smooth continuum between static and dynamic typing by
permitting the free mixture of typed and untyped code. The runtime systems for these …

Traditional static type systems are effective for verifying basic interface specifications.
Dynamically checked contracts support more precise specifications, but these are not …

Behavioral software contracts supplement interface information with logical assertions. A
rigorous enforcement of contracts provides useful feedback to developers if it signals …

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 …

A behavioral contract in a higher-order language may invoke methods of unknown objects.
Although this expressive power allows programmers to formulate sophisticated contracts, it …

Since Findler and Felleisen introduced higher-order contracts, many variants have been
proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in using …

Language-based security relies on the assumption that all potential attacks are bound by the
rules of the language in question. When programs are compiled into a different language …

Even well-typed programs can go wrong in modern functional languages, by encountering a
pattern-match failure, or simply returning the wrong answer. An increasingly-popular …