Distributed Modular Model Checking
| Authors | |
|---|---|
| Year of publication | 2002 |
| Type | Article in Proceedings |
| Conference | 2002 IEEE International Conference on Automated Software Engineering Doctoral Symposium |
| MU Faculty or unit | |
| Citation | |
| Field | Computer hardware and software |
| Keywords | formal methods; distributed model checking; modular model checking |
| Description | A distributed model checking algorithm is presented. It is designed to be run on a network of workstations that communicate via message passing. The algorithm handles large state spaces by partitioning them into smaller units. Such a partition of state space into partial state spaces can be employed to perform several smaller verification problems independently on several computers increasing thus not only speeding up the verification, but most importantly the available memory. We also suggest partition function that can be used as input to the ditributed algorithm. For software systems a quite successful approach is to partition them following the syntactical structure of the program. Other state based temporal logics and various model checking algorithms can be adapted easily as well. |
| Related projects: |