• 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, and this paper generalizes the self-compositional approach with a form of information downgrading recently proposed by Li and Zdancewic. Expand
Flow-sensitive type qualifiers
An efficient constraint-based inference algorithm is obtained that integrates flow-insensitive alias analysis, effect inference, and ideas from linear type systems to support strong updates. Expand
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
Quantitative Information Flow - Verification Hardness and Possibilities
It is shown that universally quantifying the distribution in the comparison problem, that is, comparing two programs according to the entropy based definitions on which has the larger flow for all distributions, is a 2-safety problem in general and is coNP-complete when restricted for loop-free boolean programs. Expand
A Type System for Observational Determinism
  • Tachio Terauchi
  • Computer Science
  • 21st IEEE Computer Security Foundations Symposium
  • 23 June 2008
A type system verifies observational determinism by itself, and does not require the type checked program to be confluent, and a polynomial time type inference algorithm is presented. Expand
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
Checking and inferring local non-aliasing
This paper presents a type and effect system for checking the correctness of these annotations, and develops efficient constraint-based algorithms implementing these type checking systems. Expand
Dependent types from counterexamples
The paper presents the type inference system, reports on the experience with a prototype implementation that infers dependent types for a subset of the Ocaml language, and makes non-trivial use of "linear" intersection types in the refinement phase. Expand
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
Decomposition Instead of Self-Composition for k-Safety
We describe a novel technique for proving k-safety properties (non-interference, determinism, etc.) via a decomposition that enables one to leverage non-relational reasoning techniques. The key isExpand