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...
Príomhchruthaitheoirí: | Antonino, P, Gibson-Robinson, T, Roscoe, A |
---|---|
Formáid: | Conference item |
Foilsithe / Cruthaithe: |
Springer, Berlin, Heidelberg
2017
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Efficient deadlock freedom checking using local analysis and SAT checking
de réir: Antonio, P, et al.
Foilsithe / Cruthaithe: (2016) -
Efficient verification of comcurrent systems using local analysis based approximations and SAT solving
de réir: Antonino, P, et al.
Foilsithe / Cruthaithe: (2019) -
Efficient verification of concurrent systems using synchronisation analysis and SAT/SMT solving
de réir: Antonino, P, et al.
Foilsithe / Cruthaithe: (2019) -
Graph-Based Token Replay for Online Conformance Checking
de réir: Indra Waspada, et al.
Foilsithe / Cruthaithe: (2022-01-01) -
Conformance Checking of Dwelling Time Using a Token-based Method
de réir: Bambang Jokonowo, et al.
Foilsithe / Cruthaithe: (2021-10-01)