Reactive NoninterferenceDepartmental Papers (CIS)
Date of this Version11-9-2009
Document TypeConference Paper
AbstractMany programs operate reactively-patiently waiting for user input, running for a while producing output, and eventually returning to a state where they are ready to accept another input (or occasionally diverging). When a reactive program communicates with multiple parties, we would like to be sure that it can be given secret information by one without leaking it to others. Motivated by web browsers and client-side web applications, we explore definitions of noninterference for reactive programs and identify two of special interest-one corresponding to termination-insensitive noninterference for a simple sequential language, the other to termination-sensitive noninterference. We focus on the former and develop a proof technique for showing that program behaviors are secure according to this definition. To demonstrate the viability of the approach, we define a simple reactive language with an information-flow type system and apply our proof technique to show that well-typed programs are secure.
Citation InformationAaron Bohannon, Benjamin C Pierce, Vilhelm Sjoberg, Stephanie Weirich, et al.. "Reactive Noninterference" (2009)
Available at: http://works.bepress.com/stephanie_weirich/33/