### Abstract

Original language | Undefined |
---|---|

Title of host publication | Proceedings of the Fifth International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS 2016) |

Editors | C Artho, P.C. Ölveczky |

Place of Publication | London |

Publisher | Springer Verlag |

Pages | 3-19 |

Number of pages | 16 |

ISBN (Print) | 978-3-319-53946-1 |

DOIs | |

State | Published - Nov 2016 |

### Publication series

Name | Communications in Computer and Information Science |
---|---|

Publisher | Springer Verlag |

Volume | 694 |

ISSN (Print) | 1865-0929 |

### Fingerprint

### Keywords

- EWI-27668

### Cite this

*Proceedings of the Fifth International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS 2016)*(pp. 3-19). (Communications in Computer and Information Science; Vol. 694). London: Springer Verlag. DOI: 10.1007/978-3-319-53946-1_1

}

*Proceedings of the Fifth International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS 2016).*Communications in Computer and Information Science, vol. 694, Springer Verlag, London, pp. 3-19. DOI: 10.1007/978-3-319-53946-1_1

**Specification and Verification of Synchronization with Condition Variables.** / Gomes, P.; Gurov, D.; Huisman, Marieke.

Research output: Scientific - peer-review › Conference contribution

TY - CHAP

T1 - Specification and Verification of Synchronization with Condition Variables.

AU - Gomes,P.

AU - Gurov,D.

AU - Huisman,Marieke

PY - 2016/11

Y1 - 2016/11

N2 - In this paper we propose a technique to specify and verify the correct synchronization of concurrent programs with condition variables. We define correctness as the liveness property: “every thread synchronizing under a set of condition variables eventually exits the synchronization‿, under the assumption that every such thread eventually reaches its synchronization block. Our technique does not avoid the combinatorial explosion of interleavings of thread behaviors. In- stead, we alleviate it by abstracting away all details that are irrelevant to the synchronization behavior of the program, which is typically significantly smaller than its overall behavior. First, we introduce SyncTask, a simple imperative language to specify parallel computations that synchronize via condition vari- ables. We consider a SyncTask program to have a correct synchronization iff it terminates. Further, to relieve the programmer from the burden of providing specifications in SyncTask, we introduce an economic annotation scheme for Java programs to assist the automated extraction of SyncTask programs capturing the synchronization behavior of the underlying program. We prove that every Java program annotated according to the scheme (and satisfying the assumption) has a correct synchronization iff its corresponding SyncTask program terminates. We show how to transform the verification of termination into a standard reachabil- ity problem over Colored Petri Nets that is efficiently solvable by existing Petri Net analysis tools. Both the SyncTask program extraction and the generation of Petri Nets are implemented in our STaVe tool. We evaluate the proposed framework on a number of test cases as a proof-of-concept.

AB - In this paper we propose a technique to specify and verify the correct synchronization of concurrent programs with condition variables. We define correctness as the liveness property: “every thread synchronizing under a set of condition variables eventually exits the synchronization‿, under the assumption that every such thread eventually reaches its synchronization block. Our technique does not avoid the combinatorial explosion of interleavings of thread behaviors. In- stead, we alleviate it by abstracting away all details that are irrelevant to the synchronization behavior of the program, which is typically significantly smaller than its overall behavior. First, we introduce SyncTask, a simple imperative language to specify parallel computations that synchronize via condition vari- ables. We consider a SyncTask program to have a correct synchronization iff it terminates. Further, to relieve the programmer from the burden of providing specifications in SyncTask, we introduce an economic annotation scheme for Java programs to assist the automated extraction of SyncTask programs capturing the synchronization behavior of the underlying program. We prove that every Java program annotated according to the scheme (and satisfying the assumption) has a correct synchronization iff its corresponding SyncTask program terminates. We show how to transform the verification of termination into a standard reachabil- ity problem over Colored Petri Nets that is efficiently solvable by existing Petri Net analysis tools. Both the SyncTask program extraction and the generation of Petri Nets are implemented in our STaVe tool. We evaluate the proposed framework on a number of test cases as a proof-of-concept.

KW - EWI-27668

U2 - 10.1007/978-3-319-53946-1_1

DO - 10.1007/978-3-319-53946-1_1

M3 - Conference contribution

SN - 978-3-319-53946-1

T3 - Communications in Computer and Information Science

SP - 3

EP - 19

BT - Proceedings of the Fifth International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS 2016)

PB - Springer Verlag

ER -