Proving abstract non-interference

DOI10.1007/978-3-540-30124-0_23MaRDI QIDQ5311263zbMATH OpenOpenAlexFDO

Authors Roberto Giacobazzi, Isabella Mastroeni

Publication date 22 August 2005

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

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

zbMATH Keywords

Abstract interpretationabstract non-interferencelanguage-based securityverification

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Abstract non-interference
• A proof system for abstract non-interference
• Proving concurrent noninterference
• Abstract Certification of Global Non-interference in Rewriting Logic
• Higher-order abstract non-interference

Cited in

(12)

• Redundant proofs of non-interference in Levin-Gries CSP program proofs
• 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
• Proving concurrent noninterference
• Abstract program slicing: an abstract interpretation-based approach to program slicing
• Decidability and proof systems for language-based noninterference relations
• Higher-order abstract non-interference
• Static Analysis
• Improving dynamic code analysis by code abstraction
• `Non-interference' implies equality

This page was built for publication: Proving abstract non-interference

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