{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T18:10:36Z","timestamp":1769969436007,"version":"3.49.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030167219","type":"print"},{"value":"9783030167226","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-16722-6_9","type":"book-chapter","created":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T02:01:08Z","timestamp":1554343268000},"page":"151-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A Logic-Based Incremental Approach to Graph Repair"],"prefix":"10.1007","author":[{"given":"Sven","family":"Schneider","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leen","family":"Lambers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Orejas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,4]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/1322432.1322433","volume":"40","author":"R Angles","year":"2008","unstructured":"Angles, R., Guti\u00e9rrez, C.: Survey of graph database models. ACM Comput. Surv. 40(1), 1:1\u20131:39 (2008). \n                      https:\/\/doi.org\/10.1145\/1322432.1322433","journal-title":"ACM Comput. Surv."},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Bergmann, G., \u00d6kr\u00f6s, A., R\u00e1th, I., Varr\u00f3, D., Varr\u00f3, G.: Incremental pattern matching in the viatra model transformation system. In: GRaMoT, pp. 25\u201332. ACM (2008). \n                      https:\/\/doi.org\/10.1145\/1402947.1402953","DOI":"10.1145\/1402947.1402953"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-40530-8_11","volume-title":"Graph Transformation","author":"T Beyhl","year":"2016","unstructured":"Beyhl, T., Blouin, D., Giese, H., Lambers, L.: On the operationalization of graph queries with generalized discrimination networks. In: Echahed, R., Minas, M. (eds.) ICGT 2016. LNCS, vol. 9761, pp. 170\u2013186. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-40530-8_11"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Beyhl, T., Giese, H.: Incremental view maintenance for deductive graph databases using generalized discrimination networks. In: GaM@ETAPS, EPTCS, vol. 231, pp. 57\u201371 (2016). \n                      https:\/\/doi.org\/10.4204\/EPTCS.231.5","DOI":"10.4204\/EPTCS.231.5"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Rozenberg [16], pp. 313\u2013400","DOI":"10.1142\/9789812384720_0005"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-319-89363-1_2","volume-title":"Fundamental Approaches to Software Engineering","author":"Z Diskin","year":"2018","unstructured":"Diskin, Z., K\u00f6nig, H., Lawford, M.: Multiple model synchronization with multiary delta lenses. In: Russo, A., Sch\u00fcrr, A. (eds.) FASE 2018. LNCS, vol. 10802, pp. 21\u201337. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-89363-1_2"},{"key":"9_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31188-2","volume-title":"Fundamentals of Algebraic Graph Transformation","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Springer, Heidelberg (2006). \n                      https:\/\/doi.org\/10.1007\/3-540-31188-2"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1017\/S0960129508007202","volume":"19","author":"A Habel","year":"2009","unstructured":"Habel, A., Pennemann, K.: Correctness of high-level transformation systems relative to nested conditions. MSCS 19(2), 245\u2013296 (2009). \n                      https:\/\/doi.org\/10.1017\/S0960129508007202","journal-title":"MSCS"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-030-04771-9_31","volume-title":"Software Technologies: Applications and Foundations","author":"A Habel","year":"2018","unstructured":"Habel, A., Sandmann, C.: Graph repair by graph programs. In: Mazzara, M., Ober, I., Sala\u00fcn, G. (eds.) STAF 2018. LNCS, vol. 11176, pp. 431\u2013446. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-030-04771-9_31"},{"issue":"3","key":"9_CR10","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s10270-014-0437-x","volume":"15","author":"N Macedo","year":"2016","unstructured":"Macedo, N., Cunha, A.: Least-change bidirectional model transformation with QVT-R and ATL. Softw. Syst. Model. 15(3), 783\u2013810 (2016). \n                      https:\/\/doi.org\/10.1007\/s10270-014-0437-x","journal-title":"Softw. Syst. Model."},{"key":"9_CR11","unstructured":"Macedo, N., Tiago, J., Cunha, A.: Systematic literature review of model repair approaches. \n                      http:\/\/tinyurl.com\/hv7eh6h\n                      \n                    . Accessed 14 Nov 2018"},{"issue":"7","key":"9_CR12","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1109\/TSE.2016.2620145","volume":"43","author":"N Macedo","year":"2017","unstructured":"Macedo, N., Tiago, J., Cunha, A.: A feature-based classification of model repair approaches. IEEE Trans. Softw. Eng. 43(7), 615\u2013640 (2017). \n                      https:\/\/doi.org\/10.1109\/TSE.2016.2620145","journal-title":"IEEE Trans. Softw. Eng."},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Ohrndorf, M., Pietsch, C., Kelter, U., Kehrer, T.: Revision: a tool for history-based model repair recommendations. In: ICSE, pp. 105\u2013108. ACM (2018). \n                      https:\/\/doi.org\/10.1145\/3183440.3183498","DOI":"10.1145\/3183440.3183498"},{"key":"9_CR14","unstructured":"Orejas, F., Boronat, A., Ehrig, H., Hermann, F., Sch\u00f6lzel, H.: On propagation-based concurrent model synchronization. ECEASST 57 (2013). \n                      http:\/\/journal.ub.tu-berlin.de\/eceasst\/article\/view\/871"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-30203-2_23","volume-title":"Graph Transformations","author":"A Rensink","year":"2004","unstructured":"Rensink, A.: Representing first-order logic using graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 319\u2013335. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-30203-2_23"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations. World Scientific (1997)","DOI":"10.1142\/9789812384720"},{"issue":"6","key":"9_CR17","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/s10009-018-0496-3","volume":"20","author":"S Schneider","year":"2018","unstructured":"Schneider, S., Lambers, L., Orejas, F.: Automated reasoning for attributed graph properties. STTT 20(6), 705\u2013737 (2018). \n                      https:\/\/doi.org\/10.1007\/s10009-018-0496-3","journal-title":"STTT"},{"key":"9_CR18","unstructured":"Schneider, S., Lambers, L., Orejas, F.: A logic-based incremental approach to graph repair. Technical report, 126, Hasso Plattner Institute at the University of Potsdam, Potsdam, Germany (2019)"},{"key":"9_CR19","unstructured":"Schoenboeck, J., et al.: CARE - A constraint-based approach for re-establishing conformance-relationships. In: APCCM 2014, vol. 154, pp. 19\u201328. Australian Computer Society (2014). \n                      http:\/\/crpit.com\/abstracts\/CRPITV154Schoenboeck.html"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-662-54494-5_16","volume-title":"Fundamental Approaches to Software Engineering","author":"G Taentzer","year":"2017","unstructured":"Taentzer, G., Ohrndorf, M., Lamo, Y., Rutle, A.: Change-preserving model repair. In: Huisman, M., Rubin, J. (eds.) FASE 2017. LNCS, vol. 10202, pp. 283\u2013299. Springer, Heidelberg (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-662-54494-5_16"}],"container-title":["Lecture Notes in Computer Science","Fundamental Approaches to Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16722-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:07:22Z","timestamp":1558343242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-16722-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030167219","9783030167226"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16722-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"4 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Fundamental Approaches to Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fase2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/fase","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"74","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}