Download presentation
Presentation is loading. Please wait.
1
1 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 SPIN Examples
2
2 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion Peterson’s solution to the mutual exclusion problem
3
3 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion Peterson’s solution to the mutual exclusion problem
4
4 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion Peterson’s solution to the mutual exclusion problem flag 0 =1
5
5 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion Peterson’s solution to the mutual exclusion problem flag 0 =1 turn=0
6
6 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion Peterson’s solution to the mutual exclusion problem flag 0 =1 turn=0 flag 1 == 0 || turn == 1
7
7 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion Peterson’s solution to the mutual exclusion problem flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1
8
8 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion Peterson’s solution to the mutual exclusion problem flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1
9
9 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion Peterson’s solution to the mutual exclusion problem flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 Critical Section
10
10 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion Peterson’s solution to the mutual exclusion problem flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section
11
11 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion Peterson’s solution to the mutual exclusion problem flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section
12
12 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section proctype mutex0() { }
13
13 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; proctype mutex0() { }
14
14 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { }
![14 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { }](http://images.slideplayer.com/8/2326528/slides/slide_14.jpg "14 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { }")
15
15 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { flag[0] = 1; }
![15 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { flag[0] = 1; }](http://images.slideplayer.com/8/2326528/slides/slide_15.jpg "15 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { flag[0] = 1; }")
16
16 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { flag[0] = 1; turn = 0; }
![16 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { flag[0] = 1; turn = 0; }](http://images.slideplayer.com/8/2326528/slides/slide_16.jpg "16 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { flag[0] = 1; turn = 0; }")
17
17 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { flag[0] = 1; turn = 0; (flag[1] == 0 || turn == 0); }
![17 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { flag[0] = 1; turn = 0; (flag[1] == 0 || turn == 0); }](http://images.slideplayer.com/8/2326528/slides/slide_17.jpg "17 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { flag[0] = 1; turn = 0; (flag[1] == 0 || turn == 0); }")
18
18 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { flag[0] = 1; turn = 0; (flag[1] == 0 || turn == 0); /* critical section */ }
![18 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { flag[0] = 1; turn = 0; (flag[1] == 0 || turn == 0); /* critical section */ }](http://images.slideplayer.com/8/2326528/slides/slide_18.jpg "18 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { flag[0] = 1; turn = 0; (flag[1] == 0 || turn == 0); /* critical section */ }")
19
19 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { flag[0] = 1; turn = 0; (flag[1] == 0 || turn == 0); /* critical section */ flag[0] = 0; }
![19 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { flag[0] = 1; turn = 0; (flag[1] == 0 || turn == 0); /* critical section */ flag[0] = 0; }](http://images.slideplayer.com/8/2326528/slides/slide_19.jpg "19 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { flag[0] = 1; turn = 0; (flag[1] == 0 || turn == 0); /* critical section */ flag[0] = 0; }")
20
20 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { again: flag[0] = 1; turn = 0; (flag[1] == 0 || turn == 0); /* critical section */ flag[0] = 0; goto again; }
![20 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { again: flag[0] = 1; turn = 0; (flag[1] == 0 || turn == 0); /* critical section */ flag[0] = 0; goto again; }](http://images.slideplayer.com/8/2326528/slides/slide_20.jpg "20 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN flag 0 =1 turn=0 flag 1 == 0 || turn == 1 flag 1 != 0 && turn != 1 flag 0 =0 Critical Section bool turn; bool flag[2]; proctype mutex0() { again: flag[0] = 1; turn = 0; (flag[1] == 0 || turn == 0); /* critical section */ flag[0] = 0; goto again; }")
21
21 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion in SPIN bool turn, flag[2]; active [2] proctype user() { assert(_pid == 0 || __pid == 1); again: flag[_pid] = 1; turn = _pid; (flag[1 - _pid] == 0 || turn == 1 - _pid); /* critical section */ flag[_pid] = 0; goto again; } Active process: automatically creates instances of processes _pid: Identifier of the process assert: Checks that there are only at most two instances with identifiers 0 and 1
![21 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN bool turn, flag[2]; active [2] proctype user() { assert(_pid == 0 || __pid == 1); again: flag[_pid] = 1; turn = _pid; (flag[1 - _pid] == 0 || turn == 1 - _pid); /* critical section */ flag[_pid] = 0; goto again; } Active process: automatically creates instances of processes _pid: Identifier of the process assert: Checks that there are only at most two instances with identifiers 0 and 1](http://images.slideplayer.com/8/2326528/slides/slide_21.jpg "21 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN bool turn, flag[2]; active [2] proctype user() { assert(_pid == 0 || __pid == 1); again: flag[_pid] = 1; turn = _pid; (flag[1 - _pid] == 0 || turn == 1 - _pid); /* critical section */ flag[_pid] = 0; goto again; } Active process: automatically creates instances of processes _pid: Identifier of the process assert: Checks that there are only at most two instances with identifiers 0 and 1")
22
22 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion in SPIN bool turn, flag[2]; byte ncrit; active [2] proctype user() { assert(_pid == 0 || __pid == 1); again: flag[_pid] = 1; turn = _pid; (flag[1 - _pid] == 0 || turn == 1 - _pid); ncrit++; assert(ncrit == 1); /* critical section */ ncrit--; flag[_pid] = 0; goto again; } ncrit: Counts the number of Process in the critical section assert: Checks that there are always at most one process in the critical section
![22 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN bool turn, flag[2]; byte ncrit; active [2] proctype user() { assert(_pid == 0 || __pid == 1); again: flag[_pid] = 1; turn = _pid; (flag[1 - _pid] == 0 || turn == 1 - _pid); ncrit++; assert(ncrit == 1); /* critical section */ ncrit--; flag[_pid] = 0; goto again; } ncrit: Counts the number of Process in the critical section assert: Checks that there are always at most one process in the critical section](http://images.slideplayer.com/8/2326528/slides/slide_22.jpg "22 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN bool turn, flag[2]; byte ncrit; active [2] proctype user() { assert(_pid == 0 || __pid == 1); again: flag[_pid] = 1; turn = _pid; (flag[1 - _pid] == 0 || turn == 1 - _pid); ncrit++; assert(ncrit == 1); /* critical section */ ncrit--; flag[_pid] = 0; goto again; } ncrit: Counts the number of Process in the critical section assert: Checks that there are always at most one process in the critical section")
23
23 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Mutual Exclusion in SPIN bool turn, flag[2]; bool critical[2]; active [2] proctype user() { assert(_pid == 0 || __pid == 1); again: flag[_pid] = 1; turn = _pid; (flag[1 - _pid] == 0 || turn == 1 - _pid); critical[_pid] = 1; /* critical section */ critical[_pid] = 0; flag[_pid] = 0; goto again; } LTL Properties: [] (critial[0] || critical[1]) [] <> (critical[0]) [] <> (critical[1]) [] (critical[0] -> (critial[0] U (!critical[0] && ((!critical[0] && !critical[1]) U critical[1])))) [] (critical[1] -> (critial[1] U (!critical[1] && ((!critical[1] && !critical[0]) U critical[0]))))
![23 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN bool turn, flag[2]; bool critical[2]; active [2] proctype user() { assert(_pid == 0 || __pid == 1); again: flag[_pid] = 1; turn = _pid; (flag[1 - _pid] == 0 || turn == 1 - _pid); critical[_pid] = 1; /* critical section */ critical[_pid] = 0; flag[_pid] = 0; goto again; } LTL Properties: [] (critial[0] || critical[1]) [] <> (critical[0]) [] <> (critical[1]) [] (critical[0] -> (critial[0] U (!critical[0] && ((!critical[0] && !critical[1]) U critical[1])))) [] (critical[1] -> (critial[1] U (!critical[1] && ((!critical[1] && !critical[0]) U critical[0]))))](http://images.slideplayer.com/8/2326528/slides/slide_23.jpg "23 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Mutual Exclusion in SPIN bool turn, flag[2]; bool critical[2]; active [2] proctype user() { assert(_pid == 0 || __pid == 1); again: flag[_pid] = 1; turn = _pid; (flag[1 - _pid] == 0 || turn == 1 - _pid); critical[_pid] = 1; /* critical section */ critical[_pid] = 0; flag[_pid] = 0; goto again; } LTL Properties: [] (critial[0] || critical[1]) [] <> (critical[0]) [] <> (critical[1]) [] (critical[0] -> (critial[0] U (!critical[0] && ((!critical[0] && !critical[1]) U critical[1])))) [] (critical[1] -> (critial[1] U (!critical[1] && ((!critical[1] && !critical[0]) U critical[0]))))")
24
24 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Alternating Bit Protocol Two processes want to communicate They want acknowledge of received messages Sending window of one message Each message is identified by one bit Alternating values of the identifier
25
25 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Alternating Bit Protocol SenderReceiver msg0 ack0 msg1 ack1 msg0 ack0 msg1
26
26 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Alternating Bit Protocol SenderReceiver msg0 ack1 msg0 ack0
27
27 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Alternating Bit Protocol SenderReceiver msg0 ack0 msg1 ack1 msg0
28
28 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Sender Process active proctype Sender() { do :: if :: receiver?msg0; :: skip fi; do :: sender?ack0 -> break :: sender?ack1 :: timeout -> if :: receiver!msg0; :: skip fi; od; :: if :: receiver?msg1; :: skip fi; do :: sender?ack1 -> break :: sender?ack0 :: timeout -> if :: receiver!msg1; :: skip fi; od; }
29
29 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching15-398 Receiver Process active proctype Receiver() { do :: do :: receiver?msg0 -> sender!ack0; break; :: receiver?msg1 -> server!ack1 od do :: receiver?msg1 -> sender!ack1; break; :: receiver?msg0 -> server!ack0 od } mtype = { msg0, msg1, ack0, ack1 } chan sender = [1] of { mtype }; chan receiver = [1] of { mtype };
![29 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Receiver Process active proctype Receiver() { do :: do :: receiver msg0 -> sender!ack0; break; :: receiver msg1 -> server!ack1 od do :: receiver msg1 -> sender!ack1; break; :: receiver msg0 -> server!ack0 od } mtype = { msg0, msg1, ack0, ack1 } chan sender = [1] of { mtype }; chan receiver = [1] of { mtype };](http://images.slideplayer.com/8/2326528/slides/slide_29.jpg "29 Carnegie Mellon UniversitySPIN ExamplesFlavio Lerda Bug Catching Receiver Process active proctype Receiver() { do :: do :: receiver msg0 -> sender!ack0; break; :: receiver msg1 -> server!ack1 od do :: receiver msg1 -> sender!ack1; break; :: receiver msg0 -> server!ack0 od } mtype = { msg0, msg1, ack0, ack1 } chan sender = [1] of { mtype }; chan receiver = [1] of { mtype };")
Similar presentations
