State-based model checking of event-driven system requirements
SIGSOFT '91 Proceedings of the conference on Software for citical systems
Patterns in property specifications for finite-state verification
Proceedings of the 21st international conference on Software engineering
Protocol Design: Redefining the State of the Art
IEEE Software
State-Based Model Checking of Event-Driven System Requirements
IEEE Transactions on Software Engineering
Validating Requirements for Fault Tolerant Systems using Model Checking
ICRE '98 Proceedings of the 3rd International Conference on Requirements Engineering: Putting Requirements Engineering to Practice
Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking
Feature interaction detection by pairwise analysis of LTL properties: a case study
Formal Methods in System Design
A formal model for service-oriented interactions
Science of Computer Programming
Parallelizing the spin model checker
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
| Hi-index | 0.00 |
The paper presents a minimal proof theory which is adequate for proving the main important temporal properties of reactive programs. The properties we consider consist of the classes of invariance, response, and precedence properties. For each of these classes we present a small set of rules that is complete for verifying properties belonging to this class. We illustrate the application of these rules by analyzing and verifying the properties of a new algorithm for mutual exclusion.