Coordinated computing: tools and techniques for distributed software
Coordinated computing: tools and techniques for distributed software
Describing and analyzing distributed software system designs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Interactive State-Space Analysis of Concurrent Systems
IEEE Transactions on Software Engineering
Towards Complexity Metrics for Ada Tasking
IEEE Transactions on Software Engineering
A Petri net framework for automated analysis of Ada tasking behavior
Journal of Systems and Software
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
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
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
A method of sharing industrial software complexity data
ACM SIGPLAN Notices
Compositional reachability analysis using process algebra
TAV4 Proceedings of the symposium on Testing, analysis, and verification
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
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
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
Formal modeling of synchronization methods for concurrent objects in Ada 95
Proceedings of the 1999 annual ACM SIGAda international conference on Ada
Automatic Real-Time Analysis of Reactive Systems with the PARTS Toolset
Automated Software Engineering
On Verifying Distributed Multithreaded Java Programs
Software Quality Control
Formal Modelling of Java GUI Event Handling
ICFEM '02 Proceedings of the 4th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Behavior relativity of Petri nets
Journal of Computer Science and Technology
A Petri-net-based approach to real-time program analysis
IWSSD '93 Proceedings of the 7th international workshop on Software specification and design
An incremental approach to reachability analysis of distributed programs
IWSSD '93 Proceedings of the 7th international workshop on Software specification and design
Static Analysis of Concurrent Programs Using Ordinary Differential Equations
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Dynamic tasks verification with QUASAR
Ada-Europe'05 Proceedings of the 10th Ada-Europe international conference on Reliable Software Technologies
Checking system boundedness using ordinary differential equations
Information Sciences: an International Journal
| Hi-index | 0.01 |
The use of Petri nets for defining a general static analysis framework for Ada tasking is advocated. The framework has evolved into a collection of tools that have proven to be a very valuable platform for experimental research. The design and implementation oftools that make up the tasking-oriented toolkit for the Ada language (TOTAL) are defined and discussed. Modeling and query/analysis methods and tools are discussed. Example Ada tasking programs are used to demonstrate the utility of each tool individually as well as the way the tools integrate. TOTAL is divided into two major subsystems, the front-end translator subsystem (FETS) and the back-end information display subsystem (BIDS). Three component tools that make up FETS are defined. Examples demonstrate the way these tools integrate in order to perform the translation of Ada source to Petri-net format. The BIDS subsystem and, in particular, the use of tools and techniques to support user-directed, but transparent, searches of Ada-net reachability graphs are discussed.