From exponential to polynomial-time security typing via principal types

DOI10.1007/978-3-642-19718-5_16zbMATH Open1275.68062OpenAlexW1585940114MaRDI QIDQ3000586FDOQ3000586

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

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

zbMATH Keywords

flow sensitive type systempowerset lattice

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Agda formalization of a security-preserving translation from flow-sensitive to flow-insensitive security types
• Title not available (Why is that?)

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)