View in EDS

Proof-based verification approaches for dynamic properties: application to the information system domain.

Saved in:
Bibliographic Details
Title: Proof-based verification approaches for dynamic properties: application to the information system domain.
Authors: Mammar, Amel1 amel.mammar@telecom-sudparis.eu, Frappier, Marc2
Source: Formal Aspects of Computing. Mar2015, Vol. 27 Issue 2, p335-374. 40p.
Subjects: Information storage & retrieval systems, B method (Computer science), Programming languages, Computer systems, Algorithms
Abstract: This paper proposes a formal approach for generating necessary and sufficient proof obligations to demonstrate a set of dynamic properties using the B method. In particular, we consider reachability, non-interference and absence properties. Also, we show that these properties permit a wide range of property patterns introduced by Dwyer to be expressed. An overview of a tool supporting these approaches is also provided. [ABSTRACT FROM AUTHOR]
Copyright of Formal Aspects of Computing is the property of Association for Computing Machinery 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: 101005388
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Proof-based verification approaches for dynamic properties: application to the information system domain.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Mammar%2C+Amel%22">Mammar, Amel</searchLink><relatesTo>1</relatesTo><i> amel.mammar@telecom-sudparis.eu</i><br /><searchLink fieldCode="AR" term="%22Frappier%2C+Marc%22">Frappier, Marc</searchLink><relatesTo>2</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Formal+Aspects+of+Computing%22">Formal Aspects of Computing</searchLink>. Mar2015, Vol. 27 Issue 2, p335-374. 40p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Information+storage+%26+retrieval+systems%22">Information storage & retrieval systems</searchLink><br /><searchLink fieldCode="DE" term="%22B+method+%28Computer+science%29%22">B method (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+systems%22">Computer systems</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper proposes a formal approach for generating necessary and sufficient proof obligations to demonstrate a set of dynamic properties using the B method. In particular, we consider reachability, non-interference and absence properties. Also, we show that these properties permit a wide range of property patterns introduced by Dwyer to be expressed. An overview of a tool supporting these approaches is also provided. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Formal Aspects of Computing is the property of Association for Computing Machinery 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=101005388
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s00165-014-0323-x
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 40
        StartPage: 335
    Subjects:
      – SubjectFull: Information storage & retrieval systems
        Type: general
      – SubjectFull: B method (Computer science)
        Type: general
      – SubjectFull: Programming languages
        Type: general
      – SubjectFull: Computer systems
        Type: general
      – SubjectFull: Algorithms
        Type: general
    Titles:
      – TitleFull: Proof-based verification approaches for dynamic properties: application to the information system domain.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Mammar, Amel
      – PersonEntity:
          Name:
            NameFull: Frappier, Marc
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar2015
              Type: published
              Y: 2015
          Identifiers:
            – Type: issn-print
              Value: 09345043
          Numbering:
            – Type: volume
              Value: 27
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Formal Aspects of Computing
              Type: main
ResultId 1