{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:55:11Z","timestamp":1771707311243,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031226762","type":"print"},{"value":"9783031226779","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-22677-9_5","type":"book-chapter","created":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T09:04:32Z","timestamp":1673341472000},"page":"81-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["PMemTrace: Lightweight and\u00a0Efficient Memory Access Monitoring for\u00a0Persistent Memory"],"prefix":"10.1007","author":[{"given":"Yushuqing","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenwei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenzhe","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,11]]},"reference":[{"issue":"5","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1587\/transinf.2016EDP7429","volume":"100","author":"W Zhang","year":"2017","unstructured":"Zhang, W., Kai, L.U., Wang, X., Jian, J.: Fast persistent heap based on non-volatile memory. IEICE Trans. Inf. Syst. 100(5), 1035\u20131045 (2017)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"5_CR2","first-page":"1","volume":"54","author":"A Baldassin","year":"2021","unstructured":"Baldassin, A., Barreto, J., Castro, D., Romano, P.: Persistent memory: a survey of programming support and implementations. ACM Comput. Sur. 54, 1\u201337 (2021)","journal-title":"ACM Comput. Sur."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Fu, X., et al.: Witcher: systematic crash consistency testing for non-volatile memory key-value stores. In: Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles (2021)","DOI":"10.1145\/3477132.3483556"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/3375408.3375416","volume":"38","author":"D Ly","year":"2019","unstructured":"Ly, D., Kosmatov, N., Signoles, J., Loulergue, F.: Soundness of a dataflow analysis for memory monitoring. ACM SIGAda Ada Lett. 38(2), 97\u2013108 (2019)","journal-title":"ACM SIGAda Ada Lett."},{"key":"5_CR5","unstructured":"Wang, H. Zhai, J., Tang, X., Yu, B., Ma, X., Chen, W.: Spindle: informed memory access monitoring, in 2018 USENIX Annual Technical Conference (USENIX ATC 18). Boston, MA: USENIX Association, Jul. 2018, pp. 561\u2013574. https:\/\/www.usenix.org\/conference\/atc18\/presentation\/wang-haojie"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Nalli, S., Haria, S., Hill, M. D., Swift, M. M., Volos, H., Keeton, K.: An analysis of persistent memory use with whisper. In: Proceedings of the Twenty-Second International Conference on Architectural Support for Programming Languages and Operating Systems, ser. ASPLOS \u201917. New York, NY, USA: Association for Computing Machinery 45, pp. 135\u2013148 (2017). https:\/\/doi.org\/10.1145\/3037697.3037730","DOI":"10.1145\/3037697.3037730"},{"key":"5_CR7","unstructured":"Payer, M., Kravina, E., Gross, T. R.: Lightweight memory tracing. In: 2013 USENIX Annual Technical Conference (USENIX ATC 13). San Jose, CA: USENIX Association, pp. 115\u2013126 (2013). https:\/\/www.usenix.org\/conference\/atc13\/technical-sessions\/presentation\/payer"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Laurenzano, M.A., Tikir, M.M., Carrington, L., Snavely, A.: PEBIL: efficient static binary instrumentation for Linux. In: IEEE International Symposium on Performance Analysis of Systems Software (2010)","DOI":"10.1109\/ISPASS.2010.5452024"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/S1571-0661(04)81042-9","volume":"89","author":"N Nethercote","year":"2003","unstructured":"Nethercote, N., Seward, J.: Valgrind: a program supervision framework. Electron. Notes Theoret. Comput. Sci. 89(2), 44\u201366 (2003)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Luk, C.-K.: Pin: building customized program analysis tools with dynamic instrumentation, SIGPLAN Not., 40(6), 190\u2013200 (2005). https:\/\/doi.org\/10.1145\/1064978.1065034","DOI":"10.1145\/1064978.1065034"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Luk, C.-K.: Pin: building customized program analysis tools with dynamic instrumentation, ACM SIGPLAN notices, 40(6), 190\u2013200 (2005)","DOI":"10.1145\/1064978.1065034"},{"key":"5_CR12","unstructured":"Kalbfleisch, S.,Werling, L., Bellosa, F.: Vinter: automatic non-volatile memory crash consistency testing for full systems. In: 2022 USENIX Annual Technical Conference (USENIX ATC 22). Carlsbad, CA: USENIX Association, pp. 933\u2013950 (2022). http:\/\/www.usenix.org\/conference\/atc22\/presentation\/werling"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Hsu, T. C.-H., Br\u00fcgner, H., Roy, I., Keeton, K., Eugster, p.: Nvthreads: practical persistence for multi-threaded applications. In: Proceedings of the Twelfth European Conference on Computer Systems, ser. Euro Sys \u201917. New York, NY, USA: Association for Computing Machinery, pp. 468\u2013482 (2017). https:\/\/doi.org\/10.1145\/3064176.3064204","DOI":"10.1145\/3064176.3064204"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Chakrabarti, D. R., Boehm, H.-J., Bhandari, k.: Atlas: leveraging locks for non-volatile memory consistency, SIGPLAN Not., 49(10), 433\u2013452 (2014). https:\/\/doi.org\/10.1145\/2714064.2660224","DOI":"10.1145\/2714064.2660224"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Wu, Z., Lu, K., Nisbet, A., Zhang, W., Luj\u00e1n, M.: PMThreads: persistent memory threads harnessing versioned shadow copies. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, ser. PLDI 2020. New York, NY, USA: Association for Computing Machinery, pp. 623\u2013637 (2020). https:\/\/doi.org\/10.1145\/3385412.3386000","DOI":"10.1145\/3385412.3386000"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Shang, L., Xie, X., Xue, J.: On-demand dynamic summary-based points-to analysis. In: Proceedings of the Tenth International Symposium on Code Generation and Optimization, ser. CGO \u201912. New York, NY, USA: Association for Computing Machinery, pp. 264\u2013274 (2012). https:\/\/doi.org\/10.1145\/2259016.2259050","DOI":"10.1145\/2259016.2259050"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Sridharan, M., Bod\u00edk, R.: Refinement-based context-sensitive points-to analysis for java, SIGPLAN Not., 416, 387\u2013400 (2006). https:\/\/doi.org\/10.1145\/1133255.1134027","DOI":"10.1145\/1133255.1134027"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"MSridharan, M., Gopan, D., Shan, L., Bod\u00edk, R.: Demand-driven points-to analysis for java, SIGPLAN Not., 40(10), 59\u201376 (2005). https:\/\/doi.org\/10.1145\/1103845.1094817","DOI":"10.1145\/1103845.1094817"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-03013-0_6","volume-title":"ECOOP 2009 \u2013 Object-Oriented Programming","author":"G Xu","year":"2009","unstructured":"Xu, G., Rountev, A., Sridharan, M.: Scaling CFL-reachability-based points-to analysis using context-sensitive must-not-alias analysis. In: Drossopoulou, S. (ed.) ECOOP 2009. LNCS, vol. 5653, pp. 98\u2013122. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03013-0_6"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Yan, D., Xu, G., Rountev, A.: Demand-driven context-sensitive alias analysis for java. In: Proceedings of the 2011 International Symposium on Software Testing and Analysis, ser. ISSTA\u201911. New York, NY, USA: Association for Computing Machinery, pp. 155\u2013165 (2011). https:\/\/doi.org\/10.1145\/2001420.2001440","DOI":"10.1145\/2001420.2001440"},{"key":"5_CR21","unstructured":"Neal, I., et al.: AGAMOTTO: how persistent is your persistent memory application? In: 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20). USENIX Association, pp. 1047\u20131064 (2020). https:\/\/www.usenix.org\/conference\/osdi20\/presentation\/neal"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Zheng, X., Rugina, R.: Demand-driven alias analysis for C, SIGPLAN Not., 43(1), 197\u2013208 (2008). https:\/\/doi.org\/10.1145\/1328897.1328464","DOI":"10.1145\/1328897.1328464"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Zhang, Q., Lyu, M.R., Yuan, H., Su, Z.: Fast algorithms for DYCK-CFL-reachability with applications to alias analysis, SIGPLAN Not., 48(6), 435\u2013446 (2013). https:\/\/doi.org\/10.1145\/2499370.2462159","DOI":"10.1145\/2499370.2462159"},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Steensgaard, B.: Points-to analysis in almost linear time. In: Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ser. POPL\u201996. New York, NY, USA: Association for Computing Machinery, pp. 32\u201341 (1996). https:\/\/doi.org\/10.1145\/237721.237727","DOI":"10.1145\/237721.237727"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22677-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T09:06:09Z","timestamp":1673341569000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22677-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031226762","9783031226779"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22677-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"91","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}