On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability.
Igor KonnovHelmut VeithJosef WidderPublished in: CONCUR (2014)
Keyphrases
- bounded model checking
- learning algorithm
- orders of magnitude
- significant improvement
- optimization problems
- distributed systems
- worst case
- dynamic programming
- computational cost
- computational complexity
- theoretical analysis
- data mining algorithms
- computationally efficient
- cooperative
- model checking
- distributed environment
- data structure