{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T11:13:28Z","timestamp":1790680408724,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540648963","type":"print"},{"value":"9783540684558","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055632","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T07:31:00Z","timestamp":1153985460000},"page":"332-347","source":"Crossref","is-referenced-by-count":29,"title":["Detecting deadlocks in concurrent systems"],"prefix":"10.1007","author":[{"given":"Lisbeth","family":"Fajstrup","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eric","family":"Goubault","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Rau\u00dfen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"issue":"11","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/32.106975","volume":"17","author":"G. S. Avrunin","year":"1991","unstructured":"G. S. Avrunin, U. A. Buy, J. C. Corbett, L. K. Dillon, and J. C. Wileden. Automated analysis of concurrent systems with the constrained expression toolset. IEEE Trans. Soft. Eng., 17(11):1204\u20131222, November 1991.","journal-title":"IEEE Trans. Soft. Eng."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. In Proc. of the Fifth Annual IEEE Symposium on Logic and Computer Science, pages 428\u2013439. IEEE Press, 1990.","DOI":"10.1109\/LICS.1990.113767"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"B. Boigelot and P. Godefroid. Model checking in practice: An analysis of the access.bus protocol using spin. In Proceedings of Formal Methods Europe'96, volume 1051, pages 465\u2013478. Springer-Verlag, Lecture Notes in Computer Science, March 1996.","DOI":"10.1007\/3-540-60973-3_102"},{"key":"21_CR4","first-page":"238","volume":"4","author":"P. Cousot","year":"1977","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixed points. Principles of Programming Languages 4, pages 238\u2013252, 1977.","journal-title":"Principles of Programming Languages"},{"issue":"4","key":"21_CR5","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 2(4):511\u2013547, August 1992.","journal-title":"Journal of Logic and Computation"},{"key":"21_CR6","unstructured":"A. T. Chamillard, L. A. Clarke, and G. S. Avrunin. An empirical comparison of static concurrency analysis techniques. Technical Report 96-84, Department of Computer Science, University of Massachusetts, August 1996."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"J. C. Corbett. Evaluating deadlock detection methods for concurrent software. IEEE Transactions on Software Engineering, 22(3), March 1996.","DOI":"10.1109\/32.489078"},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/9758.9759","volume":"9","author":"S.D. Carson","year":"1987","unstructured":"S.D. Carson and P.F. Reynolds. The geometry of semaphore programs. ACM TOPLAS, 9(1):25\u201353, 1987.","journal-title":"ACM TOPLAS"},{"key":"21_CR9","volume-title":"Semantic analysis of shared-memory concurrent languages using abstract model-checking","author":"R. Cridlig","year":"1995","unstructured":"R. Cridlig. Semantic analysis of shared-memory concurrent languages using abstract model-checking. In Proc. of PEPM'95, La Jolla, June 1995. ACM Press."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"M. B. Dwyer and L. A. Clarke. Data flow analysis for verifying properties of concurrent programs. In Proc. of the Second Symposium on Foundations of Software Engineering, pages 62\u201375, December 1994.","DOI":"10.1145\/193173.195295"},{"key":"21_CR11","first-page":"43","volume-title":"Programming Languages","author":"E.W. Dijkstra","year":"1968","unstructured":"E.W. Dijkstra. Co-operating sequential processes. In F. Genuys, editor, Programming Languages, pages 43\u2013110. Academic Press, New York, 1968."},{"key":"21_CR12","unstructured":"L. Fajstrup and M. Rau\u00dfen. Some remarks concerning monotopy of increasing paths. unpublished manuscript, Aalborg University, 1996."},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"P. Godefroid, G. J. Holzmann, and D. Pirottin. State-space caching revisited. In Formal Methods and System Design, volume 7, pages 1\u201315. Kluwer Academic Publishers, November 1995.","DOI":"10.1007\/BF01384077"},{"key":"21_CR14","volume-title":"Homology of higher-dimensional automata","author":"E. Goubault","year":"1992","unstructured":"E. Goubault and T. P. Jensen. Homology of higher-dimensional automata. In Proc. of CONCUR'92, Stonybrook, New York, August 1992. Springer-Verlag."},{"key":"21_CR15","unstructured":"H. Garavel, M. Jorgensen, R. Mateescu, Ch. Pecheur, M. Sighireanu, and B. Vivien. Cadp'97 \u2014 status, applications and perspectives. Technical report, Inria Alpes, 1997."},{"key":"21_CR16","unstructured":"E. Goubault. The Geometry of Concurrency. PhD thesis, Ecole Normale Sup\u00e9rieure, 1995. to be published, 1998, also available at http:\/\/www.dmi.ens.fr\/~goubault."},{"key":"21_CR17","volume-title":"Schedulers as abstract interpretations of HDA","author":"E. Goubault","year":"1995","unstructured":"E. Goubault. Schedulers as abstract interpretations of HDA. In Proc. of PEPM'95, La Jolla, June 1995. ACM Press, also available at http:\/\/www.dmi.ens.fr\/~goubault ."},{"issue":"7","key":"21_CR18","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1109\/32.538606","volume":"22","author":"P. Godefroid","year":"1996","unstructured":"P. Godefroid, D. Peled, and M. Staskauskas. Using partial-order methods in the formal validation of industrial concurrent programs. IEEE Transactions on Software Engineering, 22(7):496\u2013507, July 1996.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"21_CR19","first-page":"184","volume":"54","author":"J. Gunawardena","year":"1994","unstructured":"J. Gunawardena. Homotopy and concurrency. Bulletin of the EATCS, 54:184\u2013193, 1994.","journal-title":"Bulletin of the EATCS"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"M. Herlihy and S.Rajsbaum. Algebraic Topology and Distributed Computing. A Primer. volume 1000 of Lecture Notes in Computer Science. Springer-Verlag, 1995.","DOI":"10.1007\/BFb0015245"},{"key":"21_CR21","volume-title":"Technical report","author":"M. Herlihy","year":"1996","unstructured":"M. Herlihy and N. Shavit. The topological structure of asynchronous computability. Technical report, Brown University, Providence, RI, January 1996."},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0196-6774(81)90023-7","volume":"2","author":"W. Lipski","year":"1981","unstructured":"W. Lipski and C.H. Papadimitriou. A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems. Journal of Algorithms, 2:211\u2013226, 1981.","journal-title":"Journal of Algorithms"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"S. Melzer and S. Roemer. Deadlock checking using net unfoldings. In Proc. of Computer Aided Verification. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63166-6_35"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"V. Pratt. Modeling concurrency with geometry. In Proc. of the 18th ACM Symposium on Principles of Programming Languages. ACM Press, 1991.","DOI":"10.1145\/99583.99625"},{"key":"21_CR25","unstructured":"F. P. Preparata. Computational Geometry, an Introduction. Springer-Verlag, 1993."},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"A. Valmari. Eliminating redundant interleavings during concurrent program verification. In Proc. of PARLE, volume 366, pages 89\u2013103. Springer-Verlag, Lecture Notes in Computer Science, 1989.","DOI":"10.1007\/3-540-51285-3_35"},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"A. Valmari. A stubborn attack on state explosion. In Proc. of Computer Aided Verification, number 3, pages 25\u201341. AMS DIMACS series in Discrete Mathematics and Theoretical Computer Science, 1991.","DOI":"10.1090\/dimacs\/003\/04"},{"key":"21_CR28","unstructured":"R. van Glabbeek. Bisimulation semantics for higher dimensional automata. Technical report, Stanford University, Manuscript available on the web as http:\/\/theory.stanford.edu\/~rvg\/hda, 1991."},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"W. J. Yeh and M. Young. Compositional reachability analysis using process algebras. In Proc. of the symposium on Testing, Analysis and Verification, pages 178\u2013187. ACM Press, October 1991.","DOI":"10.1145\/120807.120812"}],"container-title":["Lecture Notes in Computer Science","CONCUR'98 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055632","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:29:14Z","timestamp":1555748954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055632"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648963","9783540684558"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/bfb0055632","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}