A Type System for Optimizing Dynamic IFC
Open Access
- 1 October 2026
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10 (OOPSLA2) , 260-287
Abstract
Dynamic information-flow control (IFC) enforces confidentiality policies at runtime by tagging values with security labels and blocking policy-violating outputs by terminating the running system. Pervasive label tracking and enforcement checks incur high runtime costs, which limits practical IFC deployment to performance-insensitive workloads. We present a novel alternative called MinIF, a type-directed program transformation that statically eliminates the overhead of dynamic IFC for existing systems. The central contribution of MinIF is a flow-sensitive type system that tracks which sensitive inputs influence a value and whether the enforcement mechanism would accept operations on it, even though the enforced policy is unknown to the type system. Using the type system, MinIF statically predicts enforcement outcomes and removes redundant checks along with the label-tracking code that served them, and we prove that the optimized program preserves both the behavior and the enforcement decisions of the original. For IFC systems with introspection, the optimization is fully automatic, as the introspection queries already present in the program supply all the permission information MinIF needs, with no programmer annotations. Unresolved checks surface as warnings, and the absence of warnings gives developers a static guarantee against enforcement-induced system termination. We evaluate MinIF on Python programs running on the WebTTC dynamic IFC platform. On benchmarks, MinIF eliminates between 13% and 99% of the enforcement overhead, and compute-intensive workloads that time out under enforcement now complete in milliseconds.Keywords
Funding Information
- Novo Nordisk Foundation (NNF24OC0089993)
This publication has 42 references indexed in Scilit:
- Enforcing the GDPR2024
- Hybrid Information Flow Control for Low-Level Code2021
- Enforcing Information Flow by Combining Static and Dynamic Analysis2014
- Gradual Security Typing with References2013
- Paragon for Practical Programming with Information-Flow Control2013
- Static Analysis for Efficient Hybrid Information-Flow Control2011
- Dynamic vs. Static Flow-Sensitive Security Analysis2010
- Edit automata: enforcement mechanisms for run-time security policiesInternational Journal of Information Security, 2005
- A structural approach to operational semanticsThe Journal of Logic and Algebraic Programming, 2004
- A Calculus of Communicating Systems1980