{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T12:49:39Z","timestamp":1751374179453,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T00:00:00Z","timestamp":1657411200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Natural Science Foundation of China (NSFC)","award":["62125202"],"award-info":[{"award-number":["62125202"]}]},{"name":"Ministry of Education of China"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,10]]},"DOI":"10.1145\/3489517.3530537","type":"proceedings-article","created":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T23:19:29Z","timestamp":1661296769000},"page":"817-822","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Scalable crash consistency for secure persistent memory"],"prefix":"10.1145","author":[{"given":"Ming","family":"Zhang","sequence":"first","affiliation":[{"name":"Huazhong University of Science and Technology"}]},{"given":"Yu","family":"Hua","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology"}]},{"given":"Xuan","family":"Li","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology"}]},{"given":"Hao","family":"Xu","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology"}]}],"member":"320","published-online":{"date-parts":[[2022,8,23]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2016. Deprecating the PCOMMIT Instruction. https:\/\/software.intel.com\/content\/www\/us\/en\/develop\/blogs\/deprecate-pcommit-instruction.html."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872362.2872377"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"A. Awad M. Ye Y. Solihin L. Njilla and K. A. Zubair. 2019. Triad-NVM: persistency for integrity-protected and encrypted non-volatile memories. In ISCA.","DOI":"10.1145\/3307650.3322250"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2024716.2024718"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"D. R. Chakrabarti H. Boehm and K. Bhandari. 2014. Atlas: leveraging locks for non-volatile memory consistency. In OOPSLA.","DOI":"10.1145\/2660193.2660224"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"A. Freij S. Yuan H. Zhou and Y. Solihin. 2020. Persist Level Parallelism: Streamlining Integrity Tree Updates for Secure Persistent Memory. In MICRO.","DOI":"10.1109\/MICRO50266.2020.00015"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"A. Freij H. Zhou and Y. Solihin. 2021. Bonsai Merkle Forests: Efficiently Achieving Crash Consistency in Secure Persistent Memory. In MICRO.","DOI":"10.1145\/3466752.3480067"},{"key":"e_1_3_2_1_8_1","unstructured":"B. Gassend G. Edward Suh D. E. Clarke M. V. Dijk and S. Devadas. 2003. Caches and Hash Trees for Efficient Memory Integrity Verification. In HPCA."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"V. Gogte W. Wang S. Diestelhorst P. M. Chen S. Narayanasamy and T. F. Wenisch. 2020. Relaxed Persist Ordering Using Strand Persistency. In ISCA.","DOI":"10.1109\/ISCA45697.2020.00060"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"J. Huang and Y. Hua. 2021. A Write-Friendly and Fast-Recovery Scheme for Security Metadata in Non-Volatile Memories. In HPCA.","DOI":"10.1109\/HPCA51647.2021.00038"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"S. K. Lee J. Mohan S. Kashyap T. Kim and V. Chidambaram. 2019. Recipe: converting concurrent DRAM indexes to persistent-memory indexes. In SOSP.","DOI":"10.1145\/3341301.3359635"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"M. Liu M. Zhang K. Chen X. Qian Y. Wu W. Zheng and J. Ren. 2017. DudeTM: Building Durable Transactions with Decoupling for Persistent Memory. In ASPLOS.","DOI":"10.1145\/3037697.3037714"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"S. Liu A. Kolli J. Ren and S. M. Khan. 2018. Crash Consistency in Encrypted Non-volatile Main Memory Systems. In HPCA.","DOI":"10.1109\/HPCA.2018.00035"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"S. Liu K. Seemakhupt G. Pekhimenko A. Kolli and S. Khan. 2019. Janus: optimizing memory and storage support for non-volatile memory systems. In ISCA.","DOI":"10.1145\/3307650.3322206"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/128765.128770"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"S. Nalli S. Haria M. D. Hill M. M. Swift H. Volos and K. Keeton. 2017. An Analysis of Persistent Memory Use with WHISPER. In ASPLOS.","DOI":"10.1145\/3037697.3037730"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"S. Pelley P. M. Chen and T. F. Wenisch. 2014. Memory persistency. In ISCA.","DOI":"10.1109\/ISCA.2014.6853222"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCA.2015.2402435"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3061639.3062205"},{"key":"e_1_3_2_1_20_1","volume-title":"Morphable Counters: Enabling Compact Integrity Trees For Low-Overhead Secure Memories. In MICRO.","author":"Saileshwar G.","year":"2018","unstructured":"G. Saileshwar, P. J. Nair, P. Ramrakhyani, W. Elsasser, J. A. Joao, and M. K. Qureshi. 2018. Morphable Counters: Enabling Compact Integrity Trees For Low-Overhead Secure Memories. In MICRO."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"S. Swami J. Rakshit and K. Mohanram. 2016. SECRET: smartly EnCRypted energy efficient non-volatile memories. In DAC.","DOI":"10.1145\/2897937.2898087"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"C. Yan D. Englender M. Prvulovic B. Rogers and Y. Solihin. 2006. Improving Cost Performance and Security of Memory Encryption and Authentication. In ISCA.","DOI":"10.1145\/1150019.1136502"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317869"},{"key":"e_1_3_2_1_24_1","volume-title":"Osiris: A Low-Cost Mechanism to Enable Restoration of Secure Non-Volatile Memories. In MICRO.","author":"Ye M.","year":"2018","unstructured":"M. Ye, C. Hughes, and A. Awad. 2018. Osiris: A Low-Cost Mechanism to Enable Restoration of Secure Non-Volatile Memories. In MICRO."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694387"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"K. A. Zubair and A. Awad. 2019. Anubis: ultra-low overhead and recovery time for secure non-volatile memories. In ISCA.","DOI":"10.1145\/3307650.3322252"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"P. Zuo Y. Hua and Y. Xie. 2019. SuperMem: Enabling Application-transparent Secure Persistent Memory with Low Overheads. In MICRO.","DOI":"10.1145\/3352460.3358290"}],"event":{"name":"DAC '22: 59th ACM\/IEEE Design Automation Conference","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA"],"location":"San Francisco California","acronym":"DAC '22"},"container-title":["Proceedings of the 59th ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530537","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3489517.3530537","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:18Z","timestamp":1750186938000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,10]]},"references-count":27,"alternative-id":["10.1145\/3489517.3530537","10.1145\/3489517"],"URL":"https:\/\/doi.org\/10.1145\/3489517.3530537","relation":{},"subject":[],"published":{"date-parts":[[2022,7,10]]},"assertion":[{"value":"2022-08-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}