Using state space reduction methods for deadlock analysis in Ada tasking

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.

[1]  Pierre Wolper,et al.  Using partial orders for the efficient verification of deadlock freedom and safety properties , 1991, Formal Methods Syst. Des..

[2]  P. H. Starke,et al.  Reachability analysis of Petri nets using symmetries , 1991 .

[3]  Richard N. Taylor,et al.  Integrated concurrency analysis in a software development enviornment , 1989 .

[4]  Barbara G. Ryder,et al.  A model of Ada programs for static deadlock detection in polynomial times , 1991, PADD '91.

[5]  Charles E. McDowell,et al.  Computing reachable states of parallel programs , 1991, PADD '91.

[6]  Rami R. Razouk,et al.  Interactive State-Space Analysis of Concurrent Systems , 1987, IEEE Transactions on Software Engineering.

[7]  Antti Valmari.  A stubborn attack on state explosion , 1992, Formal Methods Syst. Des..

[8]  Raymond J. A. Buhr,et al.  Starvation and Critical Race Analyzers for Ada , 1990, IEEE Trans. Software Eng..

[9]  Richard N. Taylor,et al.  Combining Static Concurrency Analysis with Symbolic Execution , 1988, IEEE Trans. Software Eng..

[10]  Gérard Berthelot,et al.  Checking properties of nets using transformation , 1985, Applications and Theory in Petri Nets.

[11]  Richard N. Taylor,et al.  A general-purpose algorithm for analyzing concurrent programs , 1983, CACM.

[12]  Lori A. Clarke,et al.  A proposed testing and analysis research initiative , 1992, IEEE Software.

[13]  George S. Avrunin,et al.  Experiments with an improved constrained expression toolset , 1991, TAV4.

[14]  David Luckham,et al.  Debugging Ada Tasking Programs , 1985, IEEE Software.

[15]  Lori A. Clarke,et al.  Task interaction graphs for concurrency analysis , 1989, ICSE '89.

[16]  George S. Avrunin,et al.  Automated Analysis of Concurrent Systems With the Constrained Expression Toolset , 1991, IEEE Trans. Software Eng..

[17]  S. Tu,et al.  Applying Petri net reduction to support Ada-tasking deadlock detection , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[18]  Tadao Murata,et al.  Detection of Ada Static Deadlocks Using Petri Net Invariants , 1989, IEEE Trans. Software Eng..

[19]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[20]  Sol M. Shatz,et al.  Design and Implementation of a Petri Net Based Toolkit for Ada Tasking Analysis , 1990, IEEE Trans. Parallel Distributed Syst..

[21]  Michal Young,et al.  Compositional reachability analysis using process algebra , 1991, TAV4.