{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:48:00Z","timestamp":1762458480422},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633884"},{"type":"electronic","value":"9783540695301"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0014557","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T09:17:33Z","timestamp":1132737453000},"page":"295-320","source":"Crossref","is-referenced-by-count":4,"title":["A type-theoretic approach to deadlock-freedom of asynchronous systems"],"prefix":"10.1007","author":[{"given":"Samson","family":"Abramsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Gay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajagopal","family":"Nagarajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"S. Abramsky, S. J. Gay, and R. Nagarajan. Interaction categories and foundations of typed concurrent programming. In M. Broy, editor, Deductive Program Design: Proceedings of the 1994 Marktoberdorf International Summer School, NATO ASI Series F: Computer and Systems Sciences. Springer-Verlag, 1995.","DOI":"10.1007\/978-3-642-61455-2_10"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"S. Abramsky, S. J. Gay, and R. Nagarajan. Specification structures and propositions-as-types for concurrency. In G. Birtwistle and F. Moller, editors, Logics for Concurrency: Structure vs. Automata\u2014Proceedings of the VIIIth Banff Higher Order Workshop, volume 1043 of Lecture Notes in Computer Science. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-60915-6_2"},{"key":"13_CR3","unstructured":"S. Abramsky. Interaction Categories and communicating sequential processes. In A. W. Roscoe, editor, A Classical Mind: Essays in Honour of C. A. R. Hoare, pages 1\u201315. Prentice Hall International, 1994."},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/147508.147527","volume":"39","author":"L. Aceto","year":"1992","unstructured":"L. Aceto and M. Hennessy. Termination, deadlock and divergence. Journal of the ACM, 39:147\u2013187, January 1992.","journal-title":"Journal of the ACM"},{"issue":"2","key":"13_CR5","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1017\/S0960129500001274","volume":"1","author":"M. Barr","year":"1991","unstructured":"M. Barr. *-autonomous categories and linear logic. Mathematical Structures in Computer Science, 1(2):159\u2013178, July 1991.","journal-title":"Mathematical Structures in Computer Science"},{"key":"13_CR6","unstructured":"M. Berger, S. Gay, and R. Nagarajan. A typed calculus of deadlock-free processes. Paper in preparation, 1997."},{"key":"13_CR7","series-title":"NATO Advanced Study Institutes, Series F","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/978-3-642-82453-1_10","volume-title":"Logics and Models of Concurrent Systems, volume 13","author":"S. D. Brookes","year":"1985","unstructured":"S. D. Brookes and A. W. Roscoe. Deadlock analysis in networks of communicating processes. In K. Apt, editor, Logics and Models of Concurrent Systems, volume 13, pages 305\u2013324. NATO Advanced Study Institutes, Series F, Springer-Verlag, Berlin, 1985."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"K. M. Chandy and J. Misra. Deadlock absence proofs for networks of communicating processes. Information Processing Letters, 9(4), November 1979.","DOI":"10.1016\/0020-0190(79)90065-6"},{"key":"13_CR9","unstructured":"J. W. de Bakker. Mathematical Theory of Program Correctness. Prentice Hall International, 1980."},{"key":"13_CR10","unstructured":"E. W. Dijkstra and C. S. Scholten. A class of simple communication patterns. In Selected Writings on Computing. EWD643. Springer-Verlag, 1982."},{"key":"13_CR11","unstructured":"S. J. Gay. Linear Types for Communicating Processes. PhD thesis, University of London, 1995."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"S. J. Gay and R. Nagarajan. A typed calculus of synchronous processes. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1995.","DOI":"10.1109\/LICS.1995.523258"},{"issue":"1","key":"13_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"J.-Y. Girard. Linear Logic. Theoretical Computer Science, 50(1):1\u2013102, 1987.","journal-title":"Theoretical Computer Science"},{"key":"13_CR14","volume-title":"Non-Standard Models of Linear Logic","author":"R. Hoofman","year":"1992","unstructured":"R. Hoofman. Non-Standard Models of Linear Logic. PhD thesis, Universiteit Utrecht, Netherlands, 1992."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"N. Kobayashi. A partially deadlock-free typed process calculus. In Proceedings, Twelfth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1997.","DOI":"10.1109\/LICS.1997.614941"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the pi-calculus. In Proceedings, 23rd ACM Symposium on Principles of Programming Languages, 1996.","DOI":"10.1145\/237721.237804"},{"key":"13_CR17","volume-title":"Categories for the Working Mathematician","author":"S. Lane Mac","year":"1971","unstructured":"S. Mac Lane. Categories for the Working Mathematician. Springer-Verlag, Berlin, 1971."},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"J. McKinna and R. Burstall. Deliverables: A categorical approach to program development in type theory. In Proceedings of Mathematical Foundation of Computer Science, 1993.","DOI":"10.1007\/3-540-57182-5_3"},{"key":"13_CR19","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"13_CR20","unstructured":"R. Nagarajan. Typed Concurrent Programs: Specification & Verification. PhD thesis, University of London, 1997. To appear."},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"P. W. O'Hearn and R. D. Tennent. Relational parametricity and local variables. In Proceedings, 20th ACM Symposium on Principles of Programming Languages. ACM Press, 1993.","DOI":"10.1145\/158511.158624"},{"issue":"5","key":"13_CR22","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1145\/360051.360224","volume":"19","author":"S. S. Owicki","year":"1976","unstructured":"S. S. Owicki and D. Cries. Verifying properties of parallel programs. Communications of the ACM, 19(5):279\u2013285, May 1976.","journal-title":"Communications of the ACM"},{"key":"13_CR23","first-page":"86","volume-title":"8th Annual Symposium on Logic in Computer Science","author":"A. M. Pitts","year":"1993","unstructured":"A. M. Pitts. Relational properties of recursively defined domains. In 8th Annual Symposium on Logic in Computer Science, pages 86\u201397. IEEE Computer Society Press, Washington, 1993."},{"issue":"3","key":"13_CR24","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0890-5401(87)90004-6","volume":"75","author":"A. W. Roscoe","year":"1987","unstructured":"A. W. Roscoe and N. Daithi. The pursuit of deadlock freedom. Information and Computation, 75(3):289\u2013327, December 1987.","journal-title":"Information and Computation"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/BFb0022535","volume-title":"Mathematical Foundations of Computer Science, volume 88","author":"J. Sifakis","year":"1980","unstructured":"J. Sifakis. Deadlocks and livelocks in transition systems. In Mathematical Foundations of Computer Science, volume 88 of Lecture Notes in Computer Science, pages 587\u2013599. Springer-Verlag, Berlin, 1980."},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings of the 6th European Conference on Parallel Languages and Architectures, number 817 in Lecture Notes in Computer Science. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58184-7_118"},{"key":"13_CR27","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(81)90108-0","volume":"13","author":"W. W. Wadge","year":"1981","unstructured":"W. W. Wadge. An extensional treatment of dataflow deadlock. Theoretical Computer Science, 13:3\u201315, 1981.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0014557","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:47:36Z","timestamp":1586580456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0014557"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633884","9783540695301"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/bfb0014557","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}