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

Full description

Bibliographic Details

Published in:	Proceedings (IEEE Pacific Rim International Symposium on Dependable Computing) pp. 261 - 266
Main Authors:	Nakano, Shinya, Tsuchiya, Tatsuhiro
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.01.2017
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!