{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:48:44Z","timestamp":1725544124061},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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_23","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T09:22:26Z","timestamp":1143537746000},"page":"350-364","source":"Crossref","is-referenced-by-count":8,"title":["Automata-Based Verification of Programs with Tree Updates"],"prefix":"10.1007","author":[{"given":"Peter","family":"Habermehl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radu","family":"Iosif","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomas","family":"Vojnar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","volume-title":"Proceedings of STOC 2004","author":"R. Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Visibly Pushdown Languages. In: Proceedings of STOC 2004. ACM Press, New York (2004)"},{"key":"23_CR2","unstructured":"Baldan, P., Corradini, A., Esparza, J., Heindel, T., K\u00f6nig, B., Kozioura, V.: Verifying Red-Black Trees. In: Proc. of COSMICAH (2005)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","first-page":"421","volume-title":"CONCUR\u201997: Concurrency Theory","author":"A. Bouajjani","year":"1997","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.\u00a01243, p. 421. Springer, Heidelberg (1997)"},{"key":"23_CR4","volume-title":"Proceedings of POPL 2005","author":"C. Calcagno","year":"2005","unstructured":"Calcagno, C., Gardner, P., Zarfaty, U.: Context Logic and Tree Update. In: Proceedings of POPL 2005. ACM Press, New York (2005)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Comon, H., Cortier, V.: Tree Automata with One Memory, Set Constraints and Cryptographic Protocols. Theoretical Computer Science\u00a0331 (2005)","DOI":"10.1016\/j.tcs.2004.09.036"},{"key":"23_CR6","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. Release on October 1, 2002 (1997), Available on http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"23_CR7","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press, Cambridge (1990)"},{"key":"23_CR8","unstructured":"Dal Zilio, S., Lugiez, D.: Multitrees Automata, Presburger\u2019s Constraints and Tree Logics. Technical Report 08-2002, LIF (2002)"},{"key":"23_CR9","unstructured":"Geidmanis, D.: Unsolvability of the Emptiness Problem for Alternating 1-way Multi-head and Multi-tape Finite Automata over Single-letter Alphabet. In: Computers and Artificial Intelligence, vol.\u00a010 (1991)"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Habermehl, P., Iosif, R., Vojnar, T.: Automata-based Verification of Programs with Tree Updates. Technical Report TR-2005-16, Verimag (2005)","DOI":"10.1007\/11691372_23"},{"key":"23_CR11","volume-title":"Proceeedings of PLDI 2001","author":"A. Moeller","year":"2001","unstructured":"Moeller, A., Schwartzbach, M.: The Pointer Assertion Logic Engine. In: Proceeedings of PLDI 2001. ACM Press, New York (2001)"},{"key":"23_CR12","unstructured":"Parduhn, S.: Algorithm Animation Using Shape Analysis with Special Regard to Binary Trees. Technical report, Universit at des Saarlandes (2005)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","first-page":"686","volume-title":"Automata, Languages and Programming","author":"H. Petersen","year":"1995","unstructured":"Petersen, H.: Alternation in Simple Devices. In: F\u00fcl\u00f6p, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol.\u00a0944, p. 686. Springer, Heidelberg (1995)"},{"key":"23_CR14","unstructured":"Presburger, M.: \u00dcber die Vollstandigkeit eines Gewissen Systems der Arithmetik. Comptes Rendus du I Congr\u2019es des Pays Slaves, Warsaw (1929)"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Decidability of Second Order Theories and Automata on Infinite Trees. Transactions of American Mathematical Society\u00a0141 (1969)","DOI":"10.2307\/1995086"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-27864-1_18","volume-title":"Static Analysis","author":"R. Rugina","year":"2004","unstructured":"Rugina, R.: Quantitative Shape Analysis. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol.\u00a03148, pp. 228\u2013245. Springer, Heidelberg (2004)"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Sagiv, S., Reps, T.W., Wilhelm, R.: Parametric Shape Analysis via 3-Valued Logic. TOPLAS\u00a024(3) (2002)","DOI":"10.1145\/514188.514190"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1007\/978-3-540-27836-8_94","volume-title":"Automata, Languages and Programming","author":"H. Seidl","year":"2004","unstructured":"Seidl, H., Schwentick, T., Muscholl, A., Habermehl, P.: Counting in Trees for Free. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1136\u20131149. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11691372_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,25]],"date-time":"2021-07-25T02:38:31Z","timestamp":1627180711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11691372_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330561","9783540330578"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11691372_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}