From exponential to polynomial-time security typing via principal types

DOI10.1007/978-3-642-19718-5_16MaRDI QIDQ3000586zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On flow-sensitive security types
• scientific article; zbMATH DE number 1948407
• Theoretical Aspects of Computing – ICTAC 2005
• Dependent information flow types
• scientific article; zbMATH DE number 2086682

Cites work

• scientific article; zbMATH DE number 4179333 (Why is no real title available?)
• scientific article; zbMATH DE number 1754606 (Why is no real title available?)
• A logic for information flow analysis with an application to forward slicing of simple imperative programs
• A logic for information flow in object-oriented programs
• All Secrets Great and Small
• An Axiomatic Approach to Information Flow in Programs
• Certification of programs for secure information flow
• Information flow for Algol-like languages
• Information-flow and data-flow analysis of while-programs
• Just Forget It – The Semantics and Enforcement of Information Erasure
• On flow-sensitive security types
• Program Slicing
• Static Analysis
• Theoretical Aspects of Computing – ICTAC 2005

Cited in

(3)

• On flow-sensitive security types
• Agda formalization of a security-preserving translation from flow-sensitive to flow-insensitive security types
• scientific article; zbMATH DE number 5141412 (Why is no real title available?)

This page was built for publication: From exponential to polynomial-time security typing via principal types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000586)