The following pages link to Steve Zdancewic (Q276493):
Displaying 25 items.
- A type system for robust declassification (Q276494) (← links)
- Arrows for secure information flow (Q964489) (← links)
- An axiomatic specification for sequential memory models (Q1702905) (← links)
- A formal equational theory for call-by-push-value (Q1791198) (← links)
- Secure information flow via linear continuations (Q1870493) (← links)
- (Q2763665) (← links)
- Principals in programming languages (Q2817722) (← links)
- Finite Vector Spaces as Model of Simply-Typed Lambda-Calculi (Q2938180) (← links)
- Formalizing the LLVM intermediate representation for verified program transformations (Q2942893) (← links)
- Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less) (Q3188293) (← links)
- Preserving Secrecy Under Refinement (Q3591420) (← links)
- Modeling Simply-Typed Lambda Calculi in the Category of Finite Vector Spaces (Q4621185) (← links)
- A linear/producer/consumer model of classical linear logic (Q4637629) (← links)
- Mechanized Verification of Computing Dominators for Formalizing Compilers (Q4916051) (← links)
- (Q5015209) (← links)
- Lolliproc (Q5176928) (← links)
- Translating dependency into parametricity (Q5178029) (← links)
- AURA (Q5178753) (← links)
- Downgrading policies and relaxed noninterference (Q5276143) (← links)
- Programming Languages and Systems (Q5316571) (← links)
- Generative type abstraction and type-level computation (Q5408546) (← links)
- A Core Quantitative Coeffect Calculus (Q5410709) (← links)
- Theorem Proving in Higher Order Logics (Q5477646) (← links)
- (Q6099631) (← links)
- Tealeaves: structured monads for generic first-order abstract syntax infrastructure (Q6642993) (← links)
