Stephen Tse Steve Zdancewic University of Pennsylvania  Home/Search
Context
Related
| upenn.edu/~stevez/papers/./TZ04b.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: upenn.edu/~stevez/...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: program analyses such as binding time, information flow, slicing, and function call tracking. DCC uses a lattice of monads and a nonstandard typing rule for their associated bind operations to describe the dependency of computations in a program. Abadi et al. proved a noninterference theorem that establishes the correctness of DCC's type system and thus the correctness of the type systems for the analyses above. (Update)
Active bibliography (related documents): More All
0.5: Chasing Bottoms - A Case Study in Program Verification in.. - Danielsson, Jansson (2004) (Correct)
0.3: Verified Interoperable Implementations of Security Protocols - Karthikeyan Bhargavan Edric (2006) (Correct)
0.3: A Bisimulation for Dynamic Sealing - Sumii, Pierce (2004) (Correct)
Similar documents based on text: More All
0.4: Run-time Principals in Information-flow Type Systems - Stephen Tse Steve (2004) (Correct)
0.2: A Theory of Aspects - Walker, Zdancewic, Ligatti (2003) (Correct)
0.1: Syntactic Type Abstraction - Grossman, Morrisett, Zdancewic (2000) (Correct)
BibTeX entry: (Update)
@misc{ steve-translating,
author = "Stephen Tse Steve",
title = "Translating Dependency into Parametricity",
url = "citeseer.ist.psu.edu/650196.html" }
Citations (may not include all citations):369 Information and Computation (context) - Moggi, computation - 1991
325 Towards a theory of type structure (context) - Reynolds - 1974
229 Foundations for Programming Languages (context) - Mitchell - 1996
152 A sound type system for secure flow analysis - Volpano, Smith et al. - 1996
143 Theorems for free - Wadler - 1989
121 A core calculus of dependency - Abadi, Banerjee et al. - 1999
102 The SLam calculus: Programming with secrecy and integrity - Heintze, Riecke - 1998
97 and parametric polymorphism (context) - Reynolds, abstraction - 1983
95 Language-based information-flow security - Sabelfeld, Myers - 2003
64 Types and Programming Languages (context) - Pierce - 2002
47 A PER model of secure information flow in sequential program.. - Sabelfeld, Sands - 2001
47 Information flow inference for ML - Pottier, Simonet - 2002
26 Secure information flow and CPS - Zdancewic, Myers - 2001
21 Logical relations for encryption - Sumii, Pierce - 2001
14 Programming Languages for Information Security (context) - Zdancewic - 2002
13 Interpretation Functionelle et Elimination des Coupures dans.. (context) - Girard - 1972
13 Run-time principals in information-flow type systems - Tse, Zdancewic - 2004
5 Phantom types and subtyping (context) - Fluet, Pucella - 2002
4 Simple relational correctness proofs for static analyses and.. - Benton - 2004
4 Boxes go bananas: Encoding higher-order abstract syntax with.. (context) - Washburn, Weirich - 2003
3 A bisimulation for dynamic sealing - Sumii, Pierce - 2004
2 Free theorems in the presence of seq - Johann, Voigtlander - 2004
1 Parametricity and unboxing with pointed types (context) - Launchbury, Paterson - 1996
Documents on the same site (http://www.cis.upenn.edu/~stevez/papers/publications.html): More
Principals in Programming Languages: Technical Results - Zdancewic, Grossman (1999) (Correct)
Secure Program Partitioning - Zdancewic, Zheng, Nystrom, Myers (2002) (Correct)
Secure Information Flow via Linear Continuations - Zdancewic, Myers (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC