{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:43:19Z","timestamp":1740120199954,"version":"3.37.3"},"reference-count":26,"publisher":"World Scientific Pub Co Pte Ltd","issue":"06","funder":[{"DOI":"10.13039\/100015548","name":"Vietnam National University, Hanoi","doi-asserted-by":"crossref","award":["QG.20.54"],"award-info":[{"award-number":["QG.20.54"]}],"id":[{"id":"10.13039\/100015548","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Soft. Eng. Knowl. Eng."],"published-print":{"date-parts":[[2022,6]]},"abstract":"<jats:p> Software transactional memory (STM) programs usually use more memory resources than traditional programs. Therefore, estimating an upper bound of memory resources used by an STM program is crucial for optimizing the program and reducing the risks of out-of-memory runtime exceptions. However, due to the complex nesting of transactions and threads, the estimation problem is challenging. In our previous work, we have developed several type systems to address the problem for core imperative languages with STM primitives. This work advances our previous works, in which we add object-oriented constructs to the language while keeping the STM primitives, to make the language closer to practical languages. Then, we built a type system to statically estimate the maximum memory required by well-typed programs of the language. <\/jats:p>","DOI":"10.1142\/s0218194022500139","type":"journal-article","created":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T16:52:52Z","timestamp":1649782372000},"page":"791-818","source":"Crossref","is-referenced-by-count":0,"title":["Finding Memory Bound of Cloned Objects in Software Transactional Memory Programs"],"prefix":"10.1142","volume":"32","author":[{"given":"Ngoc-Khai","family":"Nguyen","sequence":"first","affiliation":[{"name":"Hanoi University of Natural Resources and Environment, Hanoi, Vietnam"}]},{"given":"Anh-Hoang","family":"Truong","sequence":"additional","affiliation":[{"name":"VNU University of Engineering and Technology, Hanoi, Vietnam"}]},{"given":"Duc-Hanh","family":"Dang","sequence":"additional","affiliation":[{"name":"VNU University of Engineering and Technology, Hanoi, Vietnam"}]}],"member":"219","published-online":{"date-parts":[[2022,6,4]]},"reference":[{"key":"S0218194022500139BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/BF02946599"},{"key":"S0218194022500139BIB002","doi-asserted-by":"publisher","DOI":"10.1145\/1364782.1364800"},{"key":"S0218194022500139BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01728-5"},{"key":"S0218194022500139BIB004","doi-asserted-by":"publisher","DOI":"10.1145\/1840845.1840940"},{"key":"S0218194022500139BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46750-4_6"},{"key":"S0218194022500139BIB006","doi-asserted-by":"publisher","DOI":"10.1145\/3155133.3155183"},{"key":"S0218194022500139BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28034-9_21"},{"key":"S0218194022500139BIB008","doi-asserted-by":"publisher","DOI":"10.1145\/2350716.2350722"},{"volume-title":"Learning Concurrent Programming in Scala","year":"2014","author":"Prokopec A.","key":"S0218194022500139BIB009"},{"key":"S0218194022500139BIB010","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224987"},{"key":"S0218194022500139BIB011","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872048"},{"key":"S0218194022500139BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2006.05.006"},{"key":"S0218194022500139BIB013","doi-asserted-by":"publisher","DOI":"10.1145\/2641638.2641654"},{"key":"S0218194022500139BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24851-4_24"},{"key":"S0218194022500139BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24725-8_18"},{"key":"S0218194022500139BIB016","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065952"},{"key":"S0218194022500139BIB017","first-page":"18:1","volume":"2","author":"Dongol B.","year":"2017","journal-title":"Proc. ACM Program. Lang."},{"key":"S0218194022500139BIB019","doi-asserted-by":"publisher","DOI":"10.37236\/407"},{"key":"S0218194022500139BIB020","doi-asserted-by":"publisher","DOI":"10.1145\/3093333.3009842"},{"key":"S0218194022500139BIB021","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46669-8_6"},{"key":"S0218194022500139BIB023","doi-asserted-by":"publisher","DOI":"10.1109\/SANER.2017.7884650"},{"key":"S0218194022500139BIB024","doi-asserted-by":"publisher","DOI":"10.18173\/2354-1075.2015-0055"},{"key":"S0218194022500139BIB025","first-page":"18","volume":"11","author":"Hoang T. A.","year":"2018","journal-title":"J. Sci. Technol. Sec. Inf. Commun. Technol."},{"key":"S0218194022500139BIB026","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.03.001"},{"key":"S0218194022500139BIB027","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05156-3"},{"key":"S0218194022500139BIB028","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1093"}],"container-title":["International Journal of Software Engineering and Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218194022500139","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T09:58:56Z","timestamp":1658311136000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0218194022500139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6]]},"references-count":26,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["10.1142\/S0218194022500139"],"URL":"https:\/\/doi.org\/10.1142\/s0218194022500139","relation":{},"ISSN":["0218-1940","1793-6403"],"issn-type":[{"type":"print","value":"0218-1940"},{"type":"electronic","value":"1793-6403"}],"subject":[],"published":{"date-parts":[[2022,6]]}}}