The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Behavioral Verification of Distributed Concurrent Systems with BOBJ
QSIC '03 Proceedings of the Third International Conference on Quality Software
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Combining theorem proving and narrowing for rewriting-logic specifications
TAP'10 Proceedings of the 4th international conference on Tests and proofs
| Hi-index | 0.00 |
We describe a way to write state machines inductively. The proposed method makes it possible to use the standard techniques for proving theorems on inductive types to verify that state machines satisfy invariant properties. A mutual exclusion protocol using a queue is used to exemplify the proposed method.