{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:39:06Z","timestamp":1743053946159,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030789459"},{"type":"electronic","value":"9783030789466"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-78946-6_7","type":"book-chapter","created":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T06:02:53Z","timestamp":1623909773000},"page":"122-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Evaluation Diversity for Graph Conditions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9828-618X","authenticated-orcid":false,"given":"Sven","family":"Schneider","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6937-5167","authenticated-orcid":false,"given":"Leen","family":"Lambers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Ammann, P., Offutt, A.J., Huang, H.: Coverage criteria for logical expressions. In: 14th International Symposium on Software Reliability Engineering (ISSRE 2003), Denver, CO, USA, 17\u201320 November 2003, pp. 99\u2013107. IEEE Computer Society (2003). https:\/\/doi.org\/10.1109\/ISSRE.2003.1251034","DOI":"10.1109\/ISSRE.2003.1251034"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-030-23611-3_13","volume-title":"Graph Transformation","author":"M Barkowsky","year":"2019","unstructured":"Barkowsky, M., Giese, H.: Hybrid search plan generation for generalized graph pattern matching. In: Guerra, E., Orejas, F. (eds.) ICGT 2019. LNCS, vol. 11629, pp. 212\u2013229. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23611-3_13"},{"key":"7_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). https:\/\/doi.org\/10.1007\/978-3-319-40530-8_11"},{"issue":"5","key":"7_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1049\/sej.1994.0025","volume":"9","author":"JJ Chilenski","year":"1994","unstructured":"Chilenski, J.J., Miller, S.P.: Applicability of modified condition\/decision coverage to software testing. Softw. Eng. J. 9(5), 193\u2013200 (1994). https:\/\/doi.org\/10.1049\/sej.1994.0025","journal-title":"Softw. Eng. J."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations, pp. 313\u2013400. World Scientific (1997). ISBN 9810228848","DOI":"10.1142\/9789812384720_0005"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Cseppento, L., Micskei, Z.: Evaluating code-based test input generator tools. Softw. Test. Verification Reliab. 27(6) (2017). https:\/\/doi.org\/10.1002\/stvr.1627","DOI":"10.1002\/stvr.1627"},{"key":"7_CR7","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","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. MTCSAES. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-31188-2"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Feldt, R., Poulding, S.M., Clark, D., Yoo, S.: Test set diameter: quantifying the diversity of sets of test cases. In: 2016 IEEE International Conference on Software Testing, Verification and Validation, ICST 2016, Chicago, IL, USA, 11\u201315 April 2016, pp. 223\u2013233. IEEE Computer Society (2016). ICST.2016.33","DOI":"10.1109\/ICST.2016.33"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Ghahremani, S., Giese, H., Vogel, T.: Efficient utility-driven self-healing employing adaptation rules for large dynamic architectures. In: Wang, X., Stewart, C., Lei, H. (eds.) 2017 IEEE International Conference on Autonomic Computing, ICAC 2017, Columbus, OH, USA, 17\u201321 July 2017, pp. 59\u201368. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/ICAC.2017.35. ISBN 978-1-5386-1762-5","DOI":"10.1109\/ICAC.2017.35"},{"issue":"2","key":"7_CR10","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. Math. Struct. Comput. Sci. 19(2), 245\u2013296 (2009). https:\/\/doi.org\/10.1017\/S0960129508007202","journal-title":"Math. Struct. Comput. Sci."},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Hochgeschwender, N., Schneider, S., Voos, H., Bruyninckx, H., Kraetzschmar, G.K.: Graph-based software knowledge: storage and semantic querying of domain models for run-time adaptation. In: 2016 IEEE International Conference on Simulation, Modeling, and Programming for Autonomous Robots, SIMPAR 2016, San Francisco, CA, USA, 13\u201316 December 2016, pp. 83\u201390. IEEE (2016). https:\/\/doi.org\/10.1109\/SIMPAR.2016.7862379","DOI":"10.1109\/SIMPAR.2016.7862379"},{"key":"7_CR12","unstructured":"Jackson, D., Milicevic, A., Torlak, E., Kang, E., Near, J.: Alloy: a language & tool for relational models (2017). https:\/\/alloytools.org\/. Accessed 05 July 2020"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Kakita, S., Watanabe, Y., Densmore, D., Davare, A., Sangiovanni-Vincentelli, A.L.: Functional model exploration for multimedia applications via algebraic operators. In: Sixth International Conference on Application of Concurrency to System Design (ACSD 2006), 28\u201330 June 2006, Turku, Finland, pp. 229\u2013238. IEEE Computer Society (2006). https:\/\/doi.org\/10.1109\/ACSD.2006.8","DOI":"10.1109\/ACSD.2006.8"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-21292-5_3","volume-title":"Foundations of Computer Software. Modeling, Development, and Verification of Adaptive Systems","author":"E Kang","year":"2011","unstructured":"Kang, E., Jackson, E.K., Schulte, W.: An approach for effective design space exploration. In: Calinescu, R., Jackson, E. (eds.) Monterey Workshop 2010. LNCS, vol. 6662, pp. 33\u201354. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21292-5_3"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Lambers, L., Schneider, S., Weisgut, M.: Model-based testing of read only graph queries. In: 13th IEEE International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2020, Porto, Portugal, 24\u201328 October 2020, pp. 24\u201334. IEEE (2020). https:\/\/doi.org\/10.1109\/ICSTW50294.2020.00022","DOI":"10.1109\/ICSTW50294.2020.00022"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-030-45234-6_11","volume-title":"Fundamental Approaches to Software Engineering","author":"N Nassar","year":"2020","unstructured":"Nassar, N., Kosiol, J., Kehrer, T., Taentzer, G.: Generating large EMF models efficiently. FASE 2020. LNCS, vol. 12076, pp. 224\u2013244. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45234-6_11"},{"key":"7_CR17","unstructured":"Neo4J Team. Neo4J. http:\/\/neo4j.com\/"},{"key":"7_CR18","unstructured":"Object Management Group. Unified Modeling Language. https:\/\/www.uml.org\/"},{"key":"7_CR19","unstructured":"OMG. Object Constraint Language (2014). http:\/\/www.omg.org\/spec\/OCL\/"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-319-21145-9_10","volume-title":"Graph Transformation","author":"H Radke","year":"2015","unstructured":"Radke, H., Arendt, T., Becker, J.S., Habel, A., Taentzer, G.: Translating essential OCL invariants to nested graph constraints focusing on set operations. In: Parisi-Presicce, F., Westfechtel, B. (eds.) ICGT 2015. LNCS, vol. 9151, pp. 155\u2013170. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21145-9_10"},{"key":"7_CR21","unstructured":"Schneider, S.: AutoGraph. https:\/\/github.com\/schneider-sven\/AutoGraph"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Schneider, S., Lambers, L., Orejas, F.: A logic-based incremental approach to graph repair featuring delta preservation. Int. J. Softw. Tools Technol. Transf. (2020, accepted)","DOI":"10.1007\/s10009-020-00584-x"},{"issue":"6","key":"7_CR23","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. Int. J. Softw. Tools Technol. Transf. 20(6), 705\u2013737 (2018). https:\/\/doi.org\/10.1007\/s10009-018-0496-3","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-662-54494-5_13","volume-title":"Fundamental Approaches to Software Engineering","author":"S Schneider","year":"2017","unstructured":"Schneider, S., Lambers, L., Orejas, F.: Symbolic model generation for graph properties. In: Huisman, M., Rubin, J. (eds.) FASE 2017. LNCS, vol. 10202, pp. 226\u2013243. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54494-5_13"},{"issue":"1","key":"7_CR25","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10009-019-00530-6","volume":"22","author":"O Semer\u00e1th","year":"2020","unstructured":"Semer\u00e1th, O., Farkas, R., Bergmann, G., Varr\u00f3, D.: Diversity of graph models and graph generators in mutation testing. Int. J. Softw. Tools Technol. Transf. 22(1), 57\u201378 (2020). https:\/\/doi.org\/10.1007\/s10009-019-00530-6","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"7_CR26","doi-asserted-by":"publisher","unstructured":"Semer\u00e1th, O., Nagy, A.S., Varr\u00f3, D.: A graph solver for the automated generation of consistent domain-specific models. In: Chaudron, M., Crnkovic, I., Chechik, M., Harman, M. (eds.) Proceedings of the 40th International Conference on Software Engineering, ICSE 2018, Gothenburg, Sweden, 27 May\u201303 June 2018, pp. 969\u2013980. ACM (2018). https:\/\/doi.org\/10.1145\/3180155.3180186","DOI":"10.1145\/3180155.3180186"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"Syriani, E., Bill, R., Wimmer, M.: Domain-specific model distance measures. J. Object Technol. 18(3), 3:1\u20133:19 (2019). https:\/\/doi.org\/10.5381\/jot.2019.18.3.a3","DOI":"10.5381\/jot.2019.18.3.a3"},{"key":"7_CR28","unstructured":"The Linked Data Benchmark Council (LDBC). Datagen. Accessed 04 May 2021"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78946-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T12:39:17Z","timestamp":1672490357000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78946-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030789459","9783030789466"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78946-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"18 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54% - 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 (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In addition, the proceedings contain 2 tool papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}