{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:53:38Z","timestamp":1762458818577},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540213130"},{"type":"electronic","value":"9783540247258"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24725-8_28","type":"book-chapter","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T20:15:44Z","timestamp":1280261744000},"page":"401-415","source":"Crossref","is-referenced-by-count":32,"title":["Canonical Graph Shapes"],"prefix":"10.1007","author":[{"given":"Arend","family":"Rensink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"volume-title":"The Description Logic Handbook: Theory, Implementation and Applications","year":"2003","unstructured":"Baader, F. (ed.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)","key":"28_CR1"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-44898-5_14","volume-title":"Static Analysis","author":"P. Baldan","year":"2003","unstructured":"Baldan, P., K\u00f6nig, B., K\u00f6nig, B.: A logic for analyzing abstractions of graph transformation systems. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 255\u2013272. Springer, Heidelberg (2003)"},{"key":"28_CR3","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., Sagiv, M.: A decidable logic for describing linked data structures. In: Swierstra, S.D. (ed.) ESOP 1999. LNCS, vol.\u00a01576, pp. 2\u201319. Springer, Heidelberg (1999)"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45465-9_51","volume-title":"Automata, Languages and Programming","author":"L. Cardelli","year":"2002","unstructured":"Cardelli, L., Gardner, P., Ghelli, G.: A Spatial Logic for Querying Graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 597\u2013610. Springer, Heidelberg (2002)"},{"key":"28_CR5","first-page":"193","volume-title":"Handbook of Theoretical Computer Science","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0A, pp. 193\u2013239. Elsevier, Amsterdam (1990)"},{"key":"28_CR6","series-title":"IFIP Conference Proceedings","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/978-0-387-35608-2_36","volume-title":"Foundations of Information Technology in the Era of Network and Mobile Computing","author":"D. Distefano","year":"2002","unstructured":"Distefano, D., Rensink, A., Katoen, J.-P.: Model checking birth and death. In: Baeza-Yates, R., Montanari, U., Santoro, N. (eds.) Foundations of Information Technology in the Era of Network and Mobile Computing. IFIP Conference Proceedings, vol.\u00a0223, pp. 435\u2013447. Kluwer Academic Publishers, Dordrecht (2002)"},{"unstructured":"Distefano, D., Rensink, A., Katoen, J.-P.: Who is pointing when to whom: On model-checking pointer structures. CTIT Technical Report TR\u2013CTIT\u201303\u201312, Department of Computer Science, University of Twente (September 2003)","key":"28_CR7"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-39958-2_2","volume-title":"Formal Methods for Open Object-Based Distributed Systems","author":"P.L. Ferreira","year":"2003","unstructured":"Ferreira, P.L., Ribeiro, L.: Towards object-oriented graphs and grammars. In: Najm, E., Nestmann, U., Stevens, P. (eds.) FMOODS 2003. LNCS, vol.\u00a02884, pp. 16\u201331. Springer, Heidelberg (2003)"},{"key":"28_CR9","first-page":"27","volume-title":"Principles of Programming Languages","author":"P. Fradet","year":"1997","unstructured":"Fradet, P., Le M\u00e9tayer, D.: Shape types. In: Principles of Programming Languages, pp. 27\u201339. ACM Press, New York (1997)"},{"issue":"1","key":"28_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/421196","volume":"3","author":"E. Gr\u00e4del","year":"1997","unstructured":"Gr\u00e4del, E., Kolatis, P.G., Vardi, M.Y.: On the decision problem for two-variable first-order logic. The Bulletin of Symbolic Logic\u00a03(1), 53\u201369 (1997)","journal-title":"The Bulletin of Symbolic Logic"},{"unstructured":"Gr\u00e4del, E., Otto, M., Rosen, E.: Two-variable logic with counting is decidable. In: Logic in Computer Science, pp. 306\u2013317. Computer Society Press (1997)","key":"28_CR11"},{"key":"28_CR12","first-page":"196","volume-title":"Principles of Programming Languages","author":"N. Klarlund","year":"1993","unstructured":"Klarlund, N., Schwartzbach, M.I.: Graph types. In: Principles of Programming Languages, January 1993, pp. 196\u2013205. ACM Press, New York (1993)"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/malq.19750210118","volume":"21","author":"M. Mortimer","year":"1975","unstructured":"Mortimer, M.: On languages with two variables. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a021, 135\u2013140 (1975)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"28_CR14","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)"},{"issue":"4","key":"28_CR15","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"C.H. Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.H.: On the complexity of integer programming. J. ACM\u00a028(4), 765\u2013768 (1981)","journal-title":"J. ACM"},{"unstructured":"Rensink, A.: A logic of local graph shapes. CTIT Technical Report TR\u2013CTIT\u201303\u2013 35, Faculty of Informatics, University of Twente (August 2003)","key":"28_CR16"},{"unstructured":"Reynolds, J.: Separation logic: A logic for shared mutable data structures. In: Logic in Computer Science. Computer Society Press (2002)","key":"28_CR17"},{"issue":"1","key":"28_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/271510.271517","volume":"20","author":"M. Sagiv","year":"1998","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Solving shape-analysis problems in languages with destructive updating. ACM Trans. Prog. Lang. Syst.\u00a020(1), 1\u201350 (1998)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"28_CR19","first-page":"477","volume":"27","author":"D. Scott","year":"1962","unstructured":"Scott, D.: A decision method for validity of sentences in two variables. J. Symb. Log.\u00a027, 477 (1962)","journal-title":"J. Symb. Log."},{"key":"28_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-45931-6_28","volume-title":"Foundations of Software Science and Computation Structures","author":"H. Yang","year":"2002","unstructured":"Yang, H., O\u2019Hearn, P.: A semantic basis for local reasoning. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 402\u2013416. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24725-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T08:20:28Z","timestamp":1552810828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24725-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540213130","9783540247258"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24725-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}