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 |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 22472136 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Classification of security properties in a Linda-like process algebra – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Aldini%2C+Alessandro%22">Aldini, Alessandro</searchLink><relatesTo>1</relatesTo><i> http://www.sti.uniurb.it/aldini</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Science+of+Computer+Programming%22">Science of Computer Programming</searchLink>. Nov2006, Vol. 63 Issue 1, p16-38. 23p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Algebra%22">Algebra</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+analysis%22">Mathematical analysis</searchLink><br /><searchLink fieldCode="DE" term="%22Distributed+computing%22">Distributed computing</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematics%22">Mathematics</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=22472136 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.scico.2005.07.010 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 23 StartPage: 16 Subjects: – SubjectFull: Algebra Type: general – SubjectFull: Mathematical analysis Type: general – SubjectFull: Distributed computing Type: general – SubjectFull: Mathematics Type: general Titles: – TitleFull: Classification of security properties in a Linda-like process algebra Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Aldini, Alessandro IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 11 Text: Nov2006 Type: published Y: 2006 Identifiers: – Type: issn-print Value: 01676423 Numbering: – Type: volume Value: 63 – Type: issue Value: 1 Titles: – TitleFull: Science of Computer Programming Type: main |
| ResultId | 1 |