Interactive State-Space Analysis of Concurrent Systems
IEEE Transactions on Software Engineering
Texity of reachablility in distributed communicating processes
Acta Informatica
Combining Static Concurrency Analysis with Symbolic Execution
IEEE Transactions on Software Engineering
A practical algorithm for static analysis of parallel programs
Journal of Parallel and Distributed Computing
Detection of Ada Static Deadlocks Using Petri Net Invariants
IEEE Transactions on Software Engineering
A general-purpose algorithm for analyzing concurrent programs
Communications of the ACM
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
Development of distributed software: concepts and tools
Development of distributed software: concepts and tools
Starvation and Critical Race Analyzers for Ada
IEEE Transactions on Software Engineering
Reachability analysis of Petri nets using symmetries
Systems Analysis Modelling Simulation
Compositional reachability analysis using process algebra
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Experiments with an improved constrained expression toolset
TAV4 Proceedings of the symposium on Testing, analysis, and verification
A model of Ada programs for static deadlock detection in polynomial times
PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
Automated Analysis of Concurrent Systems with the Constrained Expression Toolset
IEEE Transactions on Software Engineering
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
Analysis of real-time programs with simple time Petri nets
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Controlling state explosion in reachability analysis
Controlling state explosion in reachability analysis
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Proposed Testing and Analysis Research Initiative
IEEE Software
Design and Implementation of a Petri Net Based Toolkit for Ada Tasking Analysis
IEEE Transactions on Parallel and Distributed Systems
Coverage Preserving Reduction Strategies for Reachability Analysis
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Checking properties of nets using transformation
Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers
Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Identical tasks and counter variables in an integer programming-based approach to verification
IWSSD '93 Proceedings of the 7th international workshop on Software specification and design
Improving the accuracy of Petri net-based analysis of concurrent programs
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
A Compact Petri Net Representation and Its Implications for Analysis
IEEE Transactions on Software Engineering
An Application of Petri Net Reduction for Ada Tasking Deadlock Analysis
IEEE Transactions on Parallel and Distributed Systems
Stubborn Sets for Real-Time Petri Nets
Formal Methods in System Design
Modeling and analysis of a virtual reality system with time Petri nets
Proceedings of the 20th international conference on Software engineering
Formal modeling of synchronization methods for concurrent objects in Ada 95
Proceedings of the 1999 annual ACM SIGAda international conference on Ada
An empirical evaluation of deadlock detection in software architecture specifications
Annals of Software Engineering
A comparative study of formal verification techniques for software architecture specifications
Annals of Software Engineering
Automatic Real-Time Analysis of Reactive Systems with the PARTS Toolset
Automated Software Engineering
Knowledge-Based Software Architectures: Acquisition, Specification, and Verification
IEEE Transactions on Knowledge and Data Engineering
Translating Time Petri Net Structures into Ada 95 Statements
Ada-Europe '99 Proceedings of the 1999 Ada-Europe International Conference on Reliable Software Technologies
Analysis of Multithreaded Programs
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Experimental Evaluation of Verification and Validation Tools on Martian Rover Software
Formal Methods in System Design
The Maelstrom: Network Service Debugging via "Ineffective Procedures"
LISA '01 Proceedings of the 15th USENIX conference on System administration
Static Analysis of Concurrent Programs Using Ordinary Differential Equations
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Reduction rules for reset/inhibitor nets
Journal of Computer and System Sciences
Compositional Petri net models of advanced tasking in Ada-95
Computer Languages
Parallel computation of continuous Petri nets based on hypergraph partitioning
The Journal of Supercomputing
Hi-index | 0.00 |
An emerging challenge for software engineering is the development of the methods and tools to aid design and analysis of concurrent and distributed software. Over the past few years, a number of analysis methods that focus on Ada tasking have been developed. Many of these methods are based on some form of reachability analysis, which has the advantage of being conceptually simple, but the disadvantage of being computationally expensive. We explore the effectiveness of various Petri net-based techniques for the automated deadlock analysis of Ada programs. Our experiments consider a variety of state space reduction methods both individually and in various combinations. The experiments are applied to a number of classical concurrent programs as well as a set of “real-world” programs. The results indicate that Petri net reduction and reduced state space generation are mutually beneficial techniques, and that combined approaches based on Petri net models are quite effective, compared to alternative analysis approaches.