Detection of Ada Static Deadlocks Using Petri Net Invariants
IEEE Transactions on Software Engineering
Proceedings of the conference on TRI-Ada '97
Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
Formal modeling of synchronization methods for concurrent objects in Ada 95
Proceedings of the 1999 annual ACM SIGAda international conference on Ada
How to verify concurrent Ada programs: the application of model checking
IRTAW '99 Proceedings of the ninth international workshop on Real-time Ada
Bandera: extracting finite-state models from Java source code
Proceedings of the 22nd international conference on Software engineering
An Automated Verification Method for Distributed Systems Software Based on Model Extraction
IEEE Transactions on Software Engineering
Hierarchical Reachability Graph of Bounded Petri Nets for Concurrent-Software Analysis
IEEE Transactions on Software Engineering
Logic Verification of ANSI-C Code with SPIN
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs
Ada-Europe '00 Proceedings of the 5th Ada-Europe International Conference on Reliable Software Technologies
VeriSoft: A Tool for the Automatic Analysis of Concurrent Reactive Software
CAV '97 Proceedings of the 9th International Conference 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
Petri nets based proofs of Ada 95 solution for preference control
APSEC '97 Proceedings of the Fourth Asia-Pacific Software Engineering and International Computer Science Conference
Pre-and post-gglomerations for LTL model checking
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Temporal skeletons for verifying time
Proceedings of the 2005 annual ACM SIGAda international conference on Ada: The Engineering of Correct and Reliable Software for Real-Time & Distributed Systems using Ada and Related Technologies
Concurrent Program Metrics Drawn by Quasar
Ada-Europe '08 Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies
Weak Fairness Semantic Drawbacks in Java Multithreading
Ada-Europe '09 Proceedings of the 14th Ada-Europe International Conference on Reliable Software Technologies
Distributed colored Petri net model-checking with CYCLADES
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Modelling remote concurrency with Ada: case study of symmetric non-deterministic rendezvous
Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
Syntactical colored petri nets reductions
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Dynamic tasks verification with QUASAR
Ada-Europe'05 Proceedings of the 10th Ada-Europe international conference on Reliable Software Technologies
A new approach for concurrent program slicing
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
High level petri nets analysis with helena
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Memory efficient state space storage in explicit software model checking
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Hi-index | 0.00 |
Concurrency introduces a high degree of combinatory which may be the source of subtle mistakes. We present a new tool, Quasar, which is based on ASIS and which uses fully the concept of patterns. The analysis of a concurrent Ada program by our tool proceeds in four steps: automatic extraction of the concurrent part of the program; translation of the simplified program into a formal model using predefined patterns that are combined by substitution and merging constructors; analysis of the model both by structural techniques and model-checking techniques; reporting deadlock or starvation results. We demonstrate the usefulness of Quasar by analyzing several variations of a non trivial concurrent program.