Detection of Ada Static Deadlocks Using Petri Net Invariants
IEEE Transactions on Software Engineering
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Proceedings of the conference on TRI-Ada '97
Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
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
Events and Constraints: A Graphical Editor for Capturing Logic Requirements of Programs
RE '01 Proceedings of the Fifth IEEE International Symposium on Requirements Engineering
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
SafetyChip: a time monitoring and policing device
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
Dynamic tasks verification with QUASAR
Ada-Europe'05 Proceedings of the 10th Ada-Europe international conference on Reliable Software Technologies
An approach to model checking ada programs
Ada-Europe'12 Proceedings of the 17th Ada-Europe international conference on Reliable Software Technologies
Hi-index | 0.00 |
In this paper we present an original and useful way for specifying and verifying temporal properties of concurrent programs with our tool named Quasar. Quasar is based on ASIS and uses formal methods (model checking). Properties that can be checked are either general, like deadlock or fairness, or more context specific, referring to tasks states or to value of variables; properties are then expressed in temporal logic. In order to simplify the expression of these properties, we define some templates that can be instantiated with specific items of the programs. We demonstrate the usefulness of these templates by verifying subtle variations of the Peterson algorithm. Thus, although Quasar uses up-to-date formal methods it remains accessible to a large class of practitioners.