Using state space reduction methods for deadlock analysis in Ada tasking

  • Authors:
  • S. Duri;U. Buy;R. Devarapalli;S. M. Shatz

  • Affiliations:
  • -;-;-;-

  • Venue:
  • ISSTA '93 Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

Over the past few years, a number of research investigations have been initiated for static analysis of concurrent and distributed software. In this paper we report on experiments with various optimization techniques for reachability-based deadlock detection in Ada programs using Petri net models. Our experimental results show that various optimization techniques are mutually beneficial with respect to the effectiveness of the analysis.