View in EDS

Rule formats for compositional non-interference properties

Saved in:
Bibliographic Details
Title: Rule formats for compositional non-interference properties
Authors: Tini, Simone1 simone.tini@uninsubria.it
Source: Journal of Logic & Algebraic Programming. Jul2004, Vol. 60-61, p353-400. 48p.
Subjects: MARC formats, Machine-readable bibliographic data formats, Polyadic algebras, Computer logic, Program transformation
Abstract: We introduce the transition rule formats rooted SBSNNI and CP_BNDC. We prove that the non-interference property rooted SBSNNI introduced in the present paper, and the already known non-interference property CP_BNDC, are preserved by constructs of all process algebras with SOS transition rules respecting the restrictions of the formats rooted SBSNNI and CP_BNDC, respectively. To show that our formats have practical applications, we prove that a slight variant of Focardi and Gorrieri''s Security Process Algebra, the Kleene star recursion construct, the replication construct of polyadic π-calculus, and a process algebra extending BPAετ to deal with two level systems, respect both formats. By means of some counterexamples, we prove also that all restrictions of the formats are necessary. [Copyright &y& Elsevier]
Copyright of Journal of Logic & Algebraic 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: 13796611
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Rule formats for compositional non-interference properties
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Tini%2C+Simone%22">Tini, Simone</searchLink><relatesTo>1</relatesTo><i> simone.tini@uninsubria.it</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Logic+%26+Algebraic+Programming%22">Journal of Logic & Algebraic Programming</searchLink>. Jul2004, Vol. 60-61, p353-400. 48p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22MARC+formats%22">MARC formats</searchLink><br /><searchLink fieldCode="DE" term="%22Machine-readable+bibliographic+data+formats%22">Machine-readable bibliographic data formats</searchLink><br /><searchLink fieldCode="DE" term="%22Polyadic+algebras%22">Polyadic algebras</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+logic%22">Computer logic</searchLink><br /><searchLink fieldCode="DE" term="%22Program+transformation%22">Program transformation</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We introduce the transition rule formats rooted SBSNNI and CP_BNDC. We prove that the non-interference property rooted SBSNNI introduced in the present paper, and the already known non-interference property CP_BNDC, are preserved by constructs of all process algebras with SOS transition rules respecting the restrictions of the formats rooted SBSNNI and CP_BNDC, respectively. To show that our formats have practical applications, we prove that a slight variant of Focardi and Gorrieri''s Security Process Algebra, the Kleene star recursion construct, the replication construct of polyadic <f>π</f>-calculus, and a process algebra extending BPA<f>ετ</f> to deal with two level systems, respect both formats. By means of some counterexamples, we prove also that all restrictions of the formats are necessary. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Logic & Algebraic 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=13796611
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.jlap.2004.03.003
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 48
        StartPage: 353
    Subjects:
      – SubjectFull: MARC formats
        Type: general
      – SubjectFull: Machine-readable bibliographic data formats
        Type: general
      – SubjectFull: Polyadic algebras
        Type: general
      – SubjectFull: Computer logic
        Type: general
      – SubjectFull: Program transformation
        Type: general
    Titles:
      – TitleFull: Rule formats for compositional non-interference properties
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Tini, Simone
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 07
              Text: Jul2004
              Type: published
              Y: 2004
          Identifiers:
            – Type: issn-print
              Value: 15678326
          Numbering:
            – Type: volume
              Value: 60-61
          Titles:
            – TitleFull: Journal of Logic & Algebraic Programming
              Type: main
ResultId 1