Proving non-interference on reachability properties : a refinement approach - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Proving non-interference on reachability properties : a refinement approach

Résumé

This paper proposes an approach to prove interference freedom for a reach ability property of the form AG (psi => EF phi) in a B specification. Such properties frequently occur in security policies and information systems. Reach ability is proved by constructing using stepwise algorithmic refinement an abstract program that refines AG (psi => EF phi). We propose proof obligations to show non-interference, ie, to prove that other operations can be executed in interleaving with this program while preserving the reach ability property, to cater for the multi-user aspect of information systems. Proof obligations are discharged using conventional B provers (eg, Atelier B). Since refinement preserves these reach ability properties and non-interference, proofs can be conducted on abstract machines rather than implementation code

Dates et versions

hal-01302414 , version 1 (14-04-2016)

Identifiants

Citer

Marc Frappier, Amel Mammar. Proving non-interference on reachability properties : a refinement approach. APSEC 2011 : 18th Asia Pacific Software Engineering Conference, Dec 2011, Ho Chi Minh, Vietnam. pp.25 - 32, ⟨10.1109/APSEC.2011.35⟩. ⟨hal-01302414⟩
26 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More