Analysis and verification of an automatic document feeder
Proceedings of the 2007 ACM symposium on Applied computing
An Abstract Interpretation Toolkit for μCRL
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
In this paper, we illustrate a formal verification method for distributed JavaSpaces applications by analyzing a nontrivial fault tolerant algorithm that solves a typical coordination problem. The problem consists of the computation of an extensive task, performed in parallel by splitting it into smaller and more manageable parts. The proposed solution, based on JavaSpaces coordination primitives, transactions and time-outs, is verified by translating it to the formal language µCRL, together with the previously developed µCRL-model of the JavaSpaces architecture, and by using model checking techniques.