Statically checking confidentiality via dynamic labels

  • Authors:
  • Bart Jacobs;Wolter Pieters;Martijn Warnier

  • Affiliations:
  • Radboud University Nijmegen, Nijmegen, The Netherlands;Radboud University Nijmegen, Nijmegen, The Netherlands;Radboud University Nijmegen, Nijmegen, The Netherlands

  • Venue:
  • WITS '05 Proceedings of the 2005 workshop on Issues in the theory of security
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a new approach for verifying confidentiality for programs, based on abstract interpretation. The framework is formally developed and proved correct in the theorem prover PVS. We use dynamic labeling functions to abstractly interpret a simple programming language via modification of security levels of variables. Our approach is sound and compositional and results in an algorithm for statically checking confidentiality.