Partial-order verification in SPIN can be more efficient (1997)
| Venue: | In Proceedings of the 3rd International SPIN Workshop on Model Checking of Software (SPIN ‘97 |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Schoot97partial-orderverification,
author = {Hans Van Der Schoot},
title = {Partial-order verification in SPIN can be more efficient},
booktitle = {In Proceedings of the 3rd International SPIN Workshop on Model Checking of Software (SPIN ‘97},
year = {1997}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Partial-order reduction methods form a collection of state exploration techniques set to relieve the stateexplosion problem in concurrent program verification. One such method is implemented in the verification tool SPIN. Its use often reduces significantly the memory and time needed for verifying local and termination properties of concurrent programs and, moreover, for verifying that concurrent programs satisfy their linear temporal logic specifications (i.e. for LTL model-checking). This paper builds on SPIN's partial-order reduction method to yield an approach which enables further reductions in space and time for verifying concurrent programs. Keywords Concurrency, program correctness, model-checking, partial-order reduction, temporal logic 1 Introduction Partial-order reduction methods [3-5, 8, 11, 20, 21, 25-27] form a collection of state exploration techniques set to relieve the state-explosion problem in concurrent program verification. The main observation underlying these ...
