Lecture 3 SPIN and Promela

Size: px

Start display at page:

Download "Lecture 3 SPIN and Promela"

Julie Dorsey
6 years ago
Views:

1 Lecture 3 SPIN and Promela 1

2 What is SPIN(Simple Promela INterpreter) A tool for analyzing mels of concurrent systems Mels described in Promela Language with concurrent processes Communication via shared variables and channels Analysis by Simulation Mel checking Several optimizations implemented most efficient tool for explicit-state mel checking 2

3 Material About SPIN SPIN Home page Contains manuals, reference material, and tutorial Books about SPIN and its use G.J. Holzmann SPIN MODEL CHECKER Primer and Reference Manual, G.J. Holzmann Design and Validation of Computer Protocols,, Prentice Hall 1991, older book, available on the Internet M. Ben-Ari Principles of Concurrent and Distributed Programming Tutorials, etc. linked from SPIN Home page 3

4 Elements of Promela Language for defining finite-state transition systems Data types with precisely defined finite mains Bits, integers, arrays, messages Processes, which can be dynamically created Communication via global variables or communication channels Simple control constructs 4

5 Transition System Semantics of Promela Each Promela mel defines a transition system State consists of Valuation of global variables and communication channels Local state of each created process Transitions defined by Statements in the bies of processes Each process denotes an action system or process automaton 5

6 Transition System Semantics: Illustration bool y1, y2; int t; active proctype P1() { l0: y1 = 1; l1: t = 2; l2: (y2 == 0 t == 1); l3: y1 = 0 ; goto l0 active proctype P2() { m0: y2 = 1; m1: t = 1; m2: (y1 == 0 t == 2); m3: y2 = 0 ; goto m0 6

7 Transition System Semantics: Illustration bool y1, y2; int t; active proctype P1() { l0: y1 = 1; l1: t = 2; l2: (y2 == 0 t == 1); l3: y1 = 0 ; goto l0 active proctype P2() { m0: y2 = 1; m1: t = 1; m2: (y1 == 0 t == 2); m3: y2 = 0 ; goto m0 P1: l0 y1 = 0 l3 y1 = 1 l1 t = 2 (y2==0 t==1) l2 7

8 Transition System Semantics: Illustration bool y1, y2; int t; active proctype P1() { l0: y1 = 1; l1: t = 2; l2: (y2 == 0 t == 1); l3: y1 = 0 ; goto l0 active proctype P2() { m0: y2 = 1; m1: t = 1; m2: (y1 == 0 t == 2); m3: y2 = 0 ; goto m0 P1: l0 y1 = 0 l3 P2: y2 = 0 m0 m3 y1 = 1 l1 t = 2 (y2==0 t==1) l2 y2 = 1 m1 t = 1 (y1==0 t==2) m2 8

9 Typical Structure of Promela Mel In its basic form, Promela mel consists of type declarations channel declarations variable declarations process declarations init process mtype = {msg, ack; chan tos =... chan tor =... bool flag; proctype Sender () {... proctype Receiver () {... init {... 9

10 Basic Variables and Types Basic types Array declaration Array access bit [0.. 1] bool [0.. 1] byte [ ] short [ ] int [ ] byte anarray[24]; anarray[v] = anarray[3]; Records type definition Record declaration Record access typedef Msg{ byte a[3], b; chan p Msg astruct astruct.a[1] Enumeration type f. messages mtype = {ack, nak, err, next 10

11 Expressions Operators + - * / % ^ > >= < <= ==!=! && & - >> << Conditional expression (v >= 0 -> v : -v) Operations on channel identifers len(qid) empty(qid) nempty(qid) full(qid) nfull(qid) 11

12 Basic Statements Expressions Assignments No-Op (y == false x > 9) y = 34 % 3 anarray[0] = anarray[3] * anarray[(v+2)/4] skip Goto Print (only in simulation) goto label printf All basic statements are either executable (enabled) or blocked (disabled) (of course, depending on values of variables, etc.) Expressions are also statements THIS IS IMPORTANT Blocked if evaluated to 0, otherwise executable In this way, expressions/statements can be used as guards 12

13 Compound Statements Sequential composition Selection test == 1 ; state = state + 1 test == 1 -> state = state + 1 if :: (a == b) -> state = state + 1 :: (a!= b) -> state = state 1 fi equivalent if :: (a == b) -> state = state + 1 :: else -> state = state 1 fi Selection can be nonderministic if :: input? offhook :: (a == b) -> b = 3 ; goto onhook :: output! wakeup :: b = 3 /*any statement can be guard*/ fi 13

14 Compound Statements (ctd.) Repetition :: (m > n) -> m = m - n :: (m < n) -> n = n m :: (m == n) -> break ; printf ( GCD = %d\n, m) Note ; (semicolon) is a statement separator (not a statement terminator as in C) E.g., no need to have ; after clauses in - statements (but es not harm either) 14

15 Processes and process types Name Local variable declarations proctype Sender(chan in; chan out) { bit sndb, rcvb; formal parameters :: out! data(sndb) -> in? ack(rcvb); if :: sndb == rcvb > sndb = 1-sndB :: else -> skip fi Process types defined by proctype definitions A process type may be instantiated (to a process) several times Each process has its local state (pc, local variables) Processes execute concurrently, by interleaving 15

16 Process instantiations Processes are created by run statement/expression run returns process id proctype Foo(byte x) {... Processes execute their first statement some time after creation init { int pid = run Foo(2); run Foo(27) Alternative mechanism: Processes can be statically created at initialization time (no formal parameters allowed) active[3] proctype Bar(){... 16

17 Communication Channels Channels used for passing messages Asynchronous (buffered, default is FIFO) Synchronous (rendez-vous) chan qid = [4] of {mtype, int, byte chan synch[3] = [0] of {mtype, int name capacity types of messages Sending Receiving qid! var1, const, var qid! err(const, var) qid? err(const, var) matched assigned Non-mifying receive qid? [err, const, var] Sorted send/receive (inserts lexicographically, receives any element) qid!! err(const, var) qid?? err(const, var) 17

18 Communication Channels (ctd.) Declaring synchronous (rendez-vous) channel w. capacity 0 chan synch[3] = [0] of {mtype, int 18

19 Peterson-Fischer Mutual Exclusion #define true 1 #define false 0 #define turn1 false #define turn2 true bool y1, y2, t; byte mutex = 0; proctype P2() { m1: y2 = true; m2: t = turn1; m3: (y1 == false t == turn2) ; m4: /* critical section */ y2 = false ; goto m1 proctype P1() { l1: y1 = true; l2: t = turn2; l3: (y2 == false t == turn1) ; l4: /* critical section */ y1 = false ; goto l1 init { atomic { run P1() ; run P2() 19

20 Peterson-Fischer Mutual Exclusion #define true 1 #define false 0 #define turn1 false #define turn2 true bool y1, y2, t; byte mutex = 0; proctype P1() { l1: y1 = true; l2: t = turn2; l3: (y2 == false t == turn1) ; mutex++ ; assert (mutex <= 1) ; l4: /* critical section */ mutex -- ; y1 = false ; goto l1 proctype P2() { m1: y2 = true; m2: t = turn1; m3: (y1 == false t == turn2) ; mutex++ ; assert (mutex <= 1) ; m4: /* critical section */ mutex-- ; y2 = false ; goto m1 init { atomic { run P1() ; run P2() 20

21 Checking by monitor #define true 1 #define false 0 #define turn1 false #define turn2 true bool y1, y2, t; byte mutex = 0; proctype P1() { l1: y1 = true; l2: t = turn2; l3: (y2 == false t == turn1) ; mutex++ ; l4: /* critical section */ mutex -- ; atomic{ y1 = false ; goto l1 proctype P2() { m1: y2 = true; m2: t = turn1; m3: (y1 == false t == turn2) ; mutex++ ; m4: /* critical section */ mutex-- ; atomic{ y2 = false ; goto m1 active proctype monitor() { assert (mutex <= 1) init { atomic { run P1() ; run P2() 21

22 Checking deadlocks #define true 1 #define false 0 #define turn1 false #define turn2 true bool y1, y2, t; byte mutex = 0; proctype P1() { l1: y1 = true; l2: skip ; l3: (y2 == false) ; mutex++ ; l4: /* critical section */ mutex -- ; y1 = false ; goto l1 proctype P2() { m1: y2 = true; m2: skip ; m3: (y1 == false) ; mutex++ ; m4: /* critical section */ mutex-- ; y2 = false ; goto m1 active proctype monitor() { assert (mutex <= 1) init { atomic { run P1() ; run P2() 22

23 Problem with Atomicity Only basic statements are atomic Q: What is the final value of state? byte state = 1; proctype A() { state == 1 -> state++ proctype B() { state == 1 -> state-- init { run A() ; run B() 23

24 Solution: atomic-construct A process whose control is inside atomic{ executes without being interrupted by other processes NOTE: Make sure that such a sequence cannot be blocked inside (after the first statement). In that case, Promela will suspend the process, and you get unintended semantics. byte state = 1; proctype A() { atomic { state == 1 -> state++ proctype B() { atomic { state == 1 -> state-- init { atomic {run A() ; run B() 24

25 Other use of atomic{ To group complex manipulation into single transition If the manipulation is deterministic and always exits at the end, d_step { is more efficient d_step denotes a single transition atomic denotes a sequence of transitions with interrupt disabled atomic { cnt = 0 ; :: (cnt < Max) -> z[cnt] = 3; cnt++ :: (cnt >= Max) -> break d_step { cnt = 0 ; :: (cnt < Max) -> z[cnt] = 3; cnt++ :: (cnt >= Max) -> break 25

26 Else and Timeout else is enabled if no other statement in the same process is enabled :: (m > n) -> m = m - n :: (m < n) -> n = n m :: else -> break ; printf ( GCD = %d\n, m) timeout is enabled if no other statement in the entire Promela mel is enabled skip is best to use if we want to be sure to analyze the effect of possibly premature timeout. :: input? offhook :: input? ringing :: timeout -> output! wakeup Od :: input? offhook :: input? ringing :: skip -> output! wakeup 26

27 Useful Macros IF without else branch #define IF if :: #define FI :: else fi Allows to write IF b -> x++ FI FOR loop #define FOR(i,l,h) i = l ; :: i < h -> #define ROF(i,l,h) ;i++ :: i >= h -> break Allows to write FOR(i,0,N) run proc(i) ROF(i,0,N) which means i = 0 ; :: i < N -> run proc(i) :: i >= N -> break 27

28 New Language Constructs (V6, 2010) For loops Several variants for (i : 1.. 9) { run proc(i) int a[10]; for (i in a) { printf( a[%d] = %d\n, i, a[i]) Selection (nondeterministic) int i; select (i : 1..10); printf( %d\n, i); Parser translates them to basic Promela 28

29 Message Transmission Protocol mtype = { m0, m1, ack proctype Sender{ Send0: :: skip -> /* timeout */ StoR!m0 :: RtoS?ack -> /* rec ack */ SoR!m1; goto Send1 ; Send1: :: skip -> /* timeout */ StoR!m1 :: RtoS?ack -> /* rec ack */ StoR!m0; goto Send0 proctype Receiver{ Rec0: :: StoR?any -> skip /* loss */ :: StoR?m0 -> RtoS!ack; goto Rec1 Rec1: :: StoR?any -> skip /* loss */ :: StoR?m1 -> RtoS!ack; goto Rec0 init { chan StoR = [1] of { mtype ; chan RtoS = [1] of { mtype ; atomic { StoR!m0; /* start */ run Sender; run Receiver 29

30 Alternating Bit Protocol (version 1) mtype = { msg, ack ; chan s_r = [2] of {mtype, byte, bit; chan r_s = [2] of {mtype, bit ; active proctype Sender() { byte data = 0; bit sbit, seqno = 0; :: s_r! msg(data, sbit) -> r_s? ack(seqno); if :: seqno == sbit -> sbit = 1 sbit; data++ :: else fi active proctype Receiver() { byte recd ; bit rbit, seqno = 0; :: s_r? msg (recd, seqno) -> r_s! ack(seqno); if :: seqno == rbit -> rbit = 1 rbit :: else fi 30

31 Alternating Bit Protocol (version 1 altern) mtype = { msg, ack ; chan s_r = [2] of {mtype, byte, bit; chan r_s = [2] of {mtype, bit ; proctype Sender() { byte data = 0; bit sbit, seqno = 0; :: s_r! msg(data, sbit) -> r_s? ack(seqno); if :: seqno == sbit -> sbit = 1 sbit; data++ :: else fi proctype Receiver() { byte recd ; bit rbit, seqno = 0; :: s_r? msg (recd, seqno) -> r_s! ack(seqno); if :: seqno == rbit -> rbit = 1 rbit :: else fi init { atomic { run Sender(); run Receiver() 31

32 AB Protocol (version 2, with losses ) mtype = { msg, ack ; chan s_r = [2] of {mtype, byte, bit; chan r_s = [2] of {mtype, bit ; active proctype Sender() { byte data = 0; bit sbit, seqno = 0; :: s_r! msg(data, sbit) -> r_s? ack(seqno); if :: seqno == sbit -> sbit = 1 - sbit ; data++ :: else fi :: (1) -> skip active proctype Receiver() { byte recd ; bit rbit, seqno = 0; :: s_r? msg (recd, seqno) -> if :: r_s! ack(seqno) :: skip fi; if :: seqno == rbit -> rbit = 1 - rbit :: else fi 32

33 AB Protocol (version 3, w. retransmission) mtype = { msg, ack ; chan s_r = [2] of {mtype, byte, bit; chan r_s = [2] of {mtype, bit ; active proctype Sender() { byte data = 0; bit sbit, seqno = 0; :: s_r! msg(data, sbit) :: (1) -> skip :: r_s? ack(seqno); if :: seqno == sbit -> sbit = 1 - sbit ; data++ :: else fi active proctype Receiver() { byte recd, expected = 0; bit rbit = 1, seqno; :: s_r? msg (recd, seqno) -> if :: seqno!= rbit -> rbit = 1 - rbit ; assert(recd == expected) ; expected++ :: else fi :: r_s! ack (rbit) :: (1) -> skip 33

34 AB Protocol (version 4, w. checks) mtype = { msg, ack ; chan s_r = [2] of {mtype, byte, bit; chan r_s = [2] of {mtype, bit ; active proctype Sender() { byte data = 0; bit sbit, seqno = 0; :: data < 10 -> s_r! msg(data, sbit) :: (1) -> skip :: r_s? ack(seqno); if :: seqno == sbit -> sbit = 1 - sbit ; data++ :: else fi active proctype Receiver() { byte recd, expected = 0; bit rbit = 1, seqno; :: s_r? msg (recd, seqno) -> if :: seqno!= rbit -> rbit = 1 - rbit ; assert(recd == expected); expected++ :: else fi :: r_s! ack (rbit) :: (1) -> skip 34

What is SPIN(Simple Promela Interpreter) Elements of Promela. Material About SPIN. Basic Variables and Types. Typical Structure of Promela Model

What is SPIN(Simple Promela Interpreter) Lecture XX SPIN and Promela A tool for analyzing mels of reactive systems Mels described in Promela Language with concurrent processes, Communication via channels,