SLIDE 1
Hari Govind V K, Arie Gurfinkel, Yakir Vizel and Vijay Ganesh Given - - PowerPoint PPT Presentation
Hari Govind V K, Arie Gurfinkel, Yakir Vizel and Vijay Ganesh Given - - PowerPoint PPT Presentation
Hari Govind V K, Arie Gurfinkel, Yakir Vizel and Vijay Ganesh Given < Init , Tr , P > prove that P holds on all states reachable from Init Safety can be proven using inductive invariants Init Inv Inv & Tr Inv Inv P
SLIDE 2
SLIDE 3
SLIDE 4
SLIDE 5
§ Given < Init , Tr , P > prove that P holds on all states reachable from Init
SLIDE 6
§ Safety can be proven using inductive invariants
§ Init à Inv § Inv & Tr à Inv § Inv à P
§ IC3 based algorithms construct Inv incrementally : conjoin several lemmas to prove
the property up to a bound and then push the lemmas forward
SLIDE 7
SLIDE 8
§ Pushing one lemma depends on many supporting lemmas § Push support set before pushing this lemma § Support sets are dynamic
SLIDE 9
§ Pushing a lemma is a repetition of previous proofs at higher bounds § By trial and error, we can learn the correct order
SLIDE 10