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 |
