Proofs Methods for Bisimulation Based Information Flow Security

@inproceedings{Focardi2002ProofsMF,
  title={Proofs Methods for Bisimulation Based Information Flow Security},
  author={Riccardo Focardi and Carla Piazza and Sabina Rossi},
  booktitle={VMCAI},
  year={2002}
}
We study how to efficiently decide if a process is Persistent BNDC (P BNDC, for short). The P BNDC property ensures that a process is “secure” in dynamic contexts, i.e., contexts that can be reconfigured at runtime. We exploit a characterization of P BNDC as Weak Bisimulation up to a set of actions. In the case of finite-state processes, we study two methods for computing the largest weak bisimulation up to a set of actions: (1) via Characteristic Formulae and Model Checking for μ-calculus and… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 38 references

Classi ation of Se urity Properties ( Part I : Information Flow )

  • S. Rossi.
  • 2001

Model checking

  • E. M. Clarke, O. Grumberg, D. A. Peled
  • The MIT Press,
  • 1999
1 Excerpt

Three partition re nement algorithms

  • R. E. Tarjan
  • SIAM Journalon Computing
  • 1998

Similar Papers

Loading similar papers…