Method and Case Study of Model Checking Concurrent Systems That Use Unbounded Timestamps

Parallel and distributed algorithms, including those for fault tolerance, often use timestamps to coordinate the behaviors of processes. These algorithms are hard to correctly design and often subject to subtle design faults. Model checking, which is a state exploration-based verification method, ha...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings (IEEE Pacific Rim International Symposium on Dependable Computing) S. 261 - 266
Hauptverfasser:	Nakano, Shinya, Tsuchiya, Tatsuhiro
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.01.2017
Schlagworte:	Algorithm design and analysis bakery algorithm data abstraction Distributed algorithms Electronic mail Fault tolerance Fault tolerant systems Information science Model checking SPIN timestamp
ISSN:	2473-3105
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!