Automated Analysis of Concurrent Systems with the Constrained Expression Toolset

  • Authors:
  • George S. Avrunin;Ugo A. Buy;James C. Corbett;Laura K. Dillon;Jack C. Wileden

  • Affiliations:
  • Univ. of Massachusetts, Amherst;Univ. of Illinois, Chicago;Univ. of Massachusetts, Amherst;Univ. of California, Santa Barbara;Univ. of Massachusetts, Amherst

  • Venue:
  • IEEE Transactions on Software Engineering
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract

The constrained expression approach to analysis of concurrent software systems can be used with a variety of design and programming languages and does not require a complete enumeration of the set of reachable states of the concurrent system. The construction of a toolset automating the main constrained expression analysis techniques and the results of experiments with that toolset are reported. 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 bv the analysts queries. The strengths and weaknesses of the toolset and the approach are assessed on both theoretical and empirical grounds.