Classification of security properties in a Linda-like process algebra

Science of Computer Programming

Volumn 63, Issue 1, 2006, Pages 16-38

  Aldini, Alessandro ^a  

^a UNIVERSITY OF URBINO   (Italy)

Author keywords

Behavioural equivalence; Coordination model; Information flow analysis; Noninterference properties; Process algebra

Indexed keywords

ALGEBRA; BEHAVIORAL RESEARCH; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION TECHNOLOGY; MATHEMATICAL MODELS; SECURITY SYSTEMS;

BEHAVIOURAL EQUIVALENCE; COORDINATION MODELS; INFORMATION FLOW ANALYSIS; NONINTERFERENCE PROPERTIES; PROCESS ALGEBRA;

SECURITY OF DATA;

EID: 33748744443     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2005.07.010     Document Type: Article

References (34)

1. Aldini A. Coordination model and noninterference. In: Focardi R., and Zavattaro G. (Eds). Int. Workshop on Security Issues in Coordination Models, Languages, and Systems, SECCO'03. ENTCS vol. 85.3 (2003), Eindhoven, The Netherlands
2. Amadio R., Castellani I., and Sangiorgi D. On bisimulations for the asynchronous π-calculus. Theoretical Computer Science 195 2 (1998) 291-324
3. D.E. Bell, L.J. La Padula, Secure computer systems: Unified exposition and multics interpretation, Technical Report, ESD-TR-75-306, The MITRE Corp., Bedford, MA, 1976
4. Boreale M., De Nicola R., and Pugliese R. Trace and testing equivalence on asynchronous processes. Information and Computation 172 2 (2002) 139-164
5. Borrione D., Boubekeur M., Mounier L., Renaudin M., and Sirianni A. Validation of asynchronous circuit specifications using IF/CADP. In: Glesner M., et al. (Ed). Proc. of Int. Conf. on Very Large Scale Integration of System-on-Chip, VLSI-SoC'03 (2003), Darmstadt, Germany 86-91
6. Bossi A., Focardi R., Piazza C., and Rossi S. Verifying persistent security properties. Computer Languages, Systems and Structures 30 3-4 (2004) 231-258
7. Boudol G., and Castellani I. Noninterference for concurrent programs and thread systems. Theoretical Computer Science 281 1-2 (2002) 109-130
8. Busi N., Gorrieri R., and Zavattaro G. A process algebraic view of Linda coordination primitives. Theoretical Computer Science 192 2 (1998) 167-199
9. Busi N., Gorrieri R., and Zavattaro G. Process calculi for coordination: From Linda to JavaSpaces. In: Rus T. (Ed). Proc. 8th Int. Conf. on Algebraic Methodology and Software Technology, AMAST'00. Springer LNCS vol. 1816 (2000), Iowa, Iowa City 198-212
10. Carriero N., and Gelernter D. Coordination languages and their significance. Communications of the ACM 35 2 (1992) 97-107
11. Carriero N., and Gelernter D. How to Write Parallel Programs: A First Course (1992), MIT Press
12. P. Ciancarini, A. Omicini, F. Zambonelli, Multiagent system engineering: The coordination viewpoint, in: N. Jennings, Y. Lesperance (Eds.), Proc. 6th Int. Workshop on Agent Theories, Architectures, and Languages, ATAL'99, Springer LNCS, vol. 1757, Orlando, Florida, 1999, pp. 250-259
13. Focardi R., and Gorrieri R. A classification of security properties. Journal of Computer Security 3 1 (1995) 5-33
14. R. Focardi, R. Gorrieri (Eds.) Foundations of Security Analysis and Design - Tutorial Lectures I and II, in: Springer LNCS, vol. 2171, 2001 and vol. 2946, 2004
15. R. Focardi, R. Gorrieri, Classification of Security Properties (Part I: Information Flow), in: [14], pp. 331-396
16. Gelernter D. Generative communication in Linda. ACM Transactions on Programming Languages and Systems 7 1 (1985) 80-112
17. Goguen J.A., and Meseguer J. Security policy and security models. Proc. Symp. on Security and Privacy, SSP'82 (1982), IEEE CS Press, Oakland, CA 11-20
18. Guttman J., and Nadel M. What needs securing?. Proc. 1st Computer Security Foundation Workshop, CSFW'88 (1988), MITRE Corporation Press, Franconia, New Hampshire 34-57
19. M. Hennessy, The security π-calculus and non-interference, in: S. Brookes, P. Panangaden (Eds.), Proc. 19th Mathematical Foundations of Programming Semantics, MFPS, in: ENTCS, vol. 83, Montreal, Canada, 2003
20. Hennessy M., and Riely J. Information flow vs. resource access in the asynchronous pi-calculus. ACM Transactions on Programming Languages and Systems 24 5 (2002) 566-591 ACM Press
21. K. Honda, M. Tokoro, On asynchronous communication semantics, in: M. Tokoro, O. Nierstrasz, P. Wegner (Eds.), Proc. Workshop on Object-Based Concurrent Computing, in: Springer LNCS, vol. 612, Geneva, Switzerland, 1992, pp. 21-51
22. K. Honda, V. Vasconcelos, N. Yoshida, Secure information flow as typed process behavior, in: G. Smolka, (Ed.), Proc. 9th European Symposium on Programming Languages and Systems, ESOP'00, in: Springer LNCS, vol. 1782, Berlin, Germany, 2000, pp. 180-199
23. H. Mantel, Unwinding possibilistic security properties, in: F. Cuppens, Y. Deswarte, D. Gollmann, M. Waidner (Eds.), Proc. European Symposium on Research in Computer Security, ESORICS'00, in: Springer LNCS, vol. 1895, Toulouse, France, 2000, pp. 238-254
24. M. Merro, D. Sangiorgi, On asynchrony in name-passing calculi, in: K. Larsen, S. Skyum, G. Winskel (Eds.), Proc. 25th Int. Colloquium on Automata, Languages, and Programming, ICALP'98, in: Springer LNCS, vol. 1443, Aalborg, Denmark, 1998, pp. 856-867
25. Milner R. Communication and Concurrency (1989), Prentice Hall
26. U. Montanari, V. Sassone, CCS dynamic bisimulation is progressing, in: A. Tarlecki (Ed.) Mathematical Foundations of Computer Science, MFCS'91, in: Springer LNCS, vol. 520, Kazimierz Dolny, Poland, 1991, pp. 346-356
27. S. Orzan, J. van de Pol, Verification of distributed dataspace architectures, in: M. Broy, A.V. Zamulin (Eds.), Proc. 5th Int. Conf. on Perspectives of System Informatics, PSI'03, in: Springer LNCS vol. 2890, Novosibirsk, Russia, 2003, pp. 192-206
28. C. Piazza, E. Pivato, S. Rossi, CoPS - Checker of Persistent Security, in: K. Jensen, A. Podelski (Eds.), Tools and Algorithms for the Construction and Analysis of Systems, 10th Int. Conf., TACAS'04, in: Springer LNCS, vol. 2988, Barcelona, Spain, 2004, pp. 144-152
29. Roscoe A.W. CSP and determinism in security modelling. Proc. IEEE Symp. on Security and Privacy, SSP'95 (1995), IEEE CS Press, Oakland, CA 114-127
30. Sabelfeld A., and Myers A.C. Language-based information-flow security. Journal on Selected Areas in Communications 21 1 (2003) 5-19 IEEE cs Press
31. D. Sangiorgi, R. Milner, The problem of weak bisimulation up to, in: R. Cleaveland (Ed.), Proc. 3rd Int. Conf. on Concurrency Theory, CONCUR'92, in: Springer LNCS, vol. 630, Stony Brook, NY, 1992, pp. 32-46
32. Sewell P., and Vitek J. Secure composition of untrusted code: Wrappers and causality types. Proc. 13th Computer Security Foundations Workshop, CSFW'00 (2000), IEEE CS Press 269-284
33. Smith G., and Volpano D. Secure information flow in a multi-threaded imperative language. Proc. 25th Symposium on Principles of Programming Languages, POPL'98 (1998), ACM Press, San Diego, CA 355-364
34. Wittbold J.T., and Johnson D.M. Information flow in nondeterministic systems. Proc. Symposium on Security and Privacy, SSP'90 (1990), IEEE CS Press, Oakland, CA 144-161