{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T11:26:31Z","timestamp":1751109991050,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030714994"},{"type":"electronic","value":"9783030715007"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,20]],"date-time":"2021-03-20T00:00:00Z","timestamp":1616198400000},"content-version":"vor","delay-in-days":78,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Structural runtime models provide a snapshot of the constituents of a system and their state. Capturing the history of runtime models, i.e., previous snapshots, has been shown to be useful for a number of aims. Handling, however, history at runtime poses important challenges to tool support. We present the <jats:sc>InTempo<\/jats:sc> tool which is based on the <jats:sc>Eclipse<\/jats:sc> Modeling Framework and encodes runtime models as graphs. Key features of <jats:sc>InTempo<\/jats:sc>, such as, the integration of temporal requirements into graph queries, the in-memory storage of the model, and a systematic method to contain the model\u2019s memory consumption, intend to address issues which seemingly place limitations on the available tool support. <jats:sc>InTempo<\/jats:sc> offers two operation modes which support both runtime and postmortem application scenarios.<\/jats:p>","DOI":"10.1007\/978-3-030-71500-7_13","type":"book-chapter","created":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T13:12:14Z","timestamp":1616159534000},"page":"262-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Keeping Pace with the History of Evolving Runtime Models"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6971-1589","authenticated-orcid":false,"given":"Lucas","family":"Sakizloglou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1138-2425","authenticated-orcid":false,"given":"Matthias","family":"Barkowsky","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4723-730X","authenticated-orcid":false,"given":"Holger","family":"Giese","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,20]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Barkowsky, M., Giese, H.: Hybrid search plan generation for generalized graph pattern matching. JLAMP 114, 100563 (2020)","DOI":"10.1016\/j.jlamp.2020.100563"},{"key":"13_CR2","unstructured":"Bettini, L.: Implementing domain-specific languages with Xtext and Xtend. Packt Publishing Ltd (2016)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Bencomo N., Goetz S., and Song H.: Models@ run. time: a guided tour of the state of the art and research challenges. SoSyM 18.5 (2019)","DOI":"10.1007\/s10270-018-00712-x"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Brun, Y., Di\u00a0Marzo\u00a0Serugendo, G., Gacek, C., Giese, et\u00a0al.:Software engineering for self-adaptive systems, pp. 48\u201370. Heidelberg (2009) Springer","DOI":"10.1007\/978-3-642-02161-9_3"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"B\u00far, M., Szil\u00e1gyi, G., V\u00f6r\u00f6s, A., Varr\u00f3, D.: Distributed graph queries over models@run.time for runtime monitoring of cyber-physical systems. STTT 22(1)","DOI":"10.1007\/s10009-019-00531-5"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Prange, U., Taentzer, G.: Fundamental Theory for Typed Attributed Graph Transformation. ICGT Berlin, Heidelberg (2004) Springer","DOI":"10.1007\/978-3-540-30203-2_13"},{"key":"13_CR7","unstructured":"Eclipse Foundation: Eclipse modeling framework (EMF) (Aug 2020), https:\/\/www.eclipse.org\/modeling\/emf\/, accessed: 2020-10-11"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Dom\u00ednguez, A., Bencomo, N., Parra-Ullauri, J.M.,Garc\u00eda-Paucar, L.H.: Querying and Annotating Model Histories with Time-Aware Patterns. MODELS. pp. 194\u2013204 (2019) ACM\/IEEE","DOI":"10.1109\/MODELS.2019.000-2"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Ghahremani, S., Giese, H., Vogel, T.: Efficient utility-driven self-healing employing adaptation rules for large dynamic architectures. ICAC (2017)","DOI":"10.1109\/ICAC.2017.35"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Giese, H., Maximova, M., Sakizloglou, L., Schneider, S.: Metric Temporal Graph Logic over Typed Attributed Graphs. FASE, (2019) Springer","DOI":"10.1007\/978-3-030-16722-6_16"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"G\u00f3mez, A., Cabot, J., Wimmer, M.: TemporalEMF: A temporal metamodeling framework. ER, vol. 11157, pp. 365\u2013381. (2018) Springer","DOI":"10.1007\/978-3-030-00847-5_26"},{"key":"13_CR12","unstructured":"Kleppe, A., Warmer, J.: An introduction to the object constraint language (OCL). In: TOOLS p.\u00a0456 (2000)"},{"key":"13_CR13","unstructured":"MDELab: InTempo Homepage, http:\/\/www.hpi.uni-potsdam.de\/giese\/public\/mdelab\/mdelab-projects\/intempo\/, accessed: 2021-01-19"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Rhodes, A., Evans, L.E., Alhazzani, W., Levy, M.M., et\u00a0al.: Surviving sepsis campaign: International guidelines for management of sepsis and septic shock: 2016. Intensive care medicine 43(3), 304\u2013377 (2017)","DOI":"10.1007\/s00134-017-4683-6"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Sakizloglou, L., Ghahremani, S., Barkowsky, M., Giese, H.: A scalable querying scheme for memory-efficient runtime models with history. MoDELS pp. 175\u2013186. (2020) ACM\/IEEE","DOI":"10.1145\/3365438.3410961"}],"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-71500-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,20]],"date-time":"2021-03-20T00:18:34Z","timestamp":1616199514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-71500-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030714994","9783030715007"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-71500-7_13","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":"20 March 2021","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":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fase2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2021\/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 (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":"52","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":"16","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":"31% - 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":"5,5","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":"The conference changed to an online format due to the COVID-19 pandemic.","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)"}}]}}