Classifying properties: an alternative to the safety-liveness classification
SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
Continuous self-evaluation for the self-improvement of software
IWSAS' 2000 Proceedings of the first international workshop on Self-adaptive software
Modular verification of collaboration-based software designs
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Modeling Multithreaded Applications Using Petri Nets
International Journal of Parallel Programming
The Influence of Software Module Systems on Modular Verification
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Frameworks for Reasoning about Agent Based Systems
Revised Papers from the International Workshop on Infrastructure for Multi-Agent Systems: Infrastructure for Agents, Multi-Agent Systems, and Scalable Multi-Agent Systems
Verifying aspect advice modularly
Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
Foundations of incremental aspect model-checking
ACM Transactions on Software Engineering and Methodology (TOSEM)
FLAVERS: a finite state verification technique for software systems
IBM Systems Journal
| Hi-index | 0.00 |
This paper presents FLAVERS, a finite state verification approach that analyzes whether concurrent or sequential programs satisfy user-defined correctness properties. In contrast to other finite- state verification techniques, FLAVERS is based on algorithms with low-order polynomial bounds on their running time. FLAVERS achieves this efficiency at the cost of precision. Users, however, can improve the precision of the results by selectively and judiciously incorporating additional semantic information into the analysis problem. The FLAVERS analysis approach has been implemented for programs written in Ada. We report on an empirical study of the performance of applying the FLAVERS/Ada tool set to a collection of multi-tasking Ada programs. This study indicates that sufficient precision for proving program properties can be achieved and that the cost for such analysis grows as a low-order polynomial in the size of the program.