{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:18:37Z","timestamp":1771697917203,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540610533","type":"print"},{"value":"9783540499398","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61053-7_57","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:13:37Z","timestamp":1330290817000},"page":"121-135","source":"Crossref","is-referenced-by-count":12,"title":["How to uniformly specify program analysis and transformation with graph rewrite systems"],"prefix":"10.1007","author":[{"given":"Uwe","family":"A\u00dfmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"9_CR1","volume-title":"PhD thesis","author":"U. A\u00dfmann","year":"1995","unstructured":"Uwe A\u00dfmann. Generierung von Programmoptimierungen mit Graphersetzungssystemen. PhD thesis, Universit\u00e4t Karlsruhe, Kaiserstr. 12, 76128 Karlsruhe, Germany, July 1995."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Uwe A\u00dfmann. On Edge Addition Rewrite Systems and Their Relevance to Program Analysis. In J. Cuny, editor, 5th Workshop on Graph Grammars and Their Application To Computer Science, to appear in Lecture Notes in Computer Science. Springer, 1995.","DOI":"10.1007\/3-540-61228-9_96"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"M. Alt, U. A\u00dfmann, and H. van Someren. Cosy Compiler Phase Embedding with the CoSy Compiler Model. In P. A. Fritzson, editor, Compiler Construction, Lecture Notes in Computer Science 786, pages 278\u2013293. Springer Verlag, April 1994.","DOI":"10.1007\/3-540-57877-3_19"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"M. Alt and F. Martin. Generation of efficient interprocedural analyzers with pag. In A. Mycroft, editor, Static Analysis Symposium, volume to appear of Lecture Notes in Computer Science, Spinger Verlag. Springer Verlag, 1995.","DOI":"10.1007\/3-540-60360-3_31"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Heiko D\u00f6rr. Efficient Graph Rewriting and Its Implementation, volume 922 of Lecture Notes in Computer Science, Spinger Verlag. Springer Verlag, 1995.","DOI":"10.1007\/BFb0031909"},{"issue":"5","key":"9_CR6","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/42411.42414","volume":"31","author":"D. Harel","year":"1988","unstructured":"D. Harel. On visual formalisms. Communications of the ACM, 31(5):514\u2013530, May 1988.","journal-title":"Communications of the ACM"},{"key":"9_CR7","volume-title":"Flow Analysis of Computer Programs","author":"M. S. Hecht","year":"1977","unstructured":"M. S. Hecht. Flow Analysis of Computer Programs. Elsevier North-Holland, 1977."},{"key":"9_CR8","unstructured":"Gerd Kock. Spezifikation und Verifikation von Optimierungsalgorithmen. GMD Bericht 201, Universit\u00e4t Karlsruhe, 1992."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"J. Knoop, O. R\u00fcthing, and B. Steffen. Optimal code motion: Theory and practice. Transactions on Programming Languages and Systems, 16(7), July 1994.","DOI":"10.1145\/183432.183443"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Thomas Reps. Solving Demand Versions of Interprocedural Analysis Problems. In P.A. Fritzson, editor, Compiler Construction, volume 786 of Lecture Notes in Computer Science, pages 389\u2013403, April 1994.","DOI":"10.1007\/3-540-57877-3_26"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In ACM Symposium on Principles of Programming Languages, volume 22, pages 49\u201361. ACM, January 1995.","DOI":"10.1145\/199448.199462"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"A. Sch\u00fcrr. Introduction to PROGRES, an Attribute Graph Grammar Based Specification Language. In Graph-Theoretic Concepts in Computer Science, volume 541 of Lecture Notes in Computer Science, pages 444\u2013458. Springer Verlag, 1990.","DOI":"10.1007\/3-540-52292-1_11"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Bernhard Steffen. Data flow analysis as model checking. In Proceedings of Theoretical Aspects of Computer Software (TACS), pages 346\u2013364, 1991.","DOI":"10.1007\/3-540-54415-1_54"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"S. W. K. Tjiang and J. L. Henessy. Sharlit \u2014 A tool for building optimizers. SIGPLAN Conference on Programming Language Design and Implementation, 1992.","DOI":"10.1145\/143095.143120"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"G. A. Venkatesh. A Framework for Construction and Evaluation of High-Level Specifications for Program Analysis Techniques. In ACM SIGPLAN Conference on Programming Language Design and Implementation, June 1989.","DOI":"10.1145\/73141.74819"},{"key":"9_CR16","first-page":"54","volume-title":"Modula-P, a language for parallel programming: Definition and implementation on a transputer network","author":"J. Vollmer","year":"1992","unstructured":"J\u00fcrgen Vollmer and Ralf Hoffart. Modula-P, a language for parallel programming: Definition and implementation on a transputer network. In Proceedings of the 1992 International Conference on Computer Languages ICCL'92, Oakland, California, pages 54\u201364. IEEE, IEEE Computer Society Press, April 1992."},{"key":"9_CR17","unstructured":"H.R. Walters, J.F.Th. Kamperman, and T.B. Dinesh. An extensible language for the generation of parallel data manipulation and control packages. In P. Fritzson, editor, Proceedings of the Poster Session of Compiler Construction, number LiTH-IDA-R-94-11 in PELAB Research Report. Link\u00f6ping University, 1994."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"D. Whitfield and M. L. Soffa. An approach to ordering optimizing transformations. In ACM Conference on Principles and Practice of Parallel Programming (PPOPP), 1990.","DOI":"10.1145\/99163.99179"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61053-7_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:50Z","timestamp":1605647030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61053-7_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540610533","9783540499398"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-61053-7_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}