The automatic detection of token structures and invariants using SAT checking

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...

Descripció completa

Dades bibliogràfiques
Autors principals:	Antonino, P, Gibson-Robinson, T, Roscoe, A
Format:	Conference item
Publicat:	Springer, Berlin, Heidelberg 2017

Ítems similars

Efficient deadlock freedom checking using local analysis and SAT checking
per: Antonio, P, et al.
Publicat: (2016)

Efficient verification of comcurrent systems using local analysis based approximations and SAT solving
per: Antonino, P, et al.
Publicat: (2019)

Efficient verification of concurrent systems using synchronisation analysis and SAT/SMT solving
per: Antonino, P, et al.
Publicat: (2019)

Graph-Based Token Replay for Online Conformance Checking
per: Indra Waspada, et al.
Publicat: (2022-01-01)

Conformance Checking of Dwelling Time Using a Token-based Method
per: Bambang Jokonowo, et al.
Publicat: (2021-10-01)

Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
per: Parosh Abdulla, et al.
Publicat: (2007-02-01)

Decentralized token economy theory (DeTEcT): token pricing, stability and governance for token economies
per: R. Sadykhov, et al.
Publicat: (2023-11-01)

Nets with Tokens Which Carry Data
per: Roscoe, A, et al.
Publicat: (2007)

Nets with Tokens which Carry Data
per: Lazic, R, et al.
Publicat: (2008)

Nets with tokens which carry data
per: Lazić, R, et al.
Publicat: (2008)

ReSA Tool: Structured Requirements Specification and SAT-based Consistency-checking
per: Nesredin Mahmud, et al.
Publicat: (2016-10-01)

Token and part-of-speech fusion for pretraining of transformers with application in automatic cyberbullying detection
per: Nor Saiful Azam Bin Nor Azmi, et al.
Publicat: (2025-03-01)

Faster FDR Counterexample Generation Using SAT−Solving
per: Palikareva, H, et al.
Publicat: (2009)

Model−checking CSP
per: A. W. Roscoe
Publicat: (1994)

SAT solving in CSP trace refinement
per: Palikareva, H, et al.
Publicat: (2012)

SAT−solving in CSP trace refinement
per: Palikareva, H, et al.
Publicat: (2011)

SAT-solving in CSP trace refinement
per: Palikareva, H, et al.
Publicat: (2012)

SAT−Solving in CSP Trace Refinement
per: Palikareva, H, et al.
Publicat: (2012)

Ancient Tokens from the Archaeological Museum of Syracuse
per: Antonino Crisà
Publicat: (2023-12-01)

Local search in model checking
per: Roscoe, P, et al.
Publicat: (2009)

Bounded Quantifier Instantiation for Checking Inductive Invariants
per: Yotam M. Y. Feldman, et al.
Publicat: (2019-08-01)

Fake image detection through automatic fact checking
per: See-To, Junwei
Publicat: (2023)

fbSAT: Automatic Inference of Minimal Finite-State Models of Function Blocks Using SAT Solver
per: Konstantin Chukharev, et al.
Publicat: (2022-01-01)

Local Search in Model Checking
per: Roscoe, A, et al.
Publicat: (2009)

Finitary refinement checks for infinitary specifications
per: Roscoe, A
Publicat: (2004)

Automatic generation of propagation complete SAT encodings
per: Brain, M, et al.
Publicat: (2015)

Checking noninterference in Timed CSP
per: Roscoe, A, et al.
Publicat: (2013)

Checking noninterference in the timed world
per: Roscoe, A, et al.
Publicat: (2013)

AUTOMATIC DETERMINING OF TOKEN SEQUENCE ERRORS IN RESPONSES TO OPEN ANSWER QUESTION IN MOODLE LMS
per: Oleg A. Sychev, et al.
Publicat: (2016-05-01)

Automatic Detection and Classification of Knee Osteoarthritis Using Hu's Invariant Moments
per: Shivanand S. Gornale, et al.
Publicat: (2020-11-01)

Tokenization of Assets: Security Tokens in Liechtenstein and Switzerland
per: Angelika K. Layr
Publicat: (2021-09-01)

The perfect ‘spy’ for model−checking cryptoprotocols
per: Roscoe, A, et al.
Publicat: (1997)

Model checking Timed CSP
per: Armstrong, P, et al.
Publicat: (2012)

Symmetry reduction in CSP model checking
per: Gibson-Robinson, T, et al.
Publicat: (2019)

Hierarchical compression for model−checking CSP‚ or How to check 10^20 dining philosophers for deadlock
per: Roscoe, A, et al.
Publicat: (1995)

The token-token identity-theory and recent theories of reference
per: Gjelsvik, O, et al.
Publicat: (1986)

The perfect spy for model−checking crypto−protocols
per: Roscoe, A, et al.
Publicat: (1997)

Automatic Fact Checking Using Context and Discourse Information
per: Nakov, Preslav, et al.
Publicat: (2022)

A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph
per: Chancellor, N, et al.
Publicat: (2016)

Automatic Maintenance of Association Invariants
per: Welch, J, et al.
Publicat: (2008)