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...
主要な著者: | Antonino, P, Gibson-Robinson, T, Roscoe, A |
---|---|
フォーマット: | Conference item |
出版事項: |
Springer, Berlin, Heidelberg
2017
|
類似資料
-
Efficient deadlock freedom checking using local analysis and SAT checking
著者:: Antonio, P, 等
出版事項: (2016) -
Efficient verification of comcurrent systems using local analysis based approximations and SAT solving
著者:: Antonino, P, 等
出版事項: (2019) -
Efficient verification of concurrent systems using synchronisation analysis and SAT/SMT solving
著者:: Antonino, P, 等
出版事項: (2019) -
Graph-Based Token Replay for Online Conformance Checking
著者:: Indra Waspada, 等
出版事項: (2022-01-01) -
Conformance Checking of Dwelling Time Using a Token-based Method
著者:: Bambang Jokonowo, 等
出版事項: (2021-10-01)