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: | 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, et al.
出版: (2016) -
Efficient verification of comcurrent systems using local analysis based approximations and SAT solving
由: Antonino, P, et al.
出版: (2019) -
Efficient verification of concurrent systems using synchronisation analysis and SAT/SMT solving
由: Antonino, P, et al.
出版: (2019) -
Graph-Based Token Replay for Online Conformance Checking
由: Indra Waspada, et al.
出版: (2022-01-01) -
Conformance Checking of Dwelling Time Using a Token-based Method
由: Bambang Jokonowo, et al.
出版: (2021-10-01)