Security properties consistent with the testing semantics for communicating processes
暂无分享,去创建一个
[1] J. Meseguer,et al. Security Policies and Security Models , 1982, 1982 IEEE Symposium on Security and Privacy.
[2] Rocco De Nicola,et al. Testing Equivalences for Processes , 1984, Theor. Comput. Sci..
[3] F. Javier Thayer,et al. Security and the Composition of Machines , 1988, CSFW.
[4] Tommaso Bolognesi,et al. Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.
[5] F. Javier Thayer,et al. Stating security requirements with tolerable sets , 1988, TOCS.
[6] Jan A. Bergstra,et al. Readies and Failures in the Algebra of Communicating Processes , 1988, SIAM J. Comput..
[7] C. A. R. Hoare,et al. A Theory of Communicating Sequential Processes , 1984, JACM.
[8] Joshua D. Guttman,et al. What Needs Securing , 1988, CSFW.
[9] A. W. Roscoe,et al. An Improved Failures Model for Communicating Processes , 1984, Seminar on Concurrency.
[10] José Meseguer,et al. Unwinding and Inference Control , 1984, 1984 IEEE Symposium on Security and Privacy.
[11] Matthew Hennessy,et al. Acceptance trees , 1985, JACM.