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

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings (IEEE Pacific Rim International Symposium on Dependable Computing) s. 261 - 266
Hlavní autori:	Nakano, Shinya, Tsuchiya, Tatsuhiro
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.01.2017
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!