Communicating sequential processes
Communicating sequential processes
Detection of Ada Static Deadlocks Using Petri Net Invariants
IEEE Transactions on Software Engineering
Task interaction graphs for concurrency analysis
ICSE '89 Proceedings of the 11th international conference on Software engineering
Integrated concurrency analysis in a software development enviornment
TAV3 Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
Design and validation of computer protocols
Design and validation of computer protocols
Starvation and Critical Race Analyzers for Ada
IEEE Transactions on Software Engineering
Compositional reachability analysis using process algebra
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Automated Analysis of Concurrent Systems with the Constrained Expression Toolset
IEEE Transactions on Software Engineering
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Model checking and abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Using state space reduction methods for deadlock analysis in Ada tasking
ISSTA '93 Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis
A practical technique for bounding the time between events in concurrent real-time systems
ISSTA '93 Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis
Symbolic Model Checking
A Proposed Testing and Analysis Research Initiative
IEEE Software
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Verifying General Safety and Liveness Propterties with Integer Programming
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Refining Dependencies Improves Partial-Order Verification Methods (Extended Abstract)
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Graph models for reachability analysis of concurrent programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
A compact Petri net representation for concurrent programs
Proceedings of the 17th international conference on Software engineering
A Compact Petri Net Representation and Its Implications for Analysis
IEEE Transactions on Software Engineering
Verification of Safety Properties Using IntegerProgramming: Beyond the State Equation
Formal Methods in System Design
Improving the precision of INCA by preventing spurious cycles
Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
Fast formal analysis of requirements via “Topoi Diagrams”
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Improving the Precision of INCA by Eliminating Solutions with Spurious Cycles
IEEE Transactions on Software Engineering
Evaluating Deadlock Detection Methods for Concurrent Software
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Static analysis of Ada tasking programs has been hindered by the well known state explosion problem that arises in the verification of concurrent systems. Many different techniques have been proposed to combat this state explosion. All proposed methods excel on certain kinds of systems, but there is little empirical data comparing the performance of the methods. In this paper, we select one representative from each of three very different approaches to the state explosion problem: partial-orders (representing state-space reductions), symbolic model checking (representing OBDD-based approaches), and inequality necessary conditions (representing integer programming-based approaches). We apply the methods to several scalable concurrency examples from the literature and to one real Ada tasking program. The results of these experiments are presented and their significance is discussed.