{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T04:13:29Z","timestamp":1749615209439,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319467498"},{"type":"electronic","value":"9783319467504"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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-46750-4_6","type":"book-chapter","created":{"date-parts":[[2016,9,21]],"date-time":"2016-09-21T02:11:57Z","timestamp":1474423917000},"page":"82-99","source":"Crossref","is-referenced-by-count":2,"title":["Calculating Statically Maximum Log Memory Used by Multi-threaded Transactional Programs"],"prefix":"10.1007","author":[{"given":"Anh-Hoang","family":"Truong","sequence":"first","affiliation":[]},{"given":"Ngoc-Khai","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Dang","family":"Van Hung","sequence":"additional","affiliation":[]},{"given":"Duc-Hanh","family":"Dang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,22]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1002\/stvr.1569","volume":"25","author":"E Albert","year":"2015","unstructured":"Albert, E., Arenas, P., Fern\u00e1ndez, J.C., Genaim, S., G\u00f3mez-Zamalloa, M., Puebla, G., Rom\u00e1n-D\u00edez, G.: Object-sensitive cost analysis for concurrent objects. Softw. Test. Verification Reliab. 25(3), 218\u2013271 (2015)","journal-title":"Softw. Test. Verification Reliab."},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-10936-7_2","volume-title":"Static Analysis","author":"E Albert","year":"2014","unstructured":"Albert, E., Correas, J., Rom\u00e1n-D\u00edez, G.: Peak cost analysis of distributed systems. In: M\u00fcller-Olm, M., Seidl, H. (eds.) SAS 2014. LNCS, vol. 8723, pp. 18\u201333. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-10936-7_2"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Albert, E., Genaim, S., Gomez-Zamalloa, M.: Heap space analysis for Java bytecode. In: Proceedings of the 6th International Symposium on Memory Management, ISMM 2007, pp. 105\u2013116. ACM, New York (2007)","DOI":"10.1145\/1296907.1296922"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-15640-3_1","volume-title":"Trustworthly Global Computing","author":"D Aspinall","year":"2010","unstructured":"Aspinall, D., Atkey, R., MacKenzie, K., Sannella, D.: Symbolic and analytic techniques for resource analysis of java bytecode. In: Wirsing, M., Hofmann, M., Rauschmayer, A. (eds.) TGC 2010. LNCS, vol. 6084, pp. 1\u201322. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15640-3_1"},{"key":"6_CR5","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 458, 29\u201348 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.scico.2013.11.036","volume":"92","author":"V Braberman","year":"2014","unstructured":"Braberman, V., Garbervetsky, D., Hym, S., Yovine, S.: Summary-based inference of quantitative bounds of live heap objects. Sci. Comput. Program. Part A 92, 56\u201384 (2014). Special issue on Bytecode 2012","journal-title":"Sci. Comput. Program. Part A"},{"issue":"5","key":"6_CR7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.5381\/jot.2006.5.5.a2","volume":"5","author":"VA Braberman","year":"2006","unstructured":"Braberman, V.A., 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":"6_CR8","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., 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). doi: 10.1007\/11547662_7"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-662-46669-8_6","volume-title":"Programming Languages and Systems","author":"J Hoffmann","year":"2015","unstructured":"Hoffmann, J., Shao, Z.: Automatic static cost analysis for parallel programs. In: Vitek, J. (ed.) ESOP 2015. LNCS, vol. 9032, pp. 132\u2013157. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46669-8_6"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Hofmann, M., Jost, S.: Static prediction of heap space usage for first-order functional programs. vol. 38, pp. 185\u2013197. ACM, New York, January 2003","DOI":"10.1145\/640128.604148"},{"issue":"9","key":"6_CR11","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/317765.317785","volume":"34","author":"J Hughes","year":"1999","unstructured":"Hughes, J., Pareto, L.: Recursion and dynamic data-structures in bounded space: towards embedded ML programming. SIGPLAN Not. 34(9), 70\u201381 (1999)","journal-title":"SIGPLAN Not."},{"issue":"2","key":"6_CR12","doi-asserted-by":"crossref","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":"6_CR13","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). doi: 10.1007\/978-3-642-40561-7_15"},{"key":"6_CR14","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: Cerone, A., Gruner, S. (eds.) Sixth IEEE International Conference on Software Engineering and Formal Methods, SEFM 2008, Cape Town, South Africa, 10\u201314 November 2008, pp. 259\u2013267. IEEE Computer Society (2008)","DOI":"10.1109\/SEFM.2008.30"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-319-28034-9_21","volume-title":"Distributed Computing and Internet Technology","author":"A-H Truong","year":"2016","unstructured":"Truong, A.-H., Hung, D., Dang, D.-H., Vu, X.-T.: A type system for counting logs of multi-threaded nested transactional programs. In: Bj\u00f8rner, N., Prasad, S., Parida, L. (eds.) ICDCIT 2016. LNCS, vol. 9581, pp. 157\u2013168. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-28034-9_21"},{"key":"6_CR16","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 2012, SoICT 2012, Halong City, Quang Ninh, Viet Nam, 23\u201324 August 2012, pp. 21\u201330 (2012)","DOI":"10.1145\/2350716.2350722"},{"issue":"9","key":"6_CR17","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1145\/361002.361016","volume":"18","author":"B Wegbreit","year":"1975","unstructured":"Wegbreit, B.: Mechanical program analysis. Commun. ACM 18(9), 528\u2013539 (1975)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46750-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T20:22:15Z","timestamp":1749586935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46750-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319467498","9783319467504"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46750-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}