Automated Analysis of Concurrent Systems With the Constrained Expression Toolset.
Saved in:
| Title: | Automated Analysis of Concurrent Systems With the Constrained Expression Toolset. |
|---|---|
| Authors: | Avrunin, George S.1, Buy, Ugo A.2, Corbett, James C.1, Dillon, Laura K.3, Wileden, Jack C.1 |
| Source: | IEEE Transactions on Software Engineering. Nov91, Vol. 17 Issue 11, p1204-1222. 19p. 9 Diagrams, 6 Charts. |
| Subjects: | Computer software, Computer systems, System analysis, Programming languages, Systems design |
| Abstract: | The constrained expression approach to analysis of concurrent software systems has several attractive features, including the facts that it can be used with a variety of design and programming languages and that it does not require a complete enumeration of the set of reachable states of the concurrent system. This paper reports on the construction of a toolset automating the main constrained expression analysis techniques and the results of experiments with that toolset. The toolset is capable of carrying out completely automated analyses of a variety of concurrent systems, starting from source code in an Ada-like design language and producing system traces displaying the properties represented by the analyst's queries. It has been successfully used with designs that involve hundreds of concurrent processes. [ABSTRACT FROM AUTHOR] |
| Copyright of IEEE Transactions on Software Engineering is the property of IEEE Computer Society 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!
