1 2 Assembly A P added

Зарегистрируйтесь, чтобы просмотреть полный документ!

РЕГИСТРАЦИЯ

Assembly A P added functionalities bug fixes Component C (1. 0) Component C’ (2. 0) 3

Upgraded Component C’ Component C Lost Behaviors Identical. Behaviors Containment Check (local) New Behaviors Compatibility Check (global) 8

[FM’ 05] Dynamic Component Substitutability Analysis, S. Chaki, E. Clarke, N. Sharygina, N. Sinha, Formal Methods Conference, 2005. 10

Predicate Abstraction 13

Lock server Enter_crit_section, Leave_crit_section Write_to_queue Queue Write. MQ Read_from_queue 14

C Lost C’ Identical New Containment Check 16

Containment (contd. ) M C C’ C’ over-approx under-approx C M’ M M’ True False, CE False, Refine M True, Refine M’ True False 17

Containment (contd. ) 18

C’ C Lost Identical New Compatibility Check 20

Yes/No Is. Candidate DFA D ) ( Minimum DFA ±Counterexample/ Yes 22

Automated AG Reasoning using L* [Cobleigh et al. ] -CE for A Teacher L* Assumption Generation A true CE CE Analysis +CE for A 24

Handling Multiple Components • AG Proof Tree • Each Ai computed by a separate L* instantiation 25

C Lost C’ Identical New Upgrade Reuse? • Can we reuse previous assumptions directly? • NO: upgrades may change the unknown U to be learned • Therefore, Dynamic AGR needs Dynamic L* Violates L* invariant 26

Table valid for U Assumption A Table valid for U’ Assumption A’ 28

Upgrade (Dynamic L*) Re-Validate! and Reuse • Multiple Components • Heuristics for choosing order of re-validating Ai’s in proof tree 29

Experimental Results Upgrade# (Property) Torig (msec) (AGR from scratch) Tug (msec) (Dynamic AGR) Ipc 1 (P 1) 2260 13 Ipc 1 (P 2) Ipc 3 (P 2) 1694 3286 805 3624 1649 14 17 10 17 14 Ipc 4 (P 1) 1102 24 Ipc 2 (P 1) Ipc 2 (P 2) Ipc 3 (P 1) 31

AGR for Simulation Conformance [CAV’ 05] Automated Assume-Guarantee Reasoning for Simulation Conformance, S. Chaki, E. Clarke, N. Sinha, P. Thati, Conference on Computer-Aided Verification, 2005. 33

Results Verif. Result Invalid Valid Invalid Direct AG Gain T 1 Mem 1 T 2 Mem 1/ |A| MQ # CQ # Mem 2 * * * * 2146 325 207 10. 4 8 265 3 2080 309 163 12. 8 8 279 3 2077 309 163 12. 7 16 279 3 2076 976 167 12. 4 16 770 4 2075 969 167 12. 4 16 767 4 2074 3009 234 8. 9 24 1514 5 2075 3059 234 8. 9 24 1514 5 2072 3048 234 8. 9 24 1514 5 35

Скачать презентацию 1 2 Assembly A P added

4204d9ec486d7ac746e1d53213133934.ppt

Количество слайдов: 55