Filters








4,680 Hits in 2.8 sec

Deadlock-Free Channels and Locks [chapter]

K. Rustan M. Leino, Peter Müller, Jan Smans
2010 Lecture Notes in Computer Science  
This paper proposes a modular verification technique that prevents deadlocks in programs that use both message passing and locking.  ...  In Sec. 2 and 3, we extend Chalice with channels and show how deadlock can be avoided. The formal details of the verification technique together with a soundness proof are then given in Sec. 4 and 5.  ...  We would like to thank Bart Jacobs and the anonymous referees for useful comments and feedback.  ... 
doi:10.1007/978-3-642-11957-6_22 fatcat:g2dvqems6bgqlijd7yi272pvzm

What Is a 'Good' Encoding of Guarded Choice?

Uwe Nestmann
1997 BRICS Report Series  
to compositionality and divergence-freedom.  ...  <br />In detail, we present a series of encodings for languages with (1) input-guarded choice, (2) both input- and output-guarded choice, and (3) mixed-guarded choice, and investigate them with respect  ...  The randomized encoding is deadlock-free due to the ever present possibility of backing out, when a second-phase lock is not available: all receivers on the state channel-both lock-checkers and the randomizer-have  ... 
doi:10.7146/brics.v4i45.19266 fatcat:ft4tknmnenfczpy6wvorru2r7e

A hybrid type system for lock-freedom of mobile processes

Naoki Kobayashi, Davide Sangiorgi
2010 ACM Transactions on Programming Languages and Systems  
lock-free afterwards".  ...  Very approximately, our hybrid rule for local reasoning looks as follows: where |= DF P and |= Ter P indicate, respectively, that P is deadlock-free and terminating, and ∆ ⊢ LT P is a typing judgment for  ...  Acknowledgment We would like to thank Eijiro Sumii for discussions on this work, and Luca Aceto, Xavier Leroy, and Benjamin Pierce for pointers to relevant work.  ... 
doi:10.1145/1745312.1745313 fatcat:644i2tgwb5elfjgiokjh6j67hm

What is a 'Good' Encoding of Guarded Choice?

Uwe Nestmann
1997 Electronical Notes in Theoretical Computer Science  
and divergence-freedom.  ...  The -calculus with synchronous output and mixed-guarded choices is strictly more expressive than the -calculus with asynchronous output and no choice.  ...  Acknowledgement The author would like to thank C edric Fournet, Kohei Honda, Naoki Kobayashi, Catuscia Palamidessi, Benjamin Pierce, Davide Sangiorgi, Martin Ste en, and Nobuko Yoshida for many fruitful  ... 
doi:10.1016/s1571-0661(05)80474-8 fatcat:toc36ecepnh2znenleb73aj2te

An Expressive Framework for Verifying Deadlock Freedom [chapter]

Duy-Khanh Le, Wei-Ngan Chin, Yong-Meng Teo
2013 Lecture Notes in Computer Science  
By combining our technique with locklevels, we form a unified formalism for ensuring deadlock freedom from (1) double lock acquisition, (2) interactions between thread and lock operations, and (3) unordered  ...  We introduce a novel delayed lockset checking technique to guarantee deadlock freedom of programs with interactions between thread and lock operations.  ...  We thank Peter Müller for his insightful discussions about Chalice, and the anonymous reviewers for comments. This work is supported by MOE Project 2009-T2-1-063.  ... 
doi:10.1007/978-3-319-02444-8_21 fatcat:e7dxh2jhubbn3imnldqwokbley

What is a 'Good' Encoding of Guarded Choice?

Uwe Nestmann
1999 BRICS Report Series  
to compositionality and divergence-freedom.  ...  <br /> In detail, we present a series of encodings for languages with (1) input-guarded choice, (2) both input- and output-guarded choice, and (3) mixed-guarded choice, and investigate them with respect  ...  discussions, and the anonymous referees for their constructive remarks.  ... 
doi:10.7146/brics.v6i43.20113 fatcat:zdh72ucvkbabllrkhmvrd7lrzu

Deadlock-Free Monitors [chapter]

Jafar Hamin, Bart Jacobs
2018 Lecture Notes in Computer Science  
as channels and semaphores, enabling them to accept a wider range of deadlock-free programs.  ...  use cases of monitors including unbounded/bounded buffer, sleeping barber, barrier, and readers-writers locks.  ...  Aleksandar Nanevski for their careful reading of our manuscript and their many insightful comments and suggestions.  ... 
doi:10.1007/978-3-319-89884-1_15 fatcat:ejd4rhw4pjbvrnvtj4qy7tyy5i

What is a "Good" Encoding of Guarded Choice?

Uwe Nestmann
2000 Information and Computation  
The randomized encoding is deadlock-free, due to the ever present possibility of backing out, when a second-phase lock is not available; all receivers on the state channel both lock-checkers and the randomizer  ...  Such implementations are not uniform (see Appendix A), but deadlock-and divergence-free.  ... 
doi:10.1006/inco.1999.2822 fatcat:hldwafyoarbcxd3abh5otm2iui

Modeling real-time database concurrency control protocol two-phase-locking in Uppaal

Martin Kot
2008 International Multiconference on Computer Science and Information Technology  
Model checking algorithms and verification tools are of great concern as well.  ...  So the formula E<> deadlock means that deadlock is reachable in the model and this property is not satisfied. Hence it is verified that the system is deadlock-free. V.  ...  There are three locations corresponding to two types of locks and to an unlocked state. Channels rd_ch[x] and wrt_ch[x] are used for requests for read and write locks on record x.  ... 
doi:10.1109/imcsit.2008.4747315 dblp:conf/imcsit/Kot08 fatcat:bl5j4eqp3va5hb33ft2ak7ornm

Unlocking Blocked Communicating Processes

Adrian Francalanza, Marco Giunti, António Ravara
2015 Electronic Proceedings in Theoretical Computer Science  
We identify and characterise a class of processes that is not lock-free; then we formalise an algorithm that statically detects potential locks and propose refactoring procedures that disentangle detected  ...  locks.  ...  Note that both refactorings preserve channel linearity (a safety criteria) while returning lock-free processes.  ... 
doi:10.4204/eptcs.188.4 fatcat:lbzdsahdezhf7mqgqdlxjys5q4

The turn model for adaptive routing

Christopher J. Glass, Lionel M. Ni
1992 Proceedings of the 19th annual international symposium on Computer architecture - ISCA '92  
We present a model for designing wormhole routing algorithms that are deadlock free, livelock free, minimaf or nonminimal, and maximally adaptive.  ...  Routing algorithms that route packets along the sets of channels identified in Step 1 and use only the turns from one set to an- other allowed by Steps 4, 5, and 6 are deadlock free, livelock free  ...  Routing algorithms that employ the remain- ing turns are deadlock free, livelock free, minimal or nonminimal, and maximally adaptive for the network.  ... 
doi:10.1145/139669.140384 dblp:conf/isca/GlassN92 fatcat:habm5axbfzg3ri7g5i4z3rkpbe

The turn model for adaptive routing

Christopher J. Glass, Lionel M. Ni
1992 SIGARCH Computer Architecture News  
We present a model for designing wormhole routing algorithms that are deadlock free, livelock free, minimaf or nonminimal, and maximally adaptive.  ...  Routing algorithms that route packets along the sets of channels identified in Step 1 and use only the turns from one set to an- other allowed by Steps 4, 5, and 6 are deadlock free, livelock free  ...  Routing algorithms that employ the remain- ing turns are deadlock free, livelock free, minimal or nonminimal, and maximally adaptive for the network.  ... 
doi:10.1145/146628.140384 fatcat:jo7t3lar3bcjpecetb6hm7wutu

The turn model for adaptive routing

Christopher J. Glass, Lionel M. Ni
1994 Journal of the ACM  
We present a model for designing wormhole routing algorithms that are deadlock free, livelock free, minimaf or nonminimal, and maximally adaptive.  ...  Routing algorithms that route packets along the sets of channels identified in Step 1 and use only the turns from one set to an- other allowed by Steps 4, 5, and 6 are deadlock free, livelock free  ...  Routing algorithms that employ the remain- ing turns are deadlock free, livelock free, minimal or nonminimal, and maximally adaptive for the network.  ... 
doi:10.1145/185675.185682 fatcat:hrw7lwnvjbgnvkuqeafutpx3oe

The turn model for adaptive routing

Christopher J. Glass, Lionel M. Ni
1998 25 years of the international symposia on Computer architecture (selected papers) - ISCA '98  
We present a model for designing wormhole routing algorithms that are deadlock free, livelock free, minimaf or nonminimal, and maximally adaptive.  ...  Routing algorithms that route packets along the sets of channels identified in Step 1 and use only the turns from one set to an- other allowed by Steps 4, 5, and 6 are deadlock free, livelock free  ...  Routing algorithms that employ the remain- ing turns are deadlock free, livelock free, minimal or nonminimal, and maximally adaptive for the network.  ... 
doi:10.1145/285930.286003 dblp:conf/isca/GlassN98 fatcat:sgszfxgu5zho3m2yfu47t3meba

Deadlock and lock freedom in the linear π-calculus

Luca Padovani
2014 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS '14  
We study two refinements of the linear π-calculus that ensure deadlock freedom (the absence of stable states with pending linear communications) and lock freedom (the eventual completion of pending linear  ...  The main feature of both type systems is a new form of channel polymorphism that affects their accuracy in a significant way: they are the first of their kind that can deal with recursive processes communicating  ...  1984 and (νa)a?(x).P are deadlocks, whereas (νa) * a?(x).P is lock free.  ... 
doi:10.1145/2603088.2603116 dblp:conf/csl/Padovani14 fatcat:o3fy2tvbxzeghddxe2zankfmxu
« Previous Showing results 1 — 15 out of 4,680 results