![]() They are harder to avoid, prevent or even detect. Deadlocks in distributed systems are similar to deadlocks in single processor systems, only worse. Deadlock is a highly unfavourable situation, the deadlock problem becomes further complicated if the underlying system is distributed. Roscoe, A.W.: Understanding Concurrent Systems.Deadlock Prevention Algorithm in Grid Environmentĭepartment of Computer Science & IT & Central University of JammuĪbstract. In: Brinksma, E., Cleaveland, W.R., Larsen, K.G., Margaria, T., Steffen, B. Roscoe, A.W., Gardiner, P.H.B., Goldsmith, M.H., Hulance, J.R., Jackson, D.M., Scattergood, J.B.: Hierarchical compression for model-checking CSP or how to check 10 \(^\) dining philosophers for deadlock. Roscoe, A.W., Dathi, N.: The pursuit of deadlock freedom. Ouaknine, J., Palikareva, H., Roscoe, A.W., Worrell, J.: A static analysis framework for livelock freedom in CSP. In: Fitzgerald, J., Jones, C.B., Lucas, P. Martin, J.M.R., Jassim, S.A.: An efficient technique for deadlock analysis of large scale process networks. Martin, J.M.R.: The design and construction of deadlock-free concurrent systems. Lambertz, C., Majster-Cederbaum, M.: Analyzing component-based systems on the basis of architectural constraints. Hoare, C.A.R.: Communicating Sequential Processes. Godefroid, P., Wolper, P.: Using partial orders for the efficient verification of deadlock freedom and safety properties. In: Havelund, K., Holzmann, G., Joshi, R. Gibson-Robinson, T., Hansen, H., Roscoe, A.W., Wang, X.: Practical partial order reduction for CSP. Gibson-Robinson, T., Armstrong, P., Boulgakov, A., Roscoe, A.W.: FDR3 - a modern refinement checker for CSP. 399–404 (2009)īrookes, S.D., Roscoe, A.W.: Deadlock analysis in networks of communicating processes. In: IJCAI 2009, San Francisco, CA, USA, pp. ![]() Springer, Heidelberg (2005)Īudemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. Springer, Heidelberg (2013)Īttie, P.C., Chockler, H.: Efficiently verifiable conditions for deadlock-freedom of large concurrent programs. ![]() Springer, Switzerland (2014)Īttie, P.C., Bensalem, S., Bozga, M., Jaber, M., Sifakis, J., Zaraket, F.A.: An abstract framework for deadlock prevention in BIP. Īntonino, P., Sampaio, A., Woodcock, J.: A refinement based strategy for local deadlock analysis of networks of CSP processes. Technical report, University of Oxford (2015). Īntonino, P., Roscoe, A.W., Gibson-Robinson, T.: Efficient deadlock analysis using local analysis and SAT solving. Springer, Heidelberg (2014)Īntonino, P., Roscoe, A.W., Gibson-Robinson, T.: Experiment package (2015). This process is experimental and the keywords may be updated as the learning algorithm improves.Īntonino, P.R.G., Oliveira, M.M., Sampaio, A.C.A., Kristensen, K.E., Bryans, J.W.: Leadership election: an industrial SoS application of compositional deadlock verification. These keywords were added by machine and not by the authors. This is demonstrated by a series of practical experiments. Furthermore, we demonstrate how SAT checkers can be used to efficiently implement our framework in a way that, typically, scales better than current techniques for deadlock analysis. deadlock-free systems that have a deadlocking subsystem), which are neglected by most incomplete techniques, are tackled by our framework. ![]() This new characterisation represents an improvement in the accuracy of current incomplete techniques in particular, the so-called non-hereditary deadlock-free systems (i.e. Our new deadlock candidate criterion is based on constraints derived from the analysis of the state space of pairs of components. We build upon established techniques of deadlock analysis by formulating a new sound but incomplete framework for deadlock freedom analysis that tackles some sources of imprecision of current incomplete techniques. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |