See this document in CiteSeerX!

Semantics Of Semaphores (1998)  (Make Corrections)  
Stefan Rönn



  Home/Search   Context   Related

 
View or download:
tcs.hut.fi/Publicat...HUTTCSA53.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  tcs.hut.fi/Publications/bibdb/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We present a formal definition of semaphores using weakest preconditions. With the definition we prove the mutual exclusion algorithm and show that the semaphore axioms given by Martin and de Snepscheut are implied by the invariant relation of the proof. We further demonstrate how a general k-semaphore can be realised with the help of a split binary semaphore. To this end, we introduce a program construct that facilitates the usage of the split binary semaphore. (Update)

Active bibliography (related documents):   More   All
0.0:   On the Search for Tractable Ways of Reasoning about Programs - Jones (2001)   (Correct)
0.0:   The Early Search for Tractable Ways of Reasoning About Programs - Jones (2003)   (Correct)
0.0:   Formal Methods - Selected Historical References - Jones, McCauley (1992)   (Correct)

Similar documents based on text:   More   All
0.1:   GPRS performance estimation in GSM circuit switched services.. - Ni, Häggman (2003)   (Correct)
0.1:   Outage Probability in GSM-GPRS Cellular Systems with and.. - Ni, Liang, Häggman   (Correct)
0.1:   On the Stubborn Set Method in Reduced State Space Generation - Varpaaniemi (1998)   (Correct)

BibTeX entry:   (Update)

@misc{ ronn98semantics,
  author = "Stefan R{\"o}nn",
  title = "Semantics Of Semaphores",
  year = "1998",
  url = "citeseer.ist.psu.edu/664229.html" }
Citations (may not include all citations):
239   Monitors: an operating system structuring concept (context) - Hoare - 1974
210   Co-operating sequential processes (context) - Dijkstra - 1968
208   An axiomatic proof technique for parallel programs (context) - Owicki, Gries - 1976
1   Design of synchronisation algorithms (context) - Martin, Snepscheut - 1989

Documents on the same site (http://www.tcs.hut.fi/Publications/bibdb/):   More
A Reachability Analyser for Algebraic System Nets - Mäkelä (2001)   (Correct)
Sets In Abelian Groups With Distinct Sums Of Pairs - Haanpää, Östergård (2004)   (Correct)
Detecting And Exploiting Data Type Symmetries Of Algebraic.. - Junttila (1999)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC