Deadlock and starvation free reentrant readers-writers: a case study combining model checking with theorem proving (Q617922)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Deadlock and starvation free reentrant readers-writers: a case study combining model checking with theorem proving |
scientific article; zbMATH DE number 5836583
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deadlock and starvation free reentrant readers-writers: a case study combining model checking with theorem proving |
scientific article; zbMATH DE number 5836583 |
Statements
Deadlock and starvation free reentrant readers-writers: a case study combining model checking with theorem proving (English)
0 references
14 January 2011
0 references
model checking
0 references
theorem proving
0 references
readers-writers algorithm
0 references
spin
0 references
PVS
0 references
concurrent software
0 references
0 references
