{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:48:41Z","timestamp":1725749321717},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642405600"},{"type":"electronic","value":"9783642405617"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40561-7_15","type":"book-chapter","created":{"date-parts":[[2013,9,18]],"date-time":"2013-09-18T09:10:29Z","timestamp":1379495429000},"page":"212-228","source":"Crossref","is-referenced-by-count":3,"title":["Compositional Static Analysis for Implicit Join Synchronization in a Transactional Setting"],"prefix":"10.1007","author":[{"given":"Thi","family":"Mai Thuong Tran","sequence":"first","affiliation":[]},{"given":"Martin","family":"Steffen","sequence":"additional","affiliation":[]},{"given":"Hoang","family":"Truong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Braberman, V., Garbervetsky, D., Yovine, S.: A static analysis for synthesizing parametric specifications of dynamic memory consumption. Journal of Object Technology\u00a05(5) (2006)","DOI":"10.5381\/jot.2006.5.5.a2"},{"key":"15_CR2","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.\u00a03672, pp. 70\u201386. Springer, Heidelberg (2005)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Harris, T., Larus, J.R., Rawja, R.: Transactional Memory, 2nd edn. Morgan & Claypool (2010)","DOI":"10.2200\/S00272ED1V01Y201006CAC011"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Hoffmann, J., Aehlig, K., Hofmann, M.: Multivariate amortized resource analysis. In: Proceedings of POPL 2011. ACM (January 2011)","DOI":"10.1145\/1926385.1926427"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-11957-6_16","volume-title":"Programming Languages and Systems","author":"J. Hoffmann","year":"2010","unstructured":"Hoffmann, J., Hofmann, M.: Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol.\u00a06012, pp. 287\u2013306. Springer, Heidelberg (2010)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Hofmann, M., Jost, S.: Static prediction of heap space usage for first-order functional programs. In: Proceedings of POPL 2003. ACM (January 2003)","DOI":"10.1145\/604131.604148"},{"key":"15_CR7","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":"M. Hofmann","year":"2006","unstructured":"Hofmann, M., Jost, S.: Type-based amortised heap-space analysis. In: Sestoft, P. (ed.) ESOP 2006. LNCS, vol.\u00a03924, pp. 22\u201337. Springer, Heidelberg (2006)"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Hughes, J., Pareto, L., Sabry, A.: Proving the correctness of reactive systems using sized types. In: Proceedings of POPL 1996. ACM (January 1996)","DOI":"10.1145\/237721.240882"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Jagannathan, S., Vitek, J., Welc, A., Hosking, A.: A transactional object calculus. Science of Computer Programming\u00a057(2) (August 2005)","DOI":"10.1016\/j.scico.2005.03.001"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-16265-7_21","volume-title":"Integrated Formal Methods","author":"T. Mai Thuong Tran","year":"2010","unstructured":"Mai Thuong Tran, T., Steffen, M.: Safe commits for Transactional Featherweight Java. In: M\u00e9ry, D., Merz, S. (eds.) IFM 2010. LNCS, vol.\u00a06396, pp. 290\u2013304. Springer, Heidelberg (2010)"},{"key":"15_CR11","unstructured":"Mai Thuong Tran, T., Steffen, M., Truong, H.: Estimating resource bounds for software transactions. Technical report 414, University of Oslo, Dept. of Informatics (December 2011)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Sewell, P., Nardelli, F.Z., Owens, S., Peskine, G., Ridge, T., Sarkar, S., Strni\u0161a, R.: Ott: Effective tool support for the working semanticist. Journal of Functional Programming\u00a020(1) (2010)","DOI":"10.1017\/S0956796809990293"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Shavit, N., Toitu, D.: Software transactional memory. In: 22nd POPL. ACM (January 1995)","DOI":"10.1145\/224964.224987"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/11560647_15","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2005","author":"H. Truong","year":"2005","unstructured":"Truong, H., Bezem, M.: Finding resource bounds in the presence of explicit deallocation. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol.\u00a03722, pp. 227\u2013241. Springer, Heidelberg (2005)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/3-540-36384-X_9","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"L. Unnikrishnan","year":"2003","unstructured":"Unnikrishnan, L., Stoller, S.D., Liu, Y.A.: Optimized live heap bound analysis. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol.\u00a02575, pp. 70\u201385. Springer, Heidelberg (2003)"},{"key":"15_CR16","unstructured":"Xuan, T.V., Anh, H.T., Mai Thuong Tran, T., Steffen, M.: A type system for finding upper resource bounds of multi-threaded programs with nested transactions. In: ACM Proceedings of the 3rd ACM International Symposium on Information and Communication Technology, SoICT, ACM (2012)"}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40561-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T07:49:41Z","timestamp":1558079381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40561-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405600","9783642405617"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40561-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}