Modeling the ADA task system by Petri nets
Computer Languages
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Interactive State-Space Analysis of Concurrent Systems
IEEE Transactions on Software Engineering
Foundations for the Arcadia environment architecture
SDE 3 Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
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
Paradigms for process interaction in distributed programs
ACM Computing Surveys (CSUR)
Concurrency analysis in the presence of procedures using a data-flow framework
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Compositional reachability analysis using process algebra
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
An empirical evaluation of three methods for deadlock analysis of Ada tasking programs
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Data flow analysis for verifying properties of concurrent programs
SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
ACM Transactions on Software Engineering and Methodology (TOSEM)
A concurrency analysis tool suite for Ada programs: rationale, design, and preliminary experience
ACM Transactions on Software Engineering and Methodology (TOSEM)
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
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
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Design and Implementation of a Petri Net Based Toolkit for Ada Tasking Analysis
IEEE Transactions on Parallel and Distributed Systems
Tractable Flow Analysis for Anomaly Detection in Distributed Programs
ESEC '93 Proceedings of the 4th European Software Engineering Conference on Software Engineering
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
Behavior relativity of Petri nets
Journal of Computer Science and Technology
Expert Systems with Applications: An International Journal
Static Analysis of Concurrent Programs Using Ordinary Differential Equations
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Causal dataflow analysis for concurrent programs
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Intelligent QoS management for multimedia services support in wireless mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Representing Petri net structures as directed graphs
SEPADS'11 Proceedings of the 10th WSEAS international conference on Software engineering, parallel and distributed systems
| Hi-index | 0.01 |
This paper explores a property-independent, coarsened, multilevel representation for supporting state reachability analysis for a number of different properties. This multilevel representation comprises a reachability graph derived from a highly optimized Petri net representation that is based on task interaction graphs and associated property-specific summary information. This highly optimized representation reduces the size of the reachability graph but may increase the cost of the analysis algorithm for some types of analyses. This paper explores this tradeoff.To this end, we have developed a framework for checking a variety of properties of concurrent programs using this optimized representation and present empirical results that compare the cost to an alternative Petri net representation. In addition, we present reduction techniques that can further improve the performance and yet still preserve analysis information. Although worst-case bounds for most concurrency analysis techniques are daunting, we demonstrate that the techniques that we propose significantly broaden the applicability of reachability analyses.