{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:39:55Z","timestamp":1743104395918,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540330561"},{"type":"electronic","value":"9783540330578"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11691372_2","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T14:22:26Z","timestamp":1143555746000},"page":"27-41","source":"Crossref","is-referenced-by-count":9,"title":["Automatic Verification of Parameterized Data Structures"],"prefix":"10.1007","author":[{"given":"Jyotirmoy V.","family":"Deshmukh","sequence":"first","affiliation":[]},{"given":"E. Allen","family":"Emerson","sequence":"additional","affiliation":[]},{"given":"Prateek","family":"Gupta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-49099-X_2","volume-title":"Programming Languages and Systems","author":"M. Benedikt","year":"1999","unstructured":"Benedikt, M., Reps, T.W., Sagiv, S.: A DecidableLogic for Describing Linked Data Structures. In: Swierstra, S.D. (ed.) ESOP 1999. LNCS, vol.\u00a01576, pp. 2\u201319. Springer, Heidelberg (1999)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-31980-1_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Bouajjani","year":"2005","unstructured":"Bouajjani, A., Habermehl, P., Moro, P., Vojnar, T.: Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 13\u201329. Springer, Heidelberg (2005)"},{"key":"2_CR3","unstructured":"Carton, O.: Chain Automata. In: IFIPWorld Computer Congress, Hamburg, pp. 451\u2013458. Elsevier, North-Holland (1994)"},{"key":"2_CR4","unstructured":"Emerson, E.A., Jutla, C.S.: The Complexity of Tree Automata and Logics of Programs. In: Proceedings of 29th IEEE Foundations of Computer Science, 1988 (FOCS 1988), pp. 328\u2013337 (1988)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-46002-0_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E.A. Emerson","year":"2002","unstructured":"Emerson, E.A., Kahlon, V.: Model Checking Large-Scale and Parameterized Resource Allocation Systems. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, pp. 251\u2013265. Springer, Heidelberg (2002)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla, C.S.: Tree Automata, Mu-Calculus andDetermi-nacy (Extended Abstract). In: Proceedings of Foundations of Computer Sci-ence (FOCS 1991), pp. 368\u2013377 (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/3-540-15648-8_7","volume-title":"Logics of Programs","author":"E. Allen Emerson","year":"1985","unstructured":"Allen Emerson, E.: Automata, Tableaux, and Temporal Logics. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol.\u00a0193, pp. 79\u201388. Springer, Heidelberg (1985)"},{"key":"2_CR8","series-title":"Languages and Computation","volume-title":"Introduction to Automata Theory","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory. Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"2_CR9","unstructured":"Lev-Ami, T., Reps, T.W., Sagiv, S., Wilhelm, R.: Putting static analysis to work for verification: A case study. In: International Symposium on Software Testing and Analysis, 2000 (ISSTA 2000), pp. 26\u201338 (2000)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"M\u00f8ller, A., Schwartzbach, M.I.: The Pointer Assertion Logic Engine. In: Proceedings of SIGPLAN Conference on Programming Languages Design and Implementation (PLDI 2001), pp. 221\u2013231 (2001)","DOI":"10.1145\/381694.378851"},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"15","author":"F. Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Transactions on Computational Logic (TOCL),\u00a015(3), 403\u2013435 (2004)","journal-title":"ACM Transactions on Computational Logic (TOCL),"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44802-0_1","volume-title":"Computer Science Logic","author":"P. O\u2019Hearn","year":"2001","unstructured":"O\u2019Hearn, P., Reynolds, J., Yang, H.: Local Reasoning about Programs that Alter Data Structures. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 1\u201319. Springer, Heidelberg (2001)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Separation Logic: A Logic for Shared MutableData Structures. In: Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS), pp. 55\u201374 (2002)","DOI":"10.1109\/LICS.2002.1029817"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Rosenberg, A.L.: On multi-head finite automata. In: FOCS, pp. 221\u2013228 (1965)","DOI":"10.1109\/FOCS.1965.19"},{"key":"2_CR15","unstructured":"Schnoebelen, P.: The complexity of temporal logic model checking. In: Advances in Modal Logic, papers from 4th International Workshop on Advances in Modal Logic 2002, Toulouse, France, September-October (2002)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. In: Symposium on Principles of Programming Languages, POPL 1999 (1999)","DOI":"10.1145\/292540.292552"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11691372_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T04:53:36Z","timestamp":1736312016000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11691372_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330561","9783540330578"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11691372_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}