Abstract
We present the SBSNNI rule format. We prove that any Process Algebra construct whose SOS-style semantics is defined by SOS transition rules respecting such a format, preserves the well known non interference properties Persistent BNDC, SBSNNI, and SBNDC.
Research partially supported by Progetto Cofinanziato “Metodi Formali per la Sicurezza e il Tempo” (Mefisto)
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
L. Aceto and W. J. Fokkink, editors, Special issue on process algebra, Information Processing Letters, 80, 2001.
L. Aceto, W. J. Fokkink, and C. Verhoef, Structural operational semantics, in J. A. Bergstra, A. Ponse, and S. A. Smolka, editors, Handbook of Process Algebra, Elsevier, Amsterdam, 2001, 197–292.
P. G. Allen, A comparison of non interference and non deducibility using CSP, Proc. IEEE Computer Security Foundation Workshop, IEEE Computer Society Press, 1991, 43–54.
D. Bell and L. J. La Padula, Secure computer systems: Unified exposition and multics interpretation, Technical report ESD-TR-75-301, MITRE MTR-2997, 1976.
B. Bloom, Structural operational semantics for weak bisimulation, Theoretical Computer Science, 146, 1995, 25–68.
R. Focardi and R. Gorrieri, A classification of security properties for process algebras, Journal of Computer Security, 3, 1995, 5–33.
R. Focardi and R. Gorrieri, The compositional security checker: A tool for the verification of information flow security properties, IEEE Transactions on Software Engineering, 23, 1997, 550–571.
R. Focardi and R. Gorrieri, Classification of security properties (Part I: Information flow), Foundations of Security Analysis and Design, Tutorial Lectures, Lecture Notes in Computer Science, 2171, Springer, Berlin, 2001, 331–396.
R. Focardi and S. Rossi, Information flow security in dynamic contexts, Proc. IEEE Computer Security Foundation Workshop, IEEE Computer Society Press, 2002, 307–319.
W. J. Fokkink, Rooted branching bisimulation as a congruence, Journal of Computer and System Sciences, 60, 2000, 13–37.
J. A. Goguen and J. Meseguer, Security policy and security models, Proc. IEEE Symposium on Security and Privacy, IEEE Computer Society Press, 1982, 11–20.
F. Martinelli, Partial model checking and theorem proving for ensuring security properties, Proc. IEEE Computer Security FoundationWorkshop, IEEE Computer Society Press, 1998, 44–52.
R. Milner, Communication and concurrency, Prentice-Hall, London, 1989.
G. Plotkin, A structural approach to operational semantics, Technical report DAIMI FN-19, University of Aarhus, Denmark, 1981.
A. W. Roscoe, J. C. P. Woodcock, and L. Wulf, Non interference through determinism, Proc. European Symposium on Research in Computer Security, Lecture Notes in Computer Science, 875, Springer, Berlin, 1994, 33–53.
P. Y. A. Ryan, A CSP formulation of non-interference, Proc. IEEE Computer Security Foundation Workshop, IEEE Computer Society Press, 1990.
R. De Simone, Higher level synchronization devices in SCCS-Meije, Theoretical Computer Science, 37, 1985, 245–267.
I. Ulidowski and I. Phillips, Formats of ordered SOS rules with silent actions, Proc. Theory and Practice of Software Development, Lecture Notes in Computer Science, 1214, Springer, Berlin, 1997, 297–308.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tini, S. (2003). Rule Formats for Non Interference. In: Degano, P. (eds) Programming Languages and Systems. ESOP 2003. Lecture Notes in Computer Science, vol 2618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36575-3_10
Download citation
DOI: https://doi.org/10.1007/3-540-36575-3_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00886-6
Online ISBN: 978-3-540-36575-4
eBook Packages: Springer Book Archive