{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:46:47Z","timestamp":1743054407359,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030309411"},{"type":"electronic","value":"9783030309428"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30942-8_33","type":"book-chapter","created":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T23:03:06Z","timestamp":1569193386000},"page":"556-572","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reasoning Formally About Database Queries and Updates"],"prefix":"10.1007","author":[{"given":"Jon Ha\u00ebl","family":"Brenas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8535-8057","authenticated-orcid":false,"given":"Rachid","family":"Echahed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9953-9871","authenticated-orcid":false,"given":"Martin","family":"Strecker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"key":"33_CR1","unstructured":"Ahmetaj, S., Calvanese, D., Ortiz, M., Simkus, M.: Managing change in graph-structured data using description logics. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), pp. 966\u2013973. AAAI Press (2014). \nhttp:\/\/www.inf.unibz.it\/~calvanese\/papers-html\/AAAI-2014-graph-dbs.html"},{"issue":"4","key":"33_CR2","doi-asserted-by":"publisher","first-page":"27:1","DOI":"10.1145\/3143803","volume":"18","author":"S Ahmetaj","year":"2017","unstructured":"Ahmetaj, S., Calvanese, D., Ortiz, M., Simkus, M.: Managing change in graph-structured data using description logics. ACM Trans. Comput. Log. 18(4), 27:1\u201327:35 (2017). \nhttps:\/\/doi.org\/10.1145\/3143803","journal-title":"ACM Trans. Comput. Log."},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-319-11964-9_28","volume-title":"The Semantic Web \u2013 ISWC 2014","author":"A Ahmeti","year":"2014","unstructured":"Ahmeti, A., Calvanese, D., Polleres, A.: Updating RDFS ABoxes and TBoxes in SPARQL. In: Mika, P., et al. (eds.) ISWC 2014. LNCS, vol. 8796, pp. 441\u2013456. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-11964-9_28"},{"issue":"3","key":"33_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1004275029985","volume":"27","author":"H Andr\u00e9ka","year":"1998","unstructured":"Andr\u00e9ka, H., N\u00e9meti, I., van Benthem, J.: Modal languages and bounded fragments of predicate logic. J. Philos. Log. 27(3), 217\u2013274 (1998). \nhttp:\/\/www.fenrong.net\/teaching\/Andreka.pdf","journal-title":"J. Philos. Log."},{"issue":"1","key":"33_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/inco.1998.2731","volume":"147","author":"M Benedikt","year":"1998","unstructured":"Benedikt, M., Griffin, T., Libkin, L.: Verifiable properties of database transactions. Inf. Comput. 147(1), 57\u201388 (1998). \nhttps:\/\/core.ac.uk\/download\/pdf\/82337092.pdf","journal-title":"Inf. Comput."},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-319-46750-4_18","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2016","author":"JH Brenas","year":"2016","unstructured":"Brenas, J.H., Echahed, R., Strecker, M.: Ensuring correctness of model transformations while remaining decidable. In: Sampaio, A., Wang, F. (eds.) ICTAC 2016. LNCS, vol. 9965, pp. 315\u2013332. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-46750-4_18"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-662-44602-7_14","volume-title":"Theoretical Computer Science","author":"JH Brenas","year":"2014","unstructured":"Brenas, J.H., Echahed, R., Strecker, M.: A Hoare-like calculus using the SROIQ$$^{\\sigma }$$ logic on transformations of graphs. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds.) TCS 2014. LNCS, vol. 8705, pp. 164\u2013178. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-44602-7_14"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/3-540-19074-0_69","volume-title":"Advances in Database Technology\u2014EDBT \u201988","author":"F Bry","year":"1988","unstructured":"Bry, F., Decker, H., Manthey, R.: A uniform approach to constraint satisfaction and constraint satisfiability in deductive databases. In: Schmidt, J.W., Ceri, S., Missikoff, M. (eds.) EDBT 1988. LNCS, vol. 303, pp. 488\u2013505. Springer, Heidelberg (1988). \nhttps:\/\/doi.org\/10.1007\/3-540-19074-0_69"},{"key":"33_CR9","unstructured":"Chaabani, M., Echahed, R., Strecker, M.: Logical foundations for reasoning about transformations of knowledge bases. In: Eiter, T., Glimm, B., Kazakov, Y., Kr\u00f6tzsch, M. (eds.) DL - Description Logics. CEUR Workshop Proceedings, vol. 1014, pp. 616\u2013627. CEUR-WS.org (2013)"},{"key":"33_CR10","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic, a Language Theoretic Approach. Cambridge University Press (2011). \nhttp:\/\/www.labri.fr\/perso\/courcell\/Book\/TheBook.pdf"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Fagin, R., Ullman, J.D., Vardi, M.Y.: On the semantics of updates in databases. In: Proceedings of the 2nd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pp. 352\u2013365. ACM (1983)","DOI":"10.1145\/588058.588100"},{"key":"33_CR12","doi-asserted-by":"publisher","unstructured":"Francis, N., et al.: Cypher: An evolving query language for property graphs. In: Proceedings of the 2018 International Conference on Management of Data, SIGMOD Conference 2018, Houston, TX, USA, 10\u201315 June 2018, pp. 1433\u20131445 (2018). \nhttps:\/\/doi.org\/10.1145\/3183713.3190657\n\n. \nhttps:\/\/doi.org\/10.1145\/3183713.3190657","DOI":"10.1145\/3183713.3190657 10.1145\/3183713.3190657"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-48660-7_3","volume-title":"Automated Deduction \u2014 CADE-16","author":"E Gr\u00e4del","year":"1999","unstructured":"Gr\u00e4del, E.: Decision procedures for guarded logics. In: Ganzinger, H. (ed.) CADE 1999. LNCS, vol. 1632, pp. 31\u201351. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48660-7_3"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.2307\/2586808","volume":"64","author":"E Gr\u00e4del","year":"1999","unstructured":"Gr\u00e4del, E.: On the restraining power of guards. J. Symb. Log. 64, 1719\u20131742 (1999). \nhttp:\/\/www.logic.rwth-aachen.de\/pub\/graedel\/Gr-jsl99.ps","journal-title":"J. Symb. Log."},{"key":"33_CR15","unstructured":"Gr\u00e4del, E.: Decidable fragments of first-order and fixed-point logic. From prefix-vocabulary classes to guarded logics. In: Proceedings of Kalm\u00e1r Workshop on Logic and Computer Science, Szeged (2003). \nhttp:\/\/www.logic.rwth-aachen.de\/pub\/graedel\/Gr-kalmar03.ps"},{"key":"33_CR16","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. 4178, pp. 445\u2013460. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11841883_31"},{"key":"33_CR17","unstructured":"Hirsch, C.: Guarded logics: algorithms and bisimulation. Ph.D. thesis, RWTH Aachen (2002). \nhttp:\/\/www.logic.rwth-aachen.de\/pub\/hirsch\/hirsch.pdf"},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-45616-3_11","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"J Hladik","year":"2002","unstructured":"Hladik, J.: Implementation and optimisation of a tableau algorithm for the guarded fragment. In: Egly, U., Ferm\u00fcller, C.G. (eds.) TABLEAUX 2002. LNCS, vol. 2381, pp. 145\u2013159. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-45616-3_11"},{"key":"33_CR19","volume-title":"XML Processing - The Tree-Automata Approach","author":"H Hosoya","year":"2011","unstructured":"Hosoya, H.: XML Processing - The Tree-Automata Approach. Cambridge University Press, Cambridge (2011)"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Inaba, K., Hidaka, S., Hu, Z., Kato, H., Nakano, K.: Graph-transformation verification using monadic second-order logic. In: International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP), pp. 17\u201328, July 2011. \nhttp:\/\/dl.acm.org\/authorize?442117","DOI":"10.1145\/2003476.2003482"},{"key":"33_CR21","doi-asserted-by":"publisher","unstructured":"Itzhaky, S., et al.: On the automated verification of web applications with embedded SQL. In: Benedikt, M., Orsi, G. (eds.) 20th International Conference on Database Theory (ICDT 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 68, pp. 16:1\u201316:18. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2017). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2017.16\n\n. \nhttp:\/\/drops.dagstuhl.de\/opus\/volltexte\/2017\/7050","DOI":"10.4230\/LIPIcs.ICDT.2017.16"},{"issue":"3","key":"33_CR22","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.jcss.2006.10.005","volume":"73","author":"W Martens","year":"2007","unstructured":"Martens, W., Neven, F.: Frontiers of tractability for typechecking simple XML transformations. J. Comput. Syst. Sci. 73(3), 362\u2013390 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Martinenghi, D., Christiansen, H., Decker, H.: Integrity checking and maintenance in relational and deductive database and beyond. In: Intelligent Databases: Technologies and Applications, pp. 238\u2013285. IGI Global (2007)","DOI":"10.4018\/978-1-59904-120-9.ch010"},{"key":"33_CR24","volume-title":"Advanced Compiler Design and Implementation","author":"S Muchnick","year":"1997","unstructured":"Muchnick, S.: Advanced Compiler Design and Implementation. Morgan Kaufmann, Burlington (1997)"},{"key":"33_CR25","doi-asserted-by":"crossref","unstructured":"Nipkow, T., Klein, G.: Concrete Semantics (2014). \nhttp:\/\/concrete-semantics.org\/","DOI":"10.1007\/978-3-319-10542-0"},{"key":"33_CR26","unstructured":"Oliv\u00e9, A.: Integrity constraints checking in deductive databases. In: VLDB, pp. 513\u2013523. Citeseer (1991)"},{"key":"33_CR27","unstructured":"openCypher Project: Cypher Query Language Reference, version 9 edn. (2018). \nhttp:\/\/www.opencypher.org\/"}],"container-title":["Lecture Notes in Computer Science","Formal Methods \u2013 The Next 30 Years"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30942-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T06:10:26Z","timestamp":1588659026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30942-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030309411","9783030309428"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30942-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/formalmethods2019.inesctec.pt\/","order":11,"name":"conference_url","label":"Conference URL","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":"129","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":"44","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":"7","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":"34% - 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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}