作者: Malay K. Ganai
DOI: 10.1007/978-1-4419-9359-5_6
关键词:
摘要: Concurrent systems are hard to verify due complex and unintended asynchronous interactions. Exploring the state space of such a system is daunting task. Model checking techniques that use symbolic search partial-order reduction gaining popularity. In this chapter, we focus primarily on bounded model (BMC) approaches decision procedures for length counter-examples safety properties as data races assertion violations in multi-threaded concurrent systems. particular, contrast several state-of-the-art based synchronous modeling styles used formulating problems, sizes corresponding formulas.