{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:32:24Z","timestamp":1725485544237},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540654629"},{"type":"electronic","value":"9783540492535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49253-4_17","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:56:45Z","timestamp":1181185005000},"page":"214-230","source":"Crossref","is-referenced-by-count":2,"title":["A Synergy Between Model-Checking and Type Inference for the Verification of Value-Passing Higher-Order Processes"],"prefix":"10.1007","author":[{"given":"Mourad","family":"Debbabi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelkader","family":"Benzakour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B\u00e9chir","family":"Ktari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,1,15]]},"reference":[{"key":"17_CR1","series-title":"Lect Notes Comput Sci","volume-title":"In Proc. of CAAP\u201995","author":"R. M. Amadio","year":"1995","unstructured":"R. M. Amadio and M. Dam. Reasoning about higher-order processes. In Proc. of CAAP\u201995, Aarhus, Lecture Notes in Computer Science, 915, 1995."},{"key":"17_CR2","unstructured":"B. Berthomieu. Implementing CCS, the LCS experiment. Technical Report 89425, LAAS CNRS, 1989."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"D. Bolignano and M. Debbabi. A coherent type inference system for a concur-rent, functional and imperative programming language. In Proceedings of the AMAST\u201993 Conference. Springer Verlag, June 1993.","DOI":"10.1007\/978-1-4471-3227-1_14"},{"key":"17_CR4","unstructured":"D. Bolignano and M. Debbabi. A semantic theory for CML. In Proceedings of the TACS\u201994 Conference. Springer Verlag, April1994."},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"R. Cridlig. Semantic analysis of shared-memory concurrent languages using ab-stract model-checking. In Symposium on Partial Evaluation and Program Manipulation, 1995.","DOI":"10.1145\/215465.215593"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"R. Cridlig. Semantic analysis of concurrent ML by abstract model-checking. In International Workshop on Verification of Infinite State Systems, 1996.","DOI":"10.1016\/S1571-0661(05)80678-4"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Mads Dam. Model checking mobile processes. Information and Computation, 129(1):35\u201351, 25 August 1996.","DOI":"10.1006\/inco.1996.0072"},{"key":"17_CR8","unstructured":"M. Debbabi. Int\u00e9gration des paradigmes de programmation parall\u00e8le, fonctionnelle et imp\u00e9rative: fondements s\u00e9mantiques. PhD thesis, Universit\u00e9 Paris Sud, Centre d\u2019Orsay, July1994."},{"key":"17_CR9","unstructured":"E. Allen Emerson and Chin-Laung Lei. Efficient model checking in fragments of the propositional mu-calculus (extended abstract). In Proceedings, Symposium on Logic in Computer Science, pages 267\u2013278, Cambridge, Massachusetts, 16\u201318 June 1986. IEEE Computer Society."},{"issue":"6","key":"17_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/232629.232649","volume":"31","author":"William Ferreira","year":"1996","unstructured":"William Ferreira, Matthew Hennessy, and Alan Jeffrey. A theory of weak bisim-ulation for core CML. ACM SIGPLAN Notices, 31(6):201\u2013212, June 1996.","journal-title":"ACM SIGPLAN Notices"},{"issue":"2","key":"17_CR11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01491213","volume":"18","author":"A. Giacalone","year":"1989","unstructured":"A. Giacalone, P. Mishra, and S. Prasad. Facile: A symmetric integration of concur-rent and functional programming. International Journal of Parallel Programming, 18(2):121\u2013160, April 1989.","journal-title":"International Journal of Parallel Programming"},{"key":"17_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings 20th ICALP","author":"K. Havelund","year":"1993","unstructured":"K. Havelund and K. G. Larsen. The fork calculus. In A. Lingas, R. Karlsson, and S. Carlsson, editors, Proceedings 20 th ICALP, volume 700 of Lecture Notes in Computer Science. Springer Verlag, 1993."},{"key":"17_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Proc. 17th ICALP","author":"M. Hennessy","year":"1990","unstructured":"M. Hennessy and A. Ing\u00f3lfsd\u00f3ttir. A theory of communicating processes with value passing. In Proc. 17th ICALP, LNCS. Springer Verlag, 1990."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 23, 1983.","DOI":"10.1016\/0304-3975(82)90125-6"},{"key":"17_CR15","unstructured":"R. Milner. The polyadic \u03c0-calculus: A tutorial. Technical report, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1991."},{"key":"17_CR16","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Technical report, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1989."},{"key":"17_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/3-540-57208-2_34","volume-title":"Proceedings of CONCUR\u201993","author":"F. Nielson","year":"1993","unstructured":"Flemming Nielson and Hanne Riis Nielsen. From CML to process algebra. In E. Best, editor, Proceedings of CONCUR\u201993, LNCS 715, pages 493\u2013508. Springer-Verlag, 1993."},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Hanne Riis Nielson and Flemming Nielson. Higher-order concurrent programs with finite communication topology. In Conference Record of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201994), pages 84\u201397, Portland, Oregon, January 17\u201321, 1994. ACM Press. Extended abstract.","DOI":"10.1145\/174675.174538"},{"key":"17_CR19","unstructured":"J.H. Reppy. Concurrent programming with events-the Concurrent ML manual. Technical report, Department of Computer Science, Cornell University, November 1990."},{"issue":"6","key":"17_CR20","first-page":"294","volume":"26","author":"J.H. Reppy","year":"1991","unstructured":"J.H. Reppy. CML: A higher-order concurrent language. In Proceedings of the ACM SIGPLAN\u2019 91 PLDI, pages 294\u2013305. SIGPLAN Notices 26(6), 1991.","journal-title":"Proceedings of the ACM SIGPLAN\u2019 91 PLDI"},{"key":"17_CR21","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proc. 2d Static Analysis Symposium, Glasgow, Sept. 1995","author":"D.A. Schmidt","year":"1995","unstructured":"D.A. Schmidt. Natural-semantics-based abstract interpretation. In Proc. 2d Static Analysis Symposium, Glasgow, Sept. 1995, Lecture Notes in Computer Science 983, pages 1\u201318. Springer-Verlag, Berlin, 1995."},{"key":"17_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/3-540-62503-8_4","volume-title":"Proc. 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages, Stockholm, June 1996","author":"D.A. Schmidt","year":"1997","unstructured":"D.A. Schmidt. Abstract interpretation of small-step semantics. In Proc. 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages, Stockholm, June 1996, Lecture Notes in Computer Science 1192, pages 76\u201399. Springer-Verlag, Berlin, 1997."},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Bent Thomsen. A calculus of higher order communicating systems. In Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, pages 143\u2013154, Austin, Texas, January 1989.","DOI":"10.1145\/75277.75290"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Bent Thomsen. Plain CHOCS. A second generation calculus for higher order processes. Acta Informatica, 30, 1993.","DOI":"10.1007\/BF01200262"}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49253-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T07:21:44Z","timestamp":1683876104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49253-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540654629","9783540492535"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-49253-4_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}