{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:06:44Z","timestamp":1725746804151},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402128"},{"type":"electronic","value":"9783642402135"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40213-5_1","type":"book-chapter","created":{"date-parts":[[2013,8,29]],"date-time":"2013-08-29T09:26:23Z","timestamp":1377768383000},"page":"1-16","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Unbounded Allocation in Bounded Heaps"],"prefix":"10.1007","author":[{"given":"Jurriaan","family":"Rot","sequence":"first","affiliation":[]},{"given":"Frank","family":"de Boer","sequence":"additional","affiliation":[]},{"given":"Marcello","family":"Bonsangue","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,8,30]]},"reference":[{"key":"1_CR1","unstructured":"Abdulla, P.A., Atig, M.F., Delzanno, G., Podelski, A.: Push-Down Automata with Gap-Order Constraints. In: Arbab, F., Sirjani, M. (eds.) FSEN 2013. LNCS, vol. 8161, pp. 191\u2013206. Springer, Heidelberg (2013)."},{"key":"1_CR2","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135\u2013150. Springer, Heidelberg (1997)."},{"key":"1_CR3","unstructured":"Bouajjani, A., Fratani, S., Qadeer, S.: Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 207\u2013220. Springer, Heidelberg (2007)."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Corbett, J., Dwyer, M.B., Hatcliff, J., Laubach, S., P\u01ces\u0103reanu, C.S., Robby, Zheng, H.: Bandera: Extracting finite-state models from Java source code. In: Proc. of Int. Conf. on Software Engineering, pp. 439\u2013448. IEEE (2000).","DOI":"10.1145\/337180.337234"},{"issue":"7","key":"1_CR5","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1002\/(SICI)1097-024X(199906)29:7<577::AID-SPE246>3.0.CO;2-V","volume":"29","author":"C Demartini","year":"1999","unstructured":"Demartini, C., Iosif, R., Sisto, R.: A deadlock detection tool for concurrent Java programs. Software-Practice and Experience 29(7), 577\u2013603 (1999).","journal-title":"Software-Practice and Experience"},{"key":"1_CR6","unstructured":"Distefano, D., Katoen, J.-P., Rensink, A.: Who is Pointing When to Whom? In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 250\u2013262. Springer, Heidelberg (2004)."},{"key":"1_CR7","unstructured":"Esparza, J., Schwoon, S.: A BDD-based model checker for recursive programs. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 324\u2013336. Springer, Heidelberg (2001)."},{"key":"1_CR8","unstructured":"Havelund, K., Pressburger, T.: Model checking Java programs using Java PathFinder. Int. Jour. on Softw. Tools for Technology Transfer 2(4), 366\u2013381 (2000)."},{"key":"1_CR9","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall (1967)."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Park, D., Stern, U., Skakkebaek, J., Dill, D.: Java Model Checking. In: Proc. of the 15th Int. Conf. on Automated Software Engineering, pp. 253\u2013256. IEEE (2000).","DOI":"10.1109\/ASE.2000.873671"},{"key":"1_CR11","unstructured":"Rot, J., Asavoae, I.M., de Boer, F., Bonsangue, M.M., Lucanu, D.: Interacting via the Heap in the Presence of Recursion. In: Proc. of the 5th Interaction and Concurrency Experience, ICE 2012. EPTCS, vol. 104, pp. 99\u2013113 (2012)."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40213-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T02:13:25Z","timestamp":1558318405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40213-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402128","9783642402135"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40213-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"30 August 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}