• Publications
  • Influence
Secure Information Flow as a Safety Problem
The termination insensitive secure information flow problem can be reduced to solving a safety problem via a simple program transformation. Barthe, D'Argenio, and Rezk coined the termExpand
  • 265
  • 26
  • PDF
Flow-sensitive type qualifiers
We present a system for extending standard type systems with flow-sensitive type qualifiers. Users annotate their programs with type qualifiers, and inference checks that the annotations are correct.Expand
  • 366
  • 24
  • PDF
Exploring MARS: developing indoor and outdoor user interfaces to a mobile augmented reality system
We describe an experimental mobile augmented reality system (MARS) testbed that employs different user interfaces to allow outdoor and indoor users to access and manage information that is spatiallyExpand
  • 491
  • 18
  • PDF
Decomposition instead of self-composition for proving the absence of timing channels
We present a novel approach to proving the absence of timing channels. The idea is to partition the program's execution traces in such a way that each partition component is checked for timing attackExpand
  • 69
  • 8
  • PDF
Quantitative Information Flow - Verification Hardness and Possibilities
Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the guessing entropy, and channelExpand
  • 64
  • 8
  • PDF
A Type System for Observational Determinism
  • Tachio Terauchi
  • Computer Science
  • 21st IEEE Computer Security Foundations Symposium
  • 23 June 2008
Zdancewic and Myers introduced observational determinism as a scheduler independent notion of security for concurrent programs. This paper proposes a type system for verifying observationalExpand
  • 43
  • 8
  • PDF
Checking and inferring local non-aliasing
In prior work [15] we studied a language construct <tt>restrict</tt> that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope. AmongExpand
  • 80
  • 7
  • PDF
A Capability Calculus for Concurrency and Determinism
We present a capability calculus for checking partial confluence of channel-communicating concurrent processes. Our approach automatically detects more programs to be partially confluent thanExpand
  • 18
  • 6
Dependent types from counterexamples
Motivated by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on programmers toExpand
  • 56
  • 5
  • PDF
On Bounding Problems of Quantitative Information Flow
Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the guessing entropy, and channelExpand
  • 26
  • 5