Static typing for a faulty lambda calculus

David Walker, Lester Mackey, Jay Ligatti, George A. Reis, David I. August

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Scopus citations

Abstract

A transient hardware fault occurs when an energetic particle strikes a transistor, causing it to change state. These faults do not cause permanent damage, but may result in incorrect program execution by altering signal transfers or stored values. While the likelihood that such transient faults will cause any significant damage may seem remote, over the last several years transient faults have caused costly failures in high-end machines at America Online, eBay, and the Los Alamos Neutron Science Center, among others [6, 44, 15]. Because susceptibility to transient faults is proportional to the size and density of transistors, the problem of transient faults will become increasingly important in the coming decades. This paper defines the first formal, type-theoretic framework for studying reliable computation in the presence of transient faults. More specifically, it defines λzap, a lambda calculus that exhibits intermittent data faults. In order to detect and recover from these faults, λzap programs replicate intermediate computations and use majority voting, thereby modeling software-based fault tolerance techniques studied extensively, but informally [10, 20, 30, 31, 32, 33, 41]. To ensure that programs maintain the proper invariants and use λzap primitives correctly, the paper defines a type system for the language. This type system guarantees that well-typed programs can tolerate any single data fault. To demonstrate that λzap can serve as an idealized typed intermediate language, we define a type-preserving translation from a standard simply-typed lambda calculus into λzap.

Original languageEnglish (US)
Title of host publicationICFP'06 - Proceedings of the Eleventh ACM SIGPLAN International Conference on Functional Programming
Pages38-49
Number of pages12
DOIs
StatePublished - Dec 1 2006
EventICFP'06 - Eleventh ACM SIGPLAN International Conference on Functional Programming - Portland, OR, United States
Duration: Sep 16 2006Sep 21 2006

Publication series

NameProceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP
Volume2006

Other

OtherICFP'06 - Eleventh ACM SIGPLAN International Conference on Functional Programming
CountryUnited States
CityPortland, OR
Period9/16/069/21/06

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint Dive into the research topics of 'Static typing for a faulty lambda calculus'. Together they form a unique fingerprint.

Cite this