Classification of security properties in a Linda-like process algebra
Saved in:
| Title: | Classification of security properties in a Linda-like process algebra |
|---|---|
| Authors: | Aldini, Alessandro1 http://www.sti.uniurb.it/aldini |
| Source: | Science of Computer Programming. Nov2006, Vol. 63 Issue 1, p16-38. 23p. |
| Subjects: | Algebra, Mathematical analysis, Distributed computing, Mathematics |
| Abstract: | Abstract: We provide a classification of noninterference-based security properties for the formal analysis of secure information flow in concurrent and distributed systems. This is done in the setting of a process algebra modeling some Linda coordination primitives (asynchronous communication and read operation). For this purpose, we define relaxed notions of behavioural equivalence that take into account the observational power of the external observer. The resulting taxonomy is compared with analogous security definitions based on synchronous communication models, thus emphasizing the influence of the Linda coordination model upon the expressivity of the security properties, by giving a new intuition to the relative merits. [Copyright &y& Elsevier] |
| Copyright of Science of Computer Programming is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
