Gradual typing embedded securely in JavaScript
- 8 January 2014
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 49 (1), 425-437
- https://doi.org/10.1145/2535838.2535889
Abstract
International audienceJavaScript's flexible semantics makes writing correct code hard and writing secure code extremely difficult. To address the former problem, various forms of gradual typing have been proposed, such as Closure and TypeScript. However, supporting all common programming idioms is not easy; for example, TypeScript deliberately gives up type soundness for programming convenience. In this paper, we propose a gradual type system and implementation techniques that provide important safety and security guarantees. We present TS*, a gradual type system and source-to-source compiler for JavaScript. In contrast to prior gradual type systems, TS* features full runtime reflection over three kinds of types: (1) simple types for higher-order functions, recursive datatypes and dictionary-based extensible records; (2) the type any, for dynamically type-safe TS* expressions; and (3) the type un, for untrusted, potentially malicious JavaScript contexts in which TS* is embedded. After type-checking, the compiler instruments the program with various checks to ensure the type safety of TS* despite its interactions with arbitrary JavaScript contexts, which are free to use eval, stack walks, prototype customizations, and other offensive features. The proof of our main theorem employs a form of type-preserving compilation, wherein we prove all the runtime invariants of the translation of TS* to JavaScript by showing that translated programs are well-typed in JS*, a previously proposed dependently typed language for proving functional correctness of JavaScript programs. We describe a prototype compiler, a secure runtime, and sample applications for TS*. Our examples illustrate how web security patterns that developers currently program in JavaScript (with much difficulty and still with dubious results) can instead be programmed naturally in TS*, retaining a flavor of idiomatic JavaScript, while providing strong safety guarantees by virtue of typingKeywords
This publication has 17 references indexed in Scilit:
- Verifying higher-order programs with the dijkstra monadPublished by Association for Computing Machinery (ACM) ,2013
- Fully abstract compilation to JavaScriptPublished by Association for Computing Machinery (ACM) ,2013
- Safe Wrappers and Sane Policies for Self Protecting JavaScriptLecture Notes in Computer Science, 2012
- Gradual typing for genericsPublished by Association for Computing Machinery (ACM) ,2011
- Secure distributed programming with value-dependent typesPublished by Association for Computing Machinery (ACM) ,2011
- Space-efficient gradual typingHigher-Order and Symbolic Computation, 2010
- Well-Typed Programs Can’t Be BlamedLecture Notes in Computer Science, 2009
- Exploring the Design Space of Higher-Order CastsLecture Notes in Computer Science, 2009
- Defeating script injection attacks with browser-enforced embedded policiesPublished by Association for Computing Machinery (ACM) ,2007
- Dynamic typing in a statically typed languageACM Transactions on Programming Languages and Systems, 1991