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...
Asıl Yazarlar: | Antonino, P, Gibson-Robinson, T, Roscoe, A |
---|---|
Materyal Türü: | Conference item |
Baskı/Yayın Bilgisi: |
Springer, Berlin, Heidelberg
2017
|
Benzer Materyaller
-
Efficient deadlock freedom checking using local analysis and SAT checking
Yazar:: Antonio, P, ve diğerleri
Baskı/Yayın Bilgisi: (2016) -
Efficient verification of comcurrent systems using local analysis based approximations and SAT solving
Yazar:: Antonino, P, ve diğerleri
Baskı/Yayın Bilgisi: (2019) -
Efficient verification of concurrent systems using synchronisation analysis and SAT/SMT solving
Yazar:: Antonino, P, ve diğerleri
Baskı/Yayın Bilgisi: (2019) -
Graph-Based Token Replay for Online Conformance Checking
Yazar:: Indra Waspada, ve diğerleri
Baskı/Yayın Bilgisi: (2022-01-01) -
Conformance Checking of Dwelling Time Using a Token-based Method
Yazar:: Bambang Jokonowo, ve diğerleri
Baskı/Yayın Bilgisi: (2021-10-01)