.png){kind=icon}
Return
Security Reasoning via Substructural Dependency Tracking
.png){kind=icon}
PRE
AI
DOI：10.1145/3776669.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Substructural type systems provide the ability to speak about resources. By enforcing usage restrictions on inputs to computations they allow programmers to reify limited system units-such as memory-in types. We demonstrate a new form of resource reasoning founded on constraining outputs and explore its utility for practical programming. In particular, we identify a number of disparate programming features explored largely in the security literature as various fragments of our unified framework. These encompass capabilities, quantitative information leakage, sandboxing in the style of the Linux seccomp interface, authorization protocols, and more. We furthermore explore its connection to conventional input-based resource reasoning, casting it as an internal treatment of the constructive Kripke semantics of substructural logics. We verify the capability, quantity, and protocol safety of our system through a single logical relations argument. In doing so, we take the first steps towards obtaining the ultimate multitool for security reasoning.
Keywords:
capabilities
quantitative reasoning
protocol specifications
security types
substructural types
graded types
linear logic
ordered logic
adjoint logic
modalities
effects
coeffects
Journal
P
IF:
2.8
Papers:
308
Citations:
4.7K
Organization
Cited Papers
ShareSave
ShareSaveLightweight semiformal time complexity analysis for purely functional data structures.png)
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languagesIF0
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSave
View more