Unwinding Conditions for Security in Imperative Languages

DOI10.1007/11506676_6MaRDI QIDQ5458796zbMATH OpenOpenAlexFDO

Authors Annalisa Bossi, Carla Piazza, Sabina Rossi

Publication date 24 April 2008

Published in Logic Based Program Synthesis and Transformation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Unwinding Possibilistic Security Properties
• Proving concurrent noninterference
• Decidability and proof systems for language-based noninterference relations
• Formal verification of language-based concurrent noninterference
• scientific article; zbMATH DE number 1953033

Cited in

(4)

• Relational bytecode correlations
• Unwinding biological systems
• Unwinding Possibilistic Security Properties
• The unwind property for programs with bounded memory

This page was built for publication: Unwinding Conditions for Security in Imperative Languages

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