1. Transaction Ordering Verification using Trace Inclusion Refinement Mike Jones 11 January 2000

2. 2 Case Study Check the producer consumer property for PCI 2.1 protocol. Which formal methods are best suited for reasoning about large protocols over unbounded branching networks? Resulting tools apply to designing, not implementing, a protocol over unbounded branching networks.

3. 3 Formal methods (in 1 slide) Formal = truth is based on form, not meaning. Syntax, not semantics, matters. Theorem proving –expressive, interactive, machine-checked Model checking –unexpressive, automatic, complexity Hybrid techniques Intel, HP, Compaq, Microsoft, AMD, SRI, Lucent, VSIA...

4. 4 Why PCI? It works. Why verify it? Published standard violated prod/cons. Stationary target. Beyond current formal techniques.

5. 5 How PCI works AgentBridge Bus p d d c Delayed Posted completion

6. 6 Posted transactions Posted transaction, P, from A to B. A puts p on “the rest of the network” and forgets about it. B receives P and that’s it. A B p The Rest of the network

7. 7 Posted transactions Pretend there are 2 bridges between A and B With the other transaction shown. Here’s how P gets from A to B... A B p cdp’

8. 8 Posted transactions P goes to bridge 1. P is now complete at A. P can pass delayed transaction d A B p cdp’

9. 9 Posted transactions Next, P completes to bridge 2. A B p cdp’

10. 10 Posted transactions P is now complete at bridge 1. P can pass the completion trans. C. P can not pass the other posted trans. A B p cdp’

11. 11 Posted transactions P waits until P’ completes on bridge 2 A B p cdp’

12. 12 Posted transactions Pretend that P’ went to another bridge (not shown). P can now complete to destination B. A B p cd

13. 13 Posted transactions No acknowledgement is sent to A. P is now complete at B. A B p cd

14. 14 Delayed transactions Delayed trans., d, from A to B. A puts d on “the rest of the network” and waits for a completion. B receives d and sends a completion,c. A B d The Rest of the network

15. 15 Delayed transactions 2 bridges between A and B Other transactions as shown. d tries to latch to bridge 1. d is now committed (called d’). A B d’ cdp’

16. 16 Delayed transactions Eventually, d’ latches to bridge 1. bridge 1 has an uncommitted copy of d d can pass the other d entry already in bridge 1. A B d’ cdp’ d

17. 17 Delayed transactions d can attempt to latch to bridge 2. d will then be committed at bridge 1. A B d’ cdp’ d

18. 18 Delayed transactions Eventually, d’ latches to bridge 2. A B d’ cdp’ d’

19. 19 Delayed transactions d can pass completion entry c. A B d’ cdp’ d’d

20. 20 Delayed transactions But, uncommitted d entries can be dropped at any time... A B d’ cdp’ d’d

21. 21 Delayed transactions bridge 1 has to resend d’ to bridge 2 d’ can not be deleted A B d’ cdp’ d’

22. 22 Delayed transactions d can be dropped again... pretend it passes C again. d can not pass posted transactions. d waits till p’ completes. A B d’ cdp’ d’d

23. 23 Delayed transactions d commits then latches to agent B. B creates a completion entry C. A B d’ cd d

24. 24 Delayed transactions d’ in bridge 2 can complete with the completion in B. d’ will be deleted from bridge 2. c will move into into bridge 2. A B d’ cd c

25. 25 Delayed transactions d is now complete at bridge 2. d’ in bridge 1 can complete with c in bridge 2. c can be deleted too... A B d’ cd c

26. 26 Delayed transactions d is now complete at bridge 1. finally, d’ in agent A completes with c in bridge 1. A B d’ cd c

27. 27 Delayed transactions d is now complete at A. no more actions! A B cd d’ c

28. 28 Reordering and deletion P can pass anything except P. D and C can pass either D or C. uncommitted D can be dropped. oldest C in a queue can be dropped. P and committed D never dropped.

29. 29 Producer/Consumer property if a producer agent writes a data item and the producer sets a flag and if the consumer reads the flag then the consumer will read the new data item.

30. 30 Producer/Consumer for PCI... p c d f...for all networks and all executions.

31. 31 Solution Carefully reduce the problem Check the reduced problem Generalize results

32. 32 Related work Other PCI work. –liveness [Corella,97] –state machine specifications [Clarke,99] –U of Utah [Mokkedem et al,00] Unbounded branching networks. –predicate transformers[Kesten,97] –predicate abstraction[Das,99] –Combined method [Abdulla,99]

33. 33 Careful reduction Reduce arbitrary PCI networks to N networks. Reduce infinite state to finite states. Show that PCI is a trace inclusion refinement of the reduced protocol.

34. 34 Structural Reduction

35. 35 Structural Reduction

36. 36 Structural Reduction pd c f pc d f pd c f

37. 37 Unrelated paths and agents... p c d f p c d f 

38. 38 State reduction PCI networks have an infinite # of states. Ignore certain transactions while preserving the PC property.

39. 39 Unrelated Transactions p... fwdwdwc cdwp d’cp pc pdd dp dwc dw fw cdw  p

40. 40 Trace Inclusion Refinement For every trace in the concrete protocol.

41. 41 Trace Inclusion Refinement For every trace in the concrete protocol. There exists a trace in the reduced protocol...

42. 42 Trace Inclusion Refinement For every trace in the concrete protocol. There exists a trace in the reduced protocol... Such that the reduction of each concrete state is equal to the corresponding abstract state.

43. 43...Applied to PCI Write a set of rules inductively defining the reachable states in PCI and reduced model.

44. 44 Check reduced model Used SML and murphi model checker. Rules based input languages 3,176 states checked in 67 seconds. Property was satisfied.

45. 45 Changing the model A different protocol –PCI without local master IDs –About 1/2 a day of effort –Plausible violation found in under 10 minutes A different property –When are two transactions received in order? –Useful for an on-chip bus being considered for SOC –1/2 an hour additional effort

46. 46 Conclusions A combination of rule-based notation, theorem proving and model checking works. Easy to modify both the protocol and the property being checked.

47. 47 Future work Automate the refinement proof. Tools for deriving reduced protocols for mutations of protocols. Anyone have a protocol over an unbounded network they need studied?

48. 48

49. 49 Outline Lay the groundwork Overview PCI and the property Our solution What makes our solution so good Discussion and conclusions

50. 50 Why Formal Methods? simulation impossible: infinite states. Does not guaruntee correctness. Forced to identify assumptions. Capitol critical applications.

51. 51 Structural Reduction Reduce any instance of PC to one of 3 abstract instances. Allows us to get complete structural coverage by checking 3 networks. Supported by a machine-checked proof. pd c f pc d f pd c f

52. 52 Producer/Consumer for PCI Producer writes a data value and sets a flag. Consumer reads the flag then reads the data Assuming –no intervening writes –flag gets written before it gets read Then the consumer gets the new data value. Check this for ALL executions in ALL networks

53. 53 What makes this problem hard All networks and all executions. Reasoning about PCI networks in general, using induction, is hard. Reasoning about individual PCI networks equals inefficient simulation.

54. 54 Trace Inclusion Refinement