Blogs (1) >>
POPL 2019
Sun 13 - Sat 19 January 2019 Cascais, Portugal
Thu 17 Jan 2019 10:36 - 10:58 at Sala I - Gradual Types Chair(s): Nikhil Swamy

In security-typed programming languages, types statically enforce noninterference between potentially conspiring values, such as the arguments and results of functions. But to adopt static security types, like other advanced type disciplines, programmers face a steep wholesale transition, often forcing them to refactor working code just to satisfy their type checker. To provide a gentler path to security typing that supports safe and stylish but hard-to-verify programming idioms, researchers have designed languages that blend static and dynamic checking of security types. Unfortunately most of the resulting languages only support static, type-based reasoning about noninterference if a program is entirely statically secured. This limitation substantially weakens the bene ts that dynamic enforcement brings to static security typing. Additionally, current proposals are focused on languages with explicit casts, and therefore do not ful ll the vision of gradual typing according to which the boundaries between static and dynamic checking only arise from the (im)precision of type annotations, and are transparently mediated by implicit checks.

In this paper we present GSLRef, a gradual security-typed higher-order language with references. As a gradual language, GSLRef supports the range of static-to-dynamic security checking exclusively driven by type annotations, without resorting to explicit casts. Additionally, GSLRef lets programmers use types to reason statically about termination-insensitive noninterference in all programs, even those that enforce security dynamically. We prove that GSLRef satis es all but one of Siek et al.’s criteria for gradually-typed languages, which ensure that programs can seamlessly transition between simple typing and security typing. A notable exception regards the dynamic gradual guarantee, which some speci c programs need to violate if they are required to satisfy noninterference; it remains an open question whether such a language could fully satisfy the dynamic gradual guarantee. To realize this design, we were led to draw a sharp distinction between syntactic type safety and semantic type soundness, each of which constrains the design of the gradual language.

Slides (presentation.pdf)7.81MiB

Thu 17 Jan
Times are displayed in time zone: Greenwich Mean Time : Belfast change

10:36 - 12:04: Gradual TypesResearch Papers at Sala I
Chair(s): Nikhil SwamyMicrosoft Research
10:36 - 10:58
Type-Driven Gradual Security with ReferencesTOPLAS
Research Papers
Matías ToroUniversity of Chile, Ronald GarciaUniversity of British Columbia, Éric TanterUniversity of Chile & Inria Paris
DOI Media Attached File Attached
10:58 - 11:20
Gradual Type Theory
Research Papers
Max NewNortheastern University, Dan LicataWesleyan University, Amal AhmedNortheastern University, USA
Link to publication DOI Media Attached File Attached
11:20 - 11:42
Gradual Parametricity, RevisitedDistinguished Paper
Research Papers
Matías ToroUniversity of Chile, Elizabeth LabradaUniversity of Chile, Éric TanterUniversity of Chile & Inria Paris
Link to publication DOI Pre-print Media Attached File Attached
11:42 - 12:04
Live Functional Programming with Typed Holes
Research Papers
Cyrus OmarUniversity of Chicago, Ian VoyseyCarnegie Mellon University, Ravi ChughUniversity of Chicago, Matthew HammerNone
Link to publication DOI Pre-print Media Attached File Attached