{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:20:34Z","timestamp":1725664834949},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540610526"},{"type":"electronic","value":"9783540499367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61052-9_49","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:12:33Z","timestamp":1330290753000},"page":"231-248","source":"Crossref","is-referenced-by-count":0,"title":["Compiler correctness for concurrent languages"],"prefix":"10.1007","author":[{"given":"David S.","family":"Gladstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitchell","family":"Wand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"15_CR1","unstructured":"R. M. Amadio. Translating core Facile. Technical Report ECRC-1994-3, ECRC, Feb. 1994."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"P. America, J. de Bakker, J. N. Kok, and J. Rutten. Operational semantics of a parallel object-oriented language. In Conf. Rec. 13th ACM Symposium on Principles of Programming Languages, pages 194\u2013208, 1986.","DOI":"10.1145\/512644.512662"},{"key":"15_CR3","volume-title":"Compiling with Continuations","author":"A. W. Appel","year":"1992","unstructured":"A. W. Appel. Compiling with Continuations. Cambridge University Press, Cambridge, 1992."},{"key":"15_CR4","unstructured":"J. Armstrong, R. Virding, and M. Williams. Concurrent Programming in Erlang. Prentice Hall, 1993."},{"key":"15_CR5","unstructured":"J. S. Auerbach et al. Concurrent\/C Tutorial and User's Guide: An Introduction to a Language for Distributed C Programming. IBM T. J. Watson Research Center, June 1994."},{"key":"15_CR6","unstructured":"H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, 1984."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"B. Bloom. Chocolate: Calculi of higher order communication and lambda terms. In Conf. Rec. 21st ACM Symposium on Principles of Programming Languages, pages 339\u2013347, 1994.","DOI":"10.1145\/174675.177948"},{"key":"15_CR8","unstructured":"N. Carriero and D. Gelernter. How to Write Parallel Programs: A First Course. MIT Press, 1990."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"W. Clinger. The Scheme 311 compiler: An exercise in denotational semantics. In Proc. 1984 ACM Symposium on Lisp and Functional Programming, pages 356\u2013364, Aug. 1984.","DOI":"10.1145\/800055.802052"},{"key":"15_CR10","unstructured":"A. Geist et al. PVM 3 User's Guide and Reference Manual. Oak Ridge National Laboratory, May 1993."},{"issue":"2","key":"15_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 concurrent and functional programming. International Journal of Parallel Programming, 18(2):121\u2013160, 1989.","journal-title":"International Journal of Parallel Programming"},{"key":"15_CR12","series-title":"volume 443 of Lecture Notes in Computer Science","first-page":"765","volume-title":"Proc. ICALP '90","author":"A. Giacalone","year":"1990","unstructured":"A. Giacalone, P. Mishra, and S. Prasad. Operational and algebraic semantics for facile: A symmetric integration of concurrent and functional programming. In Proc. ICALP '90, volume 443 of Lecture Notes in Computer Science, pages 765\u20137780, Berlin, Heidelberg, and New York, 1990. Springer-Verlag."},{"key":"15_CR13","unstructured":"D. Gladstein. Compiler Correctness for Concurrent Languages. PhD thesis, Northeastern University, Dec. 1994. Available via anonymous ftp from ftp.ccs.neu.edu as \/pub\/people\/daveg\/thesis.ps.Z."},{"key":"15_CR14","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1006\/inco.1995.1066","volume":"118","author":"R. Gorrieri","year":"1995","unstructured":"R. Gorrieri and C. Laneve. Split and ST bisimulation semantics. Information and Computation, 118:272\u2013288, 1995.","journal-title":"Information and Computation"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"J. D. Guttman, V. Swarup, and J. Ramsdell. The VLISP verified scheme system. Lisp and Symbolic Computation, 8(1\/2), 1995.","DOI":"10.1007\/BF01128407"},{"issue":"5","key":"15_CR16","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1137\/0217063","volume":"15","author":"M. Hennessy","year":"1995","unstructured":"M. Hennessy. Axiomatising finite concurrent processes. SIAM Journal of Computation, 15(5):997\u20131017, 1995.","journal-title":"SIAM Journal of Computation"},{"key":"15_CR17","unstructured":"C. Hoare. Communicating Sequential Processes. Prentice Hall International, 1985."},{"key":"15_CR18","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0960129500001407","volume":"2","author":"R. Milner","year":"1992","unstructured":"R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2:119\u2013141, 1992.","journal-title":"Mathematical Structures in Computer Science"},{"key":"15_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes (parts i and ii). Information and Computation, 100:1\u201377, 1992.","journal-title":"Information and Computation"},{"key":"15_CR20","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/3-540-57208-2_34","volume-title":"Proceesings of CONCUR '93","author":"F. Nielson","year":"1993","unstructured":"F. Nielson and H. R. Nielson. From CML to process algebras. In Proceesings of CONCUR '93, pages 493\u2013508, Berlin, Heidelberg, and New York, 1993. Springer-Verlag."},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"D. P. Oliva, J. D. Ramsdell, and M. Wand. The VLISP verified PreScheme compiler. Lisp and Symbolic Computation, 8(1\/2), 1995.","DOI":"10.1007\/BF01128408"},{"issue":"3\/4","key":"15_CR22","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01019459","volume":"6","author":"J. C. Reynolds","year":"1993","unstructured":"J. C. Reynolds. The discoveries of continuations. Lisp and Symbolic Computation, 6(3\/4):233\u2013248, 1993.","journal-title":"Lisp and Symbolic Computation"},{"key":"15_CR23","unstructured":"G. Springer and D. P. Friedman. Scheme and the Art of Programming. MIT Press, 1989."},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"B. Thomsen. A calculus of higher order communicating systems. In Conf. Rec. 16th ACM Symposium on Principles of Programming Languages, pages 143\u2013154, 1989.","DOI":"10.1145\/75277.75290"},{"key":"15_CR25","unstructured":"R. van Glabbeek and F. Vaandrager. The difference between splitting in n and n+1 (abstract). In E. Best and G. Rozenberg, editors, Proceedings 3rd Workshop on Concurrency and Compositionality, Sankt Augustin, Germany, February 1991. GMD-Studien Nr. 191."},{"key":"15_CR26","volume-title":"Lecture Notes in Computer Science","author":"D. Walker","year":"1991","unstructured":"D. Walker. \u03c0-calculus semantics of object-oriented programming languages. In Proc. Conference on Theoretical Aspects of Computer Software, Lecture Notes in Computer Science, Berlin, Heidelberg, and New York, 1991. Springer-Verlag."},{"issue":"3","key":"15_CR27","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1145\/357172.357179","volume":"4","author":"M. Wand","year":"1982","unstructured":"M. Wand. Deriving target code as a representation of continuation semantics. ACM Transactions on Programming Languages and Systems, 4(3):496\u2013517, July 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"M. Wand. Semantics-directed machine architecture. In Conf. Rec. 9th ACM Symposium on Principles of Programming Languages, pages 234\u2013241, 1982.","DOI":"10.1145\/582153.582179"},{"issue":"2\u20133","key":"15_CR29","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/S0019-9958(83)80041-2","volume":"57","author":"M. Wand","year":"1983","unstructured":"M. Wand. Loops in combinator-based compilers. Information and Control, 57(2\u20133):148\u2013164, May\/June 1983.","journal-title":"Information and Control"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"M. Wand. Compiler correctness for parallel languages. In 1995 Symposium on Functional Languages and Computer Architecture, June 1995.","DOI":"10.1145\/224164.224193"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"M. Wand and D. P. Oliva. Proving the correctness of storage representations. In Proc. 1992 ACM Symposium on Lisp and Functional Programming, pages 151\u2013160, 1992.","DOI":"10.1145\/141471.141528"}],"container-title":["Lecture Notes in Computer Science","Coordination Languages and Models"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61052-9_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:43Z","timestamp":1605647023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61052-9_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540610526","9783540499367"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-61052-9_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}