Výsledky vyhledávání - "bakery algorithm"
-
1
Method and Case Study of Model Checking Concurrent Systems That Use Unbounded Timestamps
ISSN: 2473-3105Vydáno: IEEE 01.01.2017Vydáno v Proceedings (IEEE Pacific Rim International Symposium on Dependable Computing) (01.01.2017)“… These algorithms are hard to correctly design and often subject to subtle design faults. Model checking, which is a state exploration-based verification method, has been very successful in finding design faults in many practical systems…”
Získat plný text
Konferenční příspěvek