From Exponential to Polynomial-Time Security Typing via Principal Types

DOI10.1007/978-3-642-19718-5_16zbMath1275.68062OpenAlexW1585940114MaRDI QIDQ3000586

Sebastian Hunt, David Sands

Publication date: 19 May 2011

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19718-5_16

zbMATH Keywords

flow sensitive type systempowerset lattice

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Theory of software (68N99)

Related Items (1)

Agda formalization of a security-preserving translation from flow-sensitive to flow-insensitive security types

Cites Work

• Unnamed Item
• Unnamed Item
• A logic for information flow analysis with an application to forward slicing of simple imperative programs
• Information flow for Algol-like languages
• Program Slicing
• All Secrets Great and Small
• An Axiomatic Approach to Information Flow in Programs
• Certification of programs for secure information flow
• Information-flow and data-flow analysis of while-programs
• On flow-sensitive security types
• A logic for information flow in object-oriented programs
• Theoretical Aspects of Computing – ICTAC 2005
• Just Forget It – The Semantics and Enforcement of Information Erasure
• Static Analysis

This page was built for publication: From Exponential to Polynomial-Time Security Typing via Principal Types