Axiomatising an information flow logic based on partial equivalence relations.

Uloženo v:
Podrobná bibliografie
Název: Axiomatising an information flow logic based on partial equivalence relations.
Autoři: Filinski, Andrzej, Larsen, Ken Friis, Jensen, Thomas P.
Zdroj: International Journal on Software Tools for Technology Transfer; Aug2024, Vol. 26 Issue 4, p445-461, 17p
Témata: SEMANTICS
Abstrakt: We present a relational program logic for reasoning about information flow properties formalised in an assertion language based on partial equivalence relations. We define and prove the soundness of the logic, a proof technique for precise, logic-based information flow properties. The logic extends Hoare logic and its unary state predicates to binary PER-based predicates for relating observationally equivalent states. A salient feature of the logic is that it is capable of reasoning about programs that test on secret data in a secure manner. [ABSTRACT FROM AUTHOR]
Copyright of International Journal on Software Tools for Technology Transfer is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Databáze: Complementary Index
Popis
Abstrakt:We present a relational program logic for reasoning about information flow properties formalised in an assertion language based on partial equivalence relations. We define and prove the soundness of the logic, a proof technique for precise, logic-based information flow properties. The logic extends Hoare logic and its unary state predicates to binary PER-based predicates for relating observationally equivalent states. A salient feature of the logic is that it is capable of reasoning about programs that test on secret data in a secure manner. [ABSTRACT FROM AUTHOR]
ISSN:14332779
DOI:10.1007/s10009-024-00756-z