{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:30Z","timestamp":1772164050619,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T00:00:00Z","timestamp":1465776000000},"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,6,13]]},"DOI":"10.1145\/2907950.2907953","type":"proceedings-article","created":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T15:23:42Z","timestamp":1464881022000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient asynchronous interrupt handling in a full-system instruction set simulator"],"prefix":"10.1145","author":[{"given":"Tom","family":"Spink","sequence":"first","affiliation":[{"name":"University of Edinburgh, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harry","family":"Wagstaff","sequence":"additional","affiliation":[{"name":"University of Edinburgh, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bj\u00f6rn","family":"Franke","sequence":"additional","affiliation":[{"name":"University of Edinburgh, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1496909.1496921"},{"key":"e_1_3_2_1_2_1","unstructured":"ARM Ltd. (2005\u20132009). ARM security technology building a secure system using TrustZone technology.  ARM Ltd. (2005\u20132009). ARM security technology building a secure system using TrustZone technology."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/183432.183527"},{"key":"e_1_3_2_1_4_1","first-page":"41","volume-title":"Proceedings of the Annual Conference on USENIX, ATEC \u201905","author":"Bellard F.","year":"2005","unstructured":"Bellard , F. ( 2005 ). QEMU, a fast and portable dynamic translator . In Proceedings of the Annual Conference on USENIX, ATEC \u201905 , pages 41\u2013 41 , Berkeley, CA, USA. USENIX Association. Bellard, F. (2005). QEMU, a fast and portable dynamic translator. In Proceedings of the Annual Conference on USENIX, ATEC \u201905, pages 41\u201341, Berkeley, CA, USA. USENIX Association."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2024716.2024718"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993508"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1543820.1543833"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548306007887"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009191"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2014.6844457"},{"key":"e_1_3_2_1_12_1","unstructured":"Hardavellas N. Somogyi S. Wenisch T. F. Wunderlich R. E. Chen S. Kim J. Falsafi B. Hoe J. C. and Nowatzyk A. G. (2004).  Hardavellas N. Somogyi S. Wenisch T. F. Wunderlich R. E. Chen S. Kim J. Falsafi B. Hoe J. C. and Nowatzyk A. G. (2004)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1054907.1054914"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186736.1186737"},{"key":"e_1_3_2_1_15_1","volume-title":"Threading and yieldpoints","author":"Jikes RVM","year":"2007","unstructured":"Jikes RVM ( 2007 ). Threading and yieldpoints . Jikes RVM (2007). Threading and yieldpoints."},{"key":"e_1_3_2_1_16_1","volume-title":"Reducibility among combinatorial problems","author":"Karp R. M.","year":"1972","unstructured":"Karp , R. M. ( 1972 ). Reducibility among combinatorial problems . Springer . Karp, R. M. (1972). Reducibility among combinatorial problems. Springer."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/977395.977673"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.v34:15"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICESS.2008.73"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.982916"},{"key":"e_1_3_2_1_21_1","volume-title":"hdparm(8): get\/set sata\/ide device parameters","author":"Mark Lord","year":"2012","unstructured":"Mark Lord ( 2012 ). hdparm(8): get\/set sata\/ide device parameters . Mark Lord (2012). hdparm(8): get\/set sata\/ide device parameters."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2010.5416635"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2024724.2024954"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400097.1400108"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2010.95"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2597809.2597810"},{"key":"e_1_3_2_1_27_1","series-title":"SIAM Journal on Computing","volume-title":"Depth first search and linear graph algorithms","author":"Tarjan R.","year":"1972","unstructured":"Tarjan , R. ( 1972 ). Depth first search and linear graph algorithms . SIAM Journal on Computing . Tarjan, R. (1972). Depth first search and linear graph algorithms. SIAM Journal on Computing."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488760"}],"event":{"name":"LCTES'16: SIGPLAN\/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2016","location":"Santa Barbara CA USA","acronym":"LCTES'16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 17th ACM SIGPLAN\/SIGBED Conference on Languages, Compilers, Tools, and Theory for Embedded Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2907950.2907953","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2907950.2907953","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:54:27Z","timestamp":1750208067000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2907950.2907953"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,13]]},"references-count":27,"alternative-id":["10.1145\/2907950.2907953","10.1145\/2907950"],"URL":"https:\/\/doi.org\/10.1145\/2907950.2907953","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2980930.2907953","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,6,13]]},"assertion":[{"value":"2016-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}