{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T01:26:55Z","timestamp":1725845215404},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319280332"},{"type":"electronic","value":"9783319280349"}],"license":[{"start":{"date-parts":[[2015,12,25]],"date-time":"2015-12-25T00:00:00Z","timestamp":1451001600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-28034-9_21","type":"book-chapter","created":{"date-parts":[[2015,12,24]],"date-time":"2015-12-24T08:27:04Z","timestamp":1450945624000},"page":"157-168","source":"Crossref","is-referenced-by-count":2,"title":["A Type System for Counting Logs of Multi-threaded Nested Transactional Programs"],"prefix":"10.1007","author":[{"given":"Anh-Hoang","family":"Truong","sequence":"first","affiliation":[]},{"given":"Dang","family":"Van Hung","sequence":"additional","affiliation":[]},{"given":"Duc-Hanh","family":"Dang","sequence":"additional","affiliation":[]},{"given":"Xuan-Tung","family":"Vu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,25]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.tcs.2012.07.032","volume":"458","author":"M Bezem","year":"2012","unstructured":"Bezem, M., Hovland, D., Truong, H.: A type system for counting instances of software components. Theor. Comput. Sci. 458, 29\u201348 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"21_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.5381\/jot.2006.5.5.a2","volume":"5","author":"V Braberman","year":"2006","unstructured":"Braberman, V., Garbervetsky, D., Yovine, S.: A static analysis for synthesizing parametric specifications of dynamic memory consumption. J. Object Technol. 5(5), 31\u201358 (2006)","journal-title":"J. Object Technol."},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/11547662_7","volume-title":"Static Analysis","author":"W-N Chin","year":"2005","unstructured":"Chin, W.-N., Nguyen, H.H., Qin, S.C., Rinard, M.: Memory usage verification for OO programs. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 70\u201386. Springer, Heidelberg (2005)"},{"issue":"1","key":"21_CR4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/640128.604148","volume":"38","author":"Martin Hofmann","year":"2003","unstructured":"Hofmann, M., Jost, S.: Static prediction of heap space usage for first-order functional programs. In: Proceedings of POPL 2003. ACM, January 2003","journal-title":"ACM SIGPLAN Notices"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11693024_3","volume-title":"Programming Languages and Systems","author":"MO Hofmann","year":"2006","unstructured":"Hofmann, M.O., Jost, S.: Type-based amortised heap-space analysis. In: Sestoft, P. (ed.) ESOP 2006. LNCS, vol. 3924, pp. 22\u201337. Springer, Heidelberg (2006)"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.scico.2005.03.001","volume":"57","author":"S Jagannathan","year":"2005","unstructured":"Jagannathan, S., Vitek, J., Welc, A., Hosking, A.: A transactional object calculus. Sci. Comput. Program. 57(2), 164\u2013186 (2005)","journal-title":"Sci. Comput. Program."},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-642-40561-7_15","volume-title":"Software Engineering and Formal Methods","author":"T Mai Thuong Tran","year":"2013","unstructured":"Mai Thuong Tran, T., Steffen, M., Truong, H.: Compositional static analysis for implicit join synchronization in a transactional setting. In: Hierons, R.M., Merayo, M.G., Bravetti, M. (eds.) SEFM 2013. LNCS, vol. 8137, pp. 212\u2013228. Springer, Heidelberg (2013)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Pham, T.-H., Truong, A.-H., Truong, N.-T., Chin, W.-N.: A fast algorithm to compute heap memory bounds of Java Card applets. In: Software Engineering and Formal Methods (2008)","DOI":"10.1109\/SEFM.2008.30"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. In: Symposium on Principles of Distributed Computing, pp. 204\u2013213 (1995)","DOI":"10.1145\/224964.224987"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Vu, X.-T., Mai Thuong Tran, T., Truong, A.-H., Steffen, M.: A type system for finding upper resource bounds of multi-threaded programs with nested transactions. In: Symposium on Information and Communication Technology SoICT 2012, pp. 21\u201330 (2012)","DOI":"10.1145\/2350716.2350722"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Internet Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28034-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T04:34:27Z","timestamp":1559363667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28034-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,25]]},"ISBN":["9783319280332","9783319280349"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28034-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015,12,25]]}}}