The automatic detection of token structures and invariants using SAT checking
Many distributed systems rely on token structures for their correct operation. Often, these structures make sure that a fixed number of tokens exists at all times, or perhaps that tokens cannot be completely eliminated, to prevent systems from reaching undesired states. In this paper we show how a S...
| Main Authors: | , , |
|---|---|
| פורמט: | Conference item |
| יצא לאור: |
Springer, Berlin, Heidelberg
2017
|