Higher-order abstract non-interference

DOI10.1007/11417170_30MaRDI QIDQ5704026zbMATH OpenOpenAlexFDO

Authors Damiano Zanardini

Publication date 11 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b135690

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• Abstract non-interference
• Proving abstract non-interference
• A proof system for abstract non-interference
• Security typings by abstract interpretation
• Typing noninterference for reactive programs

Cited in

(6)

• Noninterference in a predicative polymorphic calculus for access control
• scientific article; zbMATH DE number 3890097 (Why is no real title available?)
• Abstract non-interference
• A proof system for abstract non-interference
• Abstract interpretation-based approaches to security -- a survey on abstract non-interference and its challenging applications
• Proving abstract non-interference

This page was built for publication: Higher-order abstract non-interference

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