{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:57Z","timestamp":1772164077567,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,11]],"date-time":"2016-01-11T00:00:00Z","timestamp":1452470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,1,11]]},"DOI":"10.1145\/2837614.2837618","type":"proceedings-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T09:05:00Z","timestamp":1452157500000},"page":"164-177","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Fully-abstract compilation by approximate back-translation"],"prefix":"10.1145","author":[{"given":"Dominique","family":"Devriese","sequence":"first","affiliation":[{"name":"KU Leuven, Belgium"}]},{"given":"Marco","family":"Patrignani","sequence":"additional","affiliation":[{"name":"KU Leuven, Belgium"}]},{"given":"Frank","family":"Piessens","sequence":"additional","affiliation":[{"name":"KU Leuven, Belgium"}]}],"member":"320","published-online":{"date-parts":[[2016,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2240276.2240279"},{"key":"e_1_3_2_1_2_1","unstructured":"2240279.  2240279."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292555"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2012.12"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411227"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034830"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596550.1596567"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"doi: 10.1145\/1596550.1596567.    10.1145\/1596550.1596567\ndoi: 10.1145\/1596550.1596567.","DOI":"10.1145\/1596550.1596567"},{"key":"e_1_3_2_1_9_1","volume-title":"MSR","author":"Benton N.","year":"2010","unstructured":"N. Benton and C.-K. Hur . Realizability and compositional compiler correctness for a polymorphic language. Technical report , MSR , 2010 . N. Benton and C.-K. Hur. Realizability and compositional compiler correctness for a polymorphic language. Technical report, MSR, 2010."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2784731.2784733"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2007.02.011"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863566"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429114"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"doi: 10.1145\/2429069.2429114.    10.1145\/2429069.2429114\ndoi: 10.1145\/2429069.2429114.","DOI":"10.1145\/2429069.2429114"},{"key":"e_1_3_2_1_15_1","volume-title":"Math. Struct. Comp. Science","author":"Gorla D.","year":"2014","unstructured":"D. Gorla and U. Nestman . Full abstraction for expressiveness: History, myths and facts . Math. Struct. Comp. Science , 2014 . D. Gorla and U. Nestman. Full abstraction for expressiveness: History, myths and facts. Math. Struct. Comp. Science, 2014."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926402"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103666"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2011.18"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/800017.800528"},{"key":"e_1_3_2_1_20_1","unstructured":"800528.  800528."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498926.1498930"},{"key":"e_1_3_2_1_22_1","volume-title":"Advances in Theory and Formal Methods of Computing","author":"McCusker G.","year":"1996","unstructured":"G. McCusker . Full abstraction by translation . Advances in Theory and Formal Methods of Computing , 1996 . G. McCusker. Full abstraction by translation. Advances in Theory and Formal Methods of Computing, 1996."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(93)90004-9"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596550.1596572"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2784731.2784764"},{"key":"e_1_3_2_1_26_1","volume-title":"Math. Struct. Comp. Science","author":"Parrow J.","year":"2014","unstructured":"J. Parrow . General conditions for full abstraction . Math. Struct. Comp. Science , 2014 . J. Parrow. General conditions for full abstraction. Math. Struct. Comp. Science, 2014."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699503"},{"key":"e_1_3_2_1_29_1","series-title":"Lecture Notes in Computer Science","first-page":"148","volume-title":"ESOP","author":"Perconti J. T.","year":"2014","unstructured":"J. T. Perconti and A. Ahmed . Verifying an open compiler using multi-language semantics . In ESOP , volume 8410 of Lecture Notes in Computer Science , pages 128\u2013 148 , 2014 . J. T. Perconti and A. Ahmed. Verifying an open compiler using multi-language semantics. In ESOP, volume 8410 of Lecture Notes in Computer Science, pages 128\u2013148, 2014."},{"key":"e_1_3_2_1_30_1","volume-title":"MIT press","author":"Pierce B. C.","year":"2002","unstructured":"B. C. Pierce . Types and programming languages. MIT press , 2002 . B. C. Pierce. Types and programming languages. MIT press, 2002."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90044-5"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500000293"},{"key":"e_1_3_2_1_33_1","unstructured":"doi: 10.1017\/ S0960129500000293.  doi: 10.1017\/ S0960129500000293."},{"key":"e_1_3_2_1_34_1","series-title":"LNCS","first-page":"413","volume-title":"Typed Lambda Calculi and Applications","author":"Ritter E.","unstructured":"E. Ritter and A. M. Pitts . A fully abstract translation between a \u00ce\u02d9z-calculus with reference types and standard ml . In M. Dezani-Ciancaglini and G. Plotkin, editors, Typed Lambda Calculi and Applications , volume 902 of LNCS , pages 397\u2013 413 . Springer Berlin Heidelberg, 1995. ISBN 978-3-540-59048-4. doi: 10. 1007\/BFb0014067. E. Ritter and A. M. Pitts. A fully abstract translation between a \u00ce\u02d9z-calculus with reference types and standard ml. In M. Dezani-Ciancaglini and G. Plotkin, editors, Typed Lambda Calculi and Applications, volume 902 of LNCS, pages 397\u2013413. Springer Berlin Heidelberg, 1995. ISBN 978-3-540-59048-4. doi: 10. 1007\/BFb0014067."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205037"},{"key":"e_1_3_2_1_36_1","series-title":"LNCS","first-page":"315","volume-title":"Advances in Computer Science - ASIAN","author":"Shikuma N.","year":"2006","unstructured":"N. Shikuma and A. Igarashi . Proving noninterference by a fully complete translation to the simply typed \u03bb-calculus . In M. Okada and I. Satoh, editors, Advances in Computer Science - ASIAN 2006 . Secure Software and Related Issues , volume 4435 of LNCS , pages 301\u2013 315 . Springer Berlin Heidelberg, 2007. doi: 10.1007\/978-3-540-77505-8_24. S. F. Smith. The coverage of operational semantics. In Higher Order Operational Techniques in Semantics, Publications of the Newton Institute, pages 307\u2013346. Cambridge University Press, 1998. 10.1007\/978-3-540-77505-8_24 N. Shikuma and A. Igarashi. Proving noninterference by a fully complete translation to the simply typed \u03bb-calculus. In M. Okada and I. Satoh, editors, Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues, volume 4435 of LNCS, pages 301\u2013315. Springer Berlin Heidelberg, 2007. doi: 10.1007\/978-3-540-77505-8_24. S. F. Smith. The coverage of operational semantics. In Higher Order Operational Techniques in Semantics, Publications of the Newton Institute, pages 307\u2013346. Cambridge University Press, 1998."}],"event":{"name":"POPL '16: The 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"St. Petersburg FL USA","acronym":"POPL '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837618","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2837614.2837618","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:43:37Z","timestamp":1750211017000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837618"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,11]]},"references-count":35,"alternative-id":["10.1145\/2837614.2837618","10.1145\/2837614"],"URL":"https:\/\/doi.org\/10.1145\/2837614.2837618","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2914770.2837618","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,1,11]]},"assertion":[{"value":"2016-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}