5 Hits in 6.1 sec

Deadlock and starvation free reentrant readers–writers: A case study combining model checking with theorem proving

Bernard van Gastel, Leonard Lensink, Sjaak Smetsers, Marko van Eekelen
2011 Science of Computer Programming  
Combining model checking with theorem proving appeared to be very effective in reducing the time of the verification process.  ...  Using model checking we found a starvation problem. We have fixed the problem and checked the solution.  ...  Acknowledgements We want to thank the reviewers of this paper for their helpful advice and their constructive comments and corrections. They helped us to considerably improve our paper.  ... 
doi:10.1016/j.scico.2010.03.004 fatcat:b55ofhzrbvddfgfg5iorbq5omq

Reentrant Readers-Writers: A Case Study Combining Model Checking with Theorem Proving [chapter]

Bernard van Gastel, Leonard Lensink, Sjaak Smetsers, Marko van Eekelen
2009 Lecture Notes in Computer Science  
We considered an existing widely used industrial implementation of the reentrant readers-writers problem. We modeled it using a model checker revealing a serious error: a possible deadlock situation.  ...  The classic readers-writers problem has been extensively studied. This holds to a lesser degree for the reentrant version, where it is allowed to nest locking actions.  ...  Acknowledgements We would like to thank both Erik Poll and the anonymous referees of an earlier version of this paper for their useful comments improving the presentation of this work.  ... 
doi:10.1007/978-3-642-03240-0_10 fatcat:p65uzaiuhzbntg4npjl5n7sq2a

A Proof Framework for Concurrent Programs [chapter]

Leonard Lensink, Sjaak Smetsers, Marko van Eekelen
2012 Lecture Notes in Computer Science  
The bakery algorithm is used as a demonstration of the framework basics, while the (full) framework with thread synchronization was used to verify and correct the reentrant readers writers algorithm as  ...  The approach is geared towards verification of models that have an unbounded state size and are as close to the original code as possible.  ...  In [13] a case study is presented that combines two formal verification methods, namely model checking and theorem proving.  ... 
doi:10.1007/978-3-642-30729-4_13 fatcat:rvjzk3izxfe25ixexbhgnugxvi

Concurrent Computing in the Many-core Era (Dagstuhl Seminar 15021)

Michael Philippsen, Pascal Felber, Michael L. Scott, J. Eliot B. Moss, Marc Herbstritt
2015 Dagstuhl Reports  
This seminar is a successor to Dagstuhl Seminars 08241 "Transactional memory: From implementation to application" and 12161 "Abstractions for scalable multicore computing", respectively held in June 2008  ...  and in April 2012.  ...  Boundary movement is done with a reader/writer lock. Better scalability than previous methods. If removeMin not as common, scalability can suffer, apparently because of RW lock.  ... 
doi:10.4230/dagrep.5.1.1 dblp:journals/dagstuhl-reports/PhilippsenFSM15 fatcat:owcmta65hzb5vmglwq3dwzbehy

Multiprocessor Scheduling [chapter]

Scheduling in Real-Time Systems  
The synchronization and communications are based on reader/writer paradigm or message queues.  ...  The primary objective of this book is to serve as a text book with exercises and answers, and also some useful case studies.  ...  The access to the 'blackboard' is supposed to be atomic (or at least mutually exclusive, or best, according to a reader-writer synchronization pattern).  ... 
doi:10.1002/0470856343.ch5 fatcat:k3tgfcw72nbxbpelowpcqozonm