{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:26:20Z","timestamp":1742930780206,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662544938"},{"type":"electronic","value":"9783662544945"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-54494-5_11","type":"book-chapter","created":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T00:09:02Z","timestamp":1490141342000},"page":"191-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Inter-model Consistency Checking Using Triple Graph Grammars and Linear Optimization Techniques"],"prefix":"10.1007","author":[{"given":"Erhan","family":"Leblebici","sequence":"first","affiliation":[]},{"given":"Anthony","family":"Anjorin","sequence":"additional","affiliation":[]},{"given":"Andy","family":"Sch\u00fcrr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,22]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-28872-2_14","volume-title":"Fundamental Approaches to Software Engineering","author":"J Bradfield","year":"2012","unstructured":"Bradfield, J., Stevens, P.: Recursive checkonly QVT-R transformations with general when and where clauses via the modal Mu calculus. In: Lara, J., Zisman, A. (eds.) FASE 2012. LNCS, vol. 7212, pp. 194\u2013208. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-28872-2_14"},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5381\/jot.2013.12.1.a1","volume":"12","author":"G Callow","year":"2013","unstructured":"Callow, G., Kalawsky, R.: A satisficing bi-directional model transformation engine using mixed integer linear programming. J. Object Technol. 12(1), 1\u201343 (2013)","journal-title":"J. Object Technol."},{"key":"11_CR3","unstructured":"Cheney, J., McKinna, J., Stevens, P., Gibbons, J.: Towards a repository of BX examples. In: Candan, K.S., Amer-Yahia, S., Schweikardt, N., Christophides, V., Leroy, V. (eds.) BX 2014. CEUR Workshop Proceedings, vol. 1133, pp. 87\u201391 (2014). CEUR-WS.org"},{"key":"11_CR4","first-page":"1","volume":"10","author":"H Ehrig","year":"2008","unstructured":"Ehrig, H., Ehrig, K., Hermann, F.: From model transformation to model integration based on the algebraic approach to triple graph grammars. ECEASST 10, 1\u201315 (2008)","journal-title":"ECEASST"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-31984-9_5","volume-title":"Fundamental Approaches to Software Engineering","author":"H Ehrig","year":"2005","unstructured":"Ehrig, H., Ehrig, K., Lara, J., Taentzer, G., Varr\u00f3, D., Varr\u00f3-Gyapay, S.: Termination criteria for model transformation. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol. 3442, pp. 49\u201363. Springer, Heidelberg (2005). doi:10.1007\/978-3-540-31984-9_5"},{"key":"11_CR6","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","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. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006)"},{"key":"11_CR7","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47980-3","volume-title":"Graph and Model Transformation - General Framework and Applications","author":"H Ehrig","year":"2015","unstructured":"Ehrig, H., Ermel, C., Golas, U., Hermann, F.: Graph and Model Transformation - General Framework and Applications. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2015)"},{"key":"11_CR8","first-page":"1","volume":"54","author":"C Ermel","year":"2012","unstructured":"Ermel, C., Hermann, F., Gall, J., Binanzer, D.: Visual modeling and analysis of EMF model transformations based on triple graph grammars. ECEASST 54, 1\u201312 (2012)","journal-title":"ECEASST"},{"key":"11_CR9","first-page":"212","volume":"2012","author":"AB Fadhel","year":"2012","unstructured":"Fadhel, A.B., Kessentini, M., Langer, P., Wimmer, M.: Search-based detection of high-level model changes. ICSM 2012, 212\u2013221 (2012)","journal-title":"ICSM"},{"key":"11_CR10","unstructured":"Fleck, M., Troya, J., Wimmer, M.: Marrying search-based optimization and model transformation technology. In: Proceedings of NasBASE (2015)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-42064-6_6","volume-title":"Theory and Practice of Model Transformations","author":"M Fleck","year":"2016","unstructured":"Fleck, M., Troya, J., Wimmer, M.: Search-based model transformations with MOMoT. In: Van Gorp, P., Engels, G. (eds.) ICMT 2016. LNCS, vol. 9765, pp. 79\u201387. Springer, Cham (2016). doi:10.1007\/978-3-319-42064-6_6"},{"issue":"1","key":"11_CR12","doi-asserted-by":"crossref","first-page":"73","DOI":"10.3233\/FI-2011-618","volume":"114","author":"E Guerra","year":"2012","unstructured":"Guerra, E., de Lara, J.: An algebraic semantics for QVT-relations check-only transformations. Fundam. Inform. 114(1), 73\u2013101 (2012)","journal-title":"Fundam. Inform."},{"key":"11_CR13","unstructured":"Gurobi: (2016). http:\/\/www.gurobi.com\/"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10270-012-0309-1","volume":"14","author":"F Hermann","year":"2015","unstructured":"Hermann, F., Ehrig, H., Orejas, F., Czarnecki, K., Diskin, Z., Xiong, Y., Gottmann, S., Engel, T.: Model synchronization based on triple graph grammars: correctness, completeness and invertibility. Softw. Syst. Model. 14(1), 241\u2013269 (2015)","journal-title":"Softw. Syst. Model."},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-87875-9_12","volume-title":"Model Driven Engineering Languages and Systems","author":"M Kessentini","year":"2008","unstructured":"Kessentini, M., Sahraoui, H., Boukadoum, M.: Model transformation as an optimization problem. In: Czarnecki, K., Ober, I., Bruel, J.-M., Uhl, A., V\u00f6lter, M. (eds.) MODELS 2008. LNCS, vol. 5301, pp. 159\u2013173. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-87875-9_12"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Ko, H., Zan, T., Hu, Z.: BiGUL: a formally verified core language for putback-based bidirectional programming. In: Erwig, M., Rompf, T. (eds.) PEPM 2016, pp. 61\u201372 (2016)","DOI":"10.1145\/2847538.2847544"},{"key":"11_CR17","unstructured":"Leblebici, E.: Towards a graph grammar-based approach to inter-model consistency checks with traceability support. In: Anjorin, A., Gibbons, J. (eds.) BX 2016. CEUR Workshop Proceedings, vol. 1571, pp. 35\u201339 (2016). CEUR-WS.org"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-37057-1_22","volume-title":"Fundamental Approaches to Software Engineering","author":"N Macedo","year":"2013","unstructured":"Macedo, N., Cunha, A.: Implementing QVT-R bidirectional model transformations using alloy. In: Cortellessa, V., Varr\u00f3, D. (eds.) FASE 2013. LNCS, vol. 7793, pp. 297\u2013311. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-37057-1_22"},{"issue":"3","key":"11_CR19","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)","journal-title":"Softw. Syst. Model."},{"key":"11_CR20","unstructured":"Medini-QVT: (2016). http:\/\/projects.ikv.de\/qvt"},{"key":"11_CR21","unstructured":"MoDisco: (2016). http:\/\/www.eclipse.org\/MoDisco\/"},{"key":"11_CR22","unstructured":"OMG: QVT Specification, V1.2 (2015). http:\/\/www.omg.org\/spec\/QVT\/"},{"issue":"2","key":"11_CR23","doi-asserted-by":"crossref","first-page":"201","DOI":"10.3233\/FI-1998-33204","volume":"33","author":"D Plump","year":"1998","unstructured":"Plump, D.: Termination of graph rewriting is undecidable. Fundam. Inform. 33(2), 201\u2013209 (1998)","journal-title":"Fundam. Inform."},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1006\/jvlc.1996.0027","volume":"8","author":"J Rekers","year":"1997","unstructured":"Rekers, J., Sch\u00fcrr, A.: Defining and parsing visual languages with layered graph grammars. J. Vis. Lang. Comput. 8(1), 27\u201355 (1997)","journal-title":"J. Vis. Lang. Comput."},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/3-540-59071-4_45","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A Sch\u00fcrr","year":"1995","unstructured":"Sch\u00fcrr, A.: Specification of graph translators with triple graph grammars. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol. 903, pp. 151\u2013163. Springer, Heidelberg (1995). doi:10.1007\/3-540-59071-4_45"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-02408-5_12","volume-title":"Theory and Practice of Model Transformations","author":"P Stevens","year":"2009","unstructured":"Stevens, P.: A simple game-theoretic approach to checkonly QVT relations. In: Paige, R.F. (ed.) ICMT 2009. LNCS, vol. 5563, pp. 165\u2013180. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-02408-5_12"},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.scico.2014.01.004","volume":"98","author":"Z Ujhelyi","year":"2015","unstructured":"Ujhelyi, Z., Bergmann, G., Heged\u00fcs, \u00c1., Horv\u00e1th, \u00c1., Izs\u00f3, B., R\u00e1th, I., Szatm\u00e1ri, Z., Varr\u00f3, D.: EMF-IncQuery: an integrated development environment for live model queries. Sci. Comput. Program. 98, 80\u201399 (2015)","journal-title":"Sci. Comput. Program."},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-38883-5_13","volume-title":"Theory and Practice of Model Transformations","author":"G Varr\u00f3","year":"2013","unstructured":"Varr\u00f3, G., Deckwerth, F.: A Rete network construction algorithm for incremental pattern matching. In: Duddy, K., Kappel, G. (eds.) ICMT 2013. LNCS, vol. 7909, pp. 125\u2013140. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-38883-5_13"}],"container-title":["Lecture Notes in Computer Science","Fundamental Approaches to Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54494-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,21]],"date-time":"2021-04-21T02:15:13Z","timestamp":1618971313000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-54494-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662544938","9783662544945"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54494-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"22 March 2017","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":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fase2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.etaps.org\/index.php\/2017\/fase","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}