X hits on this document

Powerpoint document

Algorithmic Verification of Concurrent Programs - page 64 / 100

383 views

0 shares

0 downloads

0 comments

64 / 100

Bounded model checking

for each (s 













’

’



Problem: Is there an execution from a state in I

to a state in E of length at most d?

Space complexity: O(d)

Time complexity: O(nd)

NP-complete

Document info
Document views383
Page views383
Page last viewedTue Jan 24 01:48:31 UTC 2017
Pages100
Paragraphs1586
Words3927

Comments