{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:55:42Z","timestamp":1725584142522},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212536"},{"type":"electronic","value":"9783642212543"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21254-3_25","type":"book-chapter","created":{"date-parts":[[2011,5,27]],"date-time":"2011-05-27T05:38:04Z","timestamp":1306474684000},"page":"323-335","source":"Crossref","is-referenced-by-count":9,"title":["A Local Greibach Normal Form for Hyperedge Replacement Grammars"],"prefix":"10.1007","author":[{"given":"Christina","family":"Jansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Heinen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joost-Pieter","family":"Katoen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Noll","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-24771-5_5","volume-title":"Relational and Kleene-Algebraic Methods in Computer Science","author":"A. Bakewell","year":"2004","unstructured":"Bakewell, A., Plump, D., Runciman, C.: Checking the shape safety of pointer manipulations. In: Berghammer, R., M\u00f6ller, B., Struth, G. (eds.) RelMiCS 2003. LNCS, vol.\u00a03051, pp. 48\u201361. Springer, Heidelberg (2004)"},{"key":"25_CR2","first-page":"37","volume":"149","author":"A. Bouajjani","year":"2006","unstructured":"Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract Regular Tree Model Checking. ENTCS\u00a0149, 37\u201348 (2006)","journal-title":"ENTCS"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11804192_14","volume-title":"Formal Methods for Components and Objects","author":"D. Distefano","year":"2006","unstructured":"Distefano, D., Katoen, J.P., Rensink, A.: Safety and liveness in concurrent pointer programs. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol.\u00a04111, pp. 280\u2013312. Springer, Heidelberg (2006)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-540-87405-8_40","volume-title":"Graph Transformations","author":"M. Dodds","year":"2008","unstructured":"Dodds, M.: From Separation Logic to Hyperedge Replacement and Back. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol.\u00a05214, pp. 484\u2013486. Springer, Heidelberg (2008)"},{"key":"25_CR5","first-page":"1594","volume":"7","author":"S. Dumitrescu","year":"2008","unstructured":"Dumitrescu, S.: Several Aspects of Context Freeness for Hyperedge Replacement Grammars. W. Trans. on Comp.\u00a07, 1594\u20131604 (2008)","journal-title":"W. Trans. on Comp."},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/3-540-55719-9_70","volume-title":"Automata, Languages and Programming","author":"J. Engelfriet","year":"1992","unstructured":"Engelfriet, J.: A Greibach Normal Form for Context-free Graph Grammars. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 138\u2013149. Springer, Heidelberg (1992)"},{"key":"25_CR7","volume-title":"Hyperedge Replacement: Grammars and Languages","author":"A. Habel","year":"1992","unstructured":"Habel, A.: Hyperedge Replacement: Grammars and Languages. Springer, New York (1992)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Heinen, J., Noll, T., Rieger, S.: Juggrnaut: Graph Grammar Abstraction for Unbounded Heap Structures. In: TTSS 2009 (2009) (to be published in ENTCS)","DOI":"10.1016\/j.entcs.2011.07.001"},{"key":"25_CR9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1017\/S0960129501003528","volume":"12","author":"R. Klempien-Hinrichs","year":"2002","unstructured":"Klempien-Hinrichs, R.: Normal Forms for Context-Free Node-Rewriting Hypergraph Grammars. Math. Structures in Comp. Sci.\u00a012, 135\u2013148 (2002)","journal-title":"Math. Structures in Comp. Sci."},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"O\u2019Hearn, P.W., Hongseok, Y., Reynolds, J.C.: Separation and Information Hiding. In: POPL 2004, vol.\u00a039, pp. 268\u2013280 (2004)","DOI":"10.1145\/982962.964024"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-24725-8_28","volume-title":"Programming Languages and Systems","author":"A. Rensink","year":"2004","unstructured":"Rensink, A.: Canonical Graph Shapes. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol.\u00a02986, pp. 401\u2013415. Springer, Heidelberg (2004)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-540-25959-6_41","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"A. Rensink","year":"2004","unstructured":"Rensink, A.: Summary from the Outside In. In: Pfaltz, J.L., Nagl, M., B\u00f6hlen, B. (eds.) AGTIVE 2003. LNCS, vol.\u00a03062, pp. 486\u2013488. Springer, Heidelberg (2004)"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Rensink, A., Distefano, D.: Abstract Graph Transformation. In: SVV 2005, vol.\u00a0157, pp. 39\u201359 (2006)","DOI":"10.1016\/j.entcs.2006.01.022"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Separation Logic: A Logic for Shared Mutable Data Structures. In: LICS 2002, pp. 55\u201374 (2002)","DOI":"10.1109\/LICS.2002.1029817"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-87405-8_6","volume-title":"Graph Transformations","author":"S. Rieger","year":"2008","unstructured":"Rieger, S., Noll, T.: Abstracting Complex Data Structures by Hyperedge Replacement. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol.\u00a05214, pp. 69\u201383. Springer, Heidelberg (2008)"},{"key":"25_CR16","doi-asserted-by":"publisher","DOI":"10.1142\/3303","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"G. Rozenberg","year":"1997","unstructured":"Rozenberg, G.: Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a01. World Scientific Publishing Co., Inc., River Edge (1997)"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/S0019-9958(86)80045-6","volume":"69","author":"G. Rozenberg","year":"1986","unstructured":"Rozenberg, G., Welzl, E.: Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity. Inf. Control\u00a069, 136\u2013167 (1986)","journal-title":"Inf. Control"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/514188.514190","volume":"24","author":"M. Sagiv","year":"2002","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Parametric Shape Analysis via 3-Valued Logic. ACM Trans. Program. Lang. Syst.\u00a024, 217\u2013298 (2002)","journal-title":"ACM Trans. Program. Lang. Syst."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21254-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T03:11:08Z","timestamp":1560222668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21254-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212536","9783642212543"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21254-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}