{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:45:13Z","timestamp":1725518713103},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540874041"},{"type":"electronic","value":"9783540874058"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-87405-8_15","type":"book-chapter","created":{"date-parts":[[2008,9,17]],"date-time":"2008-09-17T06:48:17Z","timestamp":1221634097000},"page":"211-225","source":"Crossref","is-referenced-by-count":3,"title":["High-Level Programs and Program Conditions"],"prefix":"10.1007","author":[{"given":"Karl","family":"Azab","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annegret","family":"Habel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Heckel, R., Wagner, A.: Ensuring consistency of conditional graph grammars \u2013 a constructive approach. In: SEGRAGRA 1995. ENTCS, vol.\u00a02, pp. 95\u2013104 (1995)","DOI":"10.1016\/S1571-0661(05)80188-4"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2004.11.002","volume":"71","author":"M. Koch","year":"2005","unstructured":"Koch, M., Mancini, L.V., Parisi-Presicce, F.: Graph-based specification of access control policies. Journal of Computer and System Sciences\u00a071, 1\u201333 (2005)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"15_CR3","first-page":"135","volume":"74","author":"H. Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Habel, A., Pennemann, K.H.: Theory of constraints and application conditions: From graphs to high-level structures. Fundamenta Informaticae\u00a074(1), 135\u2013166 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"15_CR4","unstructured":"Habel, A., Pennemann, K.H.: Correctness of high-level transformation systems relative to nested conditions. In: Mathematical Structures in Computer Science (to appear, 2008)"},{"key":"15_CR5","unstructured":"Azab, K., Habel, A.: High-level programs and program conditions (long version). Technical report, University of Oldenburg (2008)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/mana.19790910111","volume":"91","author":"H. Ehrig","year":"1979","unstructured":"Ehrig, H., Kreowski, H.J.: Pushout-properties: An analysis of gluing constructions for graphs. Mathematische Nachrichten\u00a091, 135\u2013149 (1979)","journal-title":"Mathematische Nachrichten"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11841883_31","volume-title":"Graph Transformations","author":"A. Habel","year":"2006","unstructured":"Habel, A., Pennemann, K.H., Rensink, A.: Weakest preconditions for high-level programs. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol.\u00a04178, pp. 445\u2013460. Springer, Heidelberg (2006)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0025714","volume-title":"Graph-Grammars and Their Application to Computer Science and Biology","author":"H. Ehrig","year":"1979","unstructured":"Ehrig, H.: Introduction to the algebraic theory of graph grammars. In: Ng, E.W., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1978. LNCS, vol.\u00a073, pp. 1\u201369. Springer, Heidelberg (1979)"},{"key":"15_CR9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1142\/9789812384720_0003","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"A. Corradini","year":"1997","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Algebraic approaches to graph transformation. Part\u00a0I: Basic concepts and double pushout approach. In: Handbook of Graph Grammars and Computing by Graph Transformation, pp. 163\u2013245. World Scientific, Singapore (1997)"},{"issue":"1","key":"15_CR10","first-page":"31","volume":"74","author":"H. Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamental theory of typed attributed graph transformation based on adhesive HLR-categories. Fundamenta Informaticae\u00a074(1), 31\u201361 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"15_CR11","series-title":"ENTCS","volume-title":"Workshop on Applied and Computational Category Theory (ACCAT 2007)","author":"L. Lambers","year":"2008","unstructured":"Lambers, L., Ehrig, H., Prange, U., Orejas, F.: Parallelism and concurrency in adhesive high-level replacement systems with negative application conditions. In: Workshop on Applied and Computational Category Theory (ACCAT 2007). ENTCS. Elsevier, Amsterdam (to appear, 2008)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-45315-6_15","volume-title":"Foundations of Software Science and Computation Structures","author":"A. Habel","year":"2001","unstructured":"Habel, A., Plump, D.: Computational completeness of programming languages based on graph transformation. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol.\u00a02030, pp. 230\u2013245. Springer, Heidelberg (2001)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11601548_16","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","author":"D. Plump","year":"2005","unstructured":"Plump, D.: Confluence of graph transformation revisited. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol.\u00a03838, pp. 280\u2013308. Springer, Heidelberg (2005)"},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1008734426504","volume":"9","author":"R. Heckel","year":"2001","unstructured":"Heckel, R., Ehrig, H., Wolter, U., Corradini, A.: Double-pullback transitions and coalgebraic loose semantics for graph transformation systems. Applied Categorical Structures\u00a09(1), 83\u2013110 (2001)","journal-title":"Applied Categorical Structures"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11841883_1","volume-title":"Graph Transformations","author":"A. Rensink","year":"2006","unstructured":"Rensink, A.: Nested quantification in graph transformation rules. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol.\u00a04178, pp. 1\u201313. Springer, Heidelberg (2006)"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Lambers, L.: A new version of GTXL: An exchange format for graph transformation systems. In: Proceedings of the International Workshop on Graph-Based Tools (GraBaTs 2004). ENTCS, vol.\u00a0127, pp. 51\u201363 (2005)","DOI":"10.1016\/j.entcs.2004.12.030"},{"key":"15_CR17","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1142\/9789812815149_0012","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"H. G\u00f6ttler","year":"1999","unstructured":"G\u00f6ttler, H.: Deriving productions from productions with an application to picasso\u2019s ceuvre. In: Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a02, pp. 459\u2013484. World Scientific, Singapore (1999)"},{"key":"15_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"15_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/3-540-45744-5_51","volume-title":"Automated Reasoning","author":"B. Beckert","year":"2001","unstructured":"Beckert, B., Schlager, S.: A sequent calculus for first-order dynamic logic with trace modalities. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 626\u2013641. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87405-8_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:37:32Z","timestamp":1606167452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87405-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540874041","9783540874058"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87405-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}