{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:21:39Z","timestamp":1725664899147},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540625032"},{"type":"electronic","value":"9783540680529"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62503-8_16","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:39:53Z","timestamp":1330295993000},"page":"345-369","source":"Crossref","is-referenced-by-count":0,"title":["Analysis of Facile programs: A case study"],"prefix":"10.1007","author":[{"given":"Pierpaolo","family":"Degano","sequence":"first","affiliation":[]},{"given":"Corrado","family":"Priami","sequence":"additional","affiliation":[]},{"given":"Lone","family":"Leth","sequence":"additional","affiliation":[]},{"given":"Bent","family":"Thomsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"R. Amadio, L. Leth, and B. Thomsen. From a concurrent \u03bb-calculus to the \u03c0-calculus. In Proceedings of FCT'95, 1995. Full version in technical report ECRC-95-18.","key":"16_CR1","DOI":"10.1007\/3-540-60249-6_43"},{"doi-asserted-by":"crossref","unstructured":"A. Bianchi, S. Coluccini, P. Degano, and C. Priami. An efficient verifier of truly concurrent properties. In V. Malyshkin, editor, Proceedings of PaCT'95, LNCS 964, pages 36\u201350. Springer-Verlag, 1995.","key":"16_CR2","DOI":"10.1007\/3-540-60222-4_95"},{"unstructured":"R. Borgia. Semantiche causali per FACILE. Master's thesis, Dipartimento di Informatica, Universit\u00e0 di Pisa, 1995.","key":"16_CR3"},{"doi-asserted-by":"crossref","unstructured":"Roberta Borgia, Pierpaolo Degano, Corrado Priami, Lone Leth, and Bent Thomsen. Understanding mobile agents via a non-interleaving semantics for facile. In Proceedings of SAS'96, To appear in LNCS. Springer-Verlag, 1996.","key":"16_CR4","DOI":"10.1007\/3-540-61739-6_36"},{"doi-asserted-by":"crossref","unstructured":"G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. A theory of processes with localities. Theoretical Computer Science, 114, 1993.","key":"16_CR5","DOI":"10.1016\/0304-3975(93)90152-J"},{"doi-asserted-by":"crossref","unstructured":"R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM Transaction on Programming Languages and Systems, pages 36\u201372, 1993.","key":"16_CR6","DOI":"10.1145\/151646.151648"},{"doi-asserted-by":"crossref","unstructured":"P. Degano and C. Priami. Proved trees. In Proceedings of ICALP'92, LNCS 623, pages 629\u2013640. Springer-Verlag, 1992.","key":"16_CR7","DOI":"10.1007\/3-540-55719-9_110"},{"doi-asserted-by":"crossref","unstructured":"P. Degano and C. Priami. Causality for mobile processes. In Proceedings of ICALP'95, LNCS 944, pages 660\u2013671. Springer-Verlag, 1995.","key":"16_CR8","DOI":"10.1007\/3-540-60084-1_113"},{"key":"16_CR9","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 concurrent and functional programming. International Journal of Parallel Programming, 18:121\u2013160, 1989.","journal-title":"International Journal of Parallel Programming"},{"unstructured":"A. Giacalone, P. Mishra, and S. Prasad. Operational and algebraic semantics for Facile: A symmetric integration of concurrent and functional programming. In Proceedings ICALP'90, LNCS 443, pages 765\u2013780. Springer-Verlag, 1990.","key":"16_CR10"},{"issue":"Number3","key":"16_CR11","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/BF01211076","volume":"7","author":"L. Leth","year":"1995","unstructured":"L. Leth and B. Thomsen. Some Facile Chemistry. Formal Aspects of Computing, Volume 7, Number 3, pages 314\u2013328, 1995.","journal-title":"Formal Aspects of Computing"},{"key":"16_CR12","volume-title":"Technical Report DAIMI FN-19","author":"G. Plotkin","year":"1981","unstructured":"G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, Denmark, 1981."},{"unstructured":"C. Priami. Enhanced Operational Semantics for Concurrency. PhD thesis, Dipartimento di Informatica, Universit\u00e0 di Pisa, March 1996. Available as Tech. Rep. TD-08\/96.","key":"16_CR13"},{"doi-asserted-by":"crossref","unstructured":"B. Thomsen, L. Leth, and A. Giacalone. Some Issues in the Semantics of Facile Distributed Programming. In Proceedings of the 1992 REX Workshop on \u201cSemantics: Foundations and Applications\u201d, LNCS 666. Springer-Verlag, 1992.","key":"16_CR14","DOI":"10.1007\/3-540-56596-5_47"},{"unstructured":"B. Thomsen, L. Leth, S. Prasad, T.-M. Kuo, A. Kramer, F. Knabe, and A. Giacalone. Facile Antigua Release Programming Guide. Technical Report ECRC-93-20, European Computer-Industry Research Centre, 1993.","key":"16_CR15"},{"doi-asserted-by":"crossref","unstructured":"Bent Thomsen, Lone Leth, and Tsung-Miu Kuo. A facile tutorial. In Proceedings of CONCUR'96, LNCS 1119, pages 278\u2013298. Springer-Verlag, 1996.","key":"16_CR16","DOI":"10.1007\/3-540-61604-7_61"}],"container-title":["Lecture Notes in Computer Science","Analysis and Verification of Multiple-Agent Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62503-8_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T11:14:18Z","timestamp":1640949258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62503-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540625032","9783540680529"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-62503-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}