{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:13:30Z","timestamp":1743016410342,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031248405"},{"type":"electronic","value":"9783031248412"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-24841-2_19","type":"book-chapter","created":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T00:04:39Z","timestamp":1673222679000},"page":"295-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Automatic Rollback Suggestions for\u00a0Incremental Datalog Evaluation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3857-5016","authenticated-orcid":false,"given":"David","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6536-3932","authenticated-orcid":false,"given":"Pavle","family":"Suboti\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2879-0932","authenticated-orcid":false,"given":"Mukund","family":"Raghothaman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7672-7359","authenticated-orcid":false,"given":"Bernhard","family":"Scholz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,8]]},"reference":[{"key":"19_CR1","unstructured":"GitHub CodeQL (2021). https:\/\/codeql.github.com\/. Accessed 19 Oct 2021"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-662-46663-6_7","volume-title":"Compiler Construction","author":"N Allen","year":"2015","unstructured":"Allen, N., Scholz, B., Krishnan, P.: Staged points-to analysis for large code bases. In: Franke, B. (ed.) CC 2015. LNCS, vol. 9031, pp. 131\u2013150. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46663-6_7"},{"issue":"4\u20135","key":"19_CR3","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1017\/S1471068403001832","volume":"3","author":"M Arenas","year":"2003","unstructured":"Arenas, M., Bertossi, L.E., Chomicki, J.: Answer sets for consistent query answering in inconsistent databases. Theory Pract. Log. Program. 3(4\u20135), 393\u2013424 (2003)","journal-title":"Theory Pract. Log. Program."},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-030-25543-5_14","volume-title":"Computer Aided Verification","author":"J Backes","year":"2019","unstructured":"Backes, J., et al.: Reachability analysis for AWS-based networks. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11562, pp. 231\u2013241. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25543-5_14"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0065-2458(08)60641-5","volume":"43","author":"DW Binkley","year":"1996","unstructured":"Binkley, D.W., Gallagher, K.B.: Program slicing. Adv. Comput. 43, 1\u201350 (1996)","journal-title":"Adv. Comput."},{"key":"19_CR6","unstructured":"Blackburn, S.M., et al.: The DaCapo benchmarks: Java benchmarking development and analysis. In: OOPSLA 2006: Proceedings of the 21st annual ACM SIGPLAN conference on Object-Oriented Programing, Systems, Languages, and Applications, pp. 169\u2013190. ACM Press, New York (2006). http:\/\/doi.acm.org\/10.1145\/1167473.1167488"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Blackburn, S.M., et al.: The dacapo benchmarks: Java benchmarking development and analysis. In: Proceedings of the 21st Annual ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications, pp. 169\u2013190 (2006)","DOI":"10.1145\/1167473.1167488"},{"issue":"10","key":"19_CR8","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/1639949.1640108","volume":"44","author":"M Bravenboer","year":"2009","unstructured":"Bravenboer, M., Smaragdakis, Y.: Strictly declarative specification of sophisticated points-to analyses. SIGPLAN Not. 44(10), 243\u2013262 (2009)","journal-title":"SIGPLAN Not."},{"key":"19_CR9","unstructured":"Bravo, L., Bertossi, L.E.: Consistent query answering under inclusion dependencies. In: Lutfiyya, H., Singer, J., Stewart, D.A. (eds.) Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research, 5\u20137 October 2004, Markham, Ontario, Canada, pp. 202\u2013216. IBM (2004)"},{"issue":"4","key":"19_CR10","first-page":"60","volume":"50","author":"R Caballero","year":"2017","unstructured":"Caballero, R., Riesco, A., Silva, J.: A survey of algorithmic debugging. ACM Comput. Surv. (CSUR) 50(4), 60 (2017)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"4","key":"19_CR11","first-page":"22","volume":"30","author":"J Cheney","year":"2007","unstructured":"Cheney, J.: Program slicing and data provenance. IEEE Data Eng. Bull. 30(4), 22\u201328 (2007)","journal-title":"IEEE Data Eng. Bull."},{"issue":"8","key":"19_CR12","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/3338112","volume":"62","author":"D Distefano","year":"2019","unstructured":"Distefano, D., F\u00e4hndrich, M., Logozzo, F., O\u2019Hearn, P.W.: Scaling static analyses at Facebook. Commun. ACM 62(8), 62\u201370 (2019)","journal-title":"Commun. ACM"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-63390-9_14","volume-title":"Computer Aided Verification","author":"A El-Hassany","year":"2017","unstructured":"El-Hassany, A., Tsankov, P., Vanbever, L., Vechev, M.: Network-wide configuration synthesis. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 261\u2013281. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63390-9_14"},{"issue":"3","key":"19_CR14","first-page":"1","volume":"26","author":"S Ezekiel","year":"2021","unstructured":"Ezekiel, S., Lukas, K., Marcel, B., Zeller, A.: Locating faults with program slicing: an empirical analysis. Empir. Softw. Eng. 26(3), 1\u201345 (2021)","journal-title":"Empir. Softw. Eng."},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-0-387-39940-9_599","volume-title":"Encyclopedia of Database Systems","author":"W Fan","year":"2009","unstructured":"Fan, W.: Constraint-driven database repair. In: Liu, L., \u00d6zsu, M.T. (eds.) Encyclopedia of Database Systems, pp. 458\u2013463. Springer, Boston (2009). https:\/\/doi.org\/10.1007\/978-0-387-39940-9_599"},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.14778\/1454159.1454200","volume":"1","author":"W Fan","year":"2008","unstructured":"Fan, W., Geerts, F., Jia, X.: Semandaq: a data quality system based on conditional functional dependencies. Proc. VLDB Endow. 1(2), 1460\u20131463 (2008). https:\/\/doi.org\/10.14778\/1454159.1454200","journal-title":"Proc. VLDB Endow."},{"key":"19_CR17","unstructured":"Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming, pp. 1070\u20131080. MIT Press (1988)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Grech, N., Brent, L., Scholz, B., Smaragdakis, Y.: Gigahorse: thorough, declarative decompilation of smart contracts. In: Proceedings of the 41th International Conference on Software Engineering, ICSE 2019, p. (to appear). ACM, Montreal (2019)","DOI":"10.1109\/ICSE.2019.00120"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Grech, N., Kong, M., Jurisevic, A., Brent, L., Scholz, B., Smaragdakis, Y.: MadMax: surviving out-of-gas conditions in ethereum smart contracts. In: SPLASH 2018 OOPSLA (2018)","DOI":"10.1145\/3276486"},{"issue":"3","key":"19_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1002\/swf.41","volume":"2","author":"M Harman","year":"2001","unstructured":"Harman, M., Hierons, R.: An overview of program slicing. Softw. Focus 2(3), 85\u201392 (2001)","journal-title":"Softw. Focus"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF01531033","volume":"6","author":"J Hooker","year":"1992","unstructured":"Hooker, J.: Generalized resolution for 0\u20131 linear inequalities. Ann. Math. Artif. Intell. 6, 271\u2013286 (1992). https:\/\/doi.org\/10.1007\/BF01531033","journal-title":"Ann. Math. Artif. Intell."},{"key":"19_CR22","doi-asserted-by":"publisher","unstructured":"Huang, S.S., Green, T.J., Loo, B.T.: Datalog and emerging applications: an interactive tutorial. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, SIGMOD 2011, pp. 1213\u20131216. ACM (2011). https:\/\/doi.org\/10.1145\/1989323.1989456, https:\/\/doi.acm.org\/10.1145\/1989323.1989456","DOI":"10.1145\/1989323.1989456"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-319-41540-6_23","volume-title":"Computer Aided Verification","author":"H Jordan","year":"2016","unstructured":"Jordan, H., Scholz, B., Suboti\u0107, P.: Souffl\u00e9: on synthesis of program analyzers. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 422\u2013430. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_23"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Kakas, A.C., Kowalski, R.A., Toni, F.: Abductive logic programming (1993)","DOI":"10.1093\/logcom\/2.6.719"},{"key":"19_CR25","doi-asserted-by":"publisher","unstructured":"Karvounarakis, G., Ives, Z.G., Tannen, V.: Querying data provenance. In: SIGMOD 2010, p. 951\u2013962. Association for Computing Machinery, New York (2010). https:\/\/doi.org\/10.1145\/1807167.1807269","DOI":"10.1145\/1807167.1807269"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Li, X., Bundy, A., Smaill, A.: ABC repair system for datalog-like theories. In: KEOD, pp. 333\u2013340 (2018)","DOI":"10.5220\/0006959703350342"},{"key":"19_CR27","unstructured":"McSherry, F., Murray, D.G., Isaacs, R., Isard, M.: Differential dataflow. In: CIDR (2013)"},{"key":"19_CR28","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.artint.2018.12.004","volume":"269","author":"B Motik","year":"2019","unstructured":"Motik, B., Nenov, Y., Piro, R., Horrocks, I.: Maintenance of datalog materialisations revisited. Artif. Intell. 269, 76\u2013136 (2019)","journal-title":"Artif. Intell."},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Raghothaman, M., Mendelson, J., Zhao, D., Naik, M., Scholz, B.: Provenance-guided synthesis of datalog programs. Proc. ACM Program. Lang. 4(POPL), 1\u201327 (2019)","DOI":"10.1145\/3371130"},{"key":"19_CR30","first-page":"4","volume":"2","author":"L Ryzhyk","year":"2019","unstructured":"Ryzhyk, L., Budiu, M.: Differential datalog. Datalog 2, 4\u20135 (2019)","journal-title":"Datalog"},{"key":"19_CR31","unstructured":"Sch\u00e4fer, M., Avgustinov, P., de Moor, O.: Algebraic data types for object-oriented datalog (2017)"},{"key":"19_CR32","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, USA (1986)"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Vall\u00e9e-Rai, R. Co, P., Gagnon, E., Hendren, L., Lam, P., Sundaresan, V.: Soot: a Java bytecode optimization framework. In: CASCON First Decade High Impact Papers, pp. 214\u2013224 (2010)","DOI":"10.1145\/1925805.1925818"},{"key":"19_CR34","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1109\/TSE.1984.5010248","volume":"4","author":"M Weiser","year":"1984","unstructured":"Weiser, M.: Program slicing. IEEE Trans. Software Eng. 4, 352\u2013357 (1984)","journal-title":"IEEE Trans. Software Eng."},{"issue":"4","key":"19_CR35","doi-asserted-by":"publisher","first-page":"2171","DOI":"10.1007\/s10664-019-09688-8","volume":"24","author":"M Yan","year":"2019","unstructured":"Yan, M., Xia, X., Lo, D., Hassan, A.E., Li, S.: Characterizing and identifying reverted commits. Empir. Softw. Eng. 24(4), 2171\u20132208 (2019). https:\/\/doi.org\/10.1007\/s10664-019-09688-8","journal-title":"Empir. Softw. Eng."},{"key":"19_CR36","doi-asserted-by":"crossref","unstructured":"Yoon, Y., Myers, B.A.: An exploratory study of backtracking strategies used by developers. In: Proceedings of the 5th International Workshop on Co-operative and Human Aspects of Software Engineering, CHASE 2012, pp. 138\u2013144. IEEE Press (2012)","DOI":"10.1109\/CHASE.2012.6223012"},{"issue":"6","key":"19_CR37","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/318774.318946","volume":"24","author":"A Zeller","year":"1999","unstructured":"Zeller, A.: Yesterday, my program worked. Today, it does not. Why? ACM SIGSOFT Softw. Eng. Notes 24(6), 253\u2013267 (1999)","journal-title":"ACM SIGSOFT Softw. Eng. Notes"},{"issue":"2","key":"19_CR38","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/32.988498","volume":"28","author":"A Zeller","year":"2002","unstructured":"Zeller, A., Hildebrandt, R.: Simplifying and isolating failure-inducing input. IEEE Trans. Software Eng. 28(2), 183\u2013200 (2002)","journal-title":"IEEE Trans. Software Eng."},{"key":"19_CR39","doi-asserted-by":"crossref","unstructured":"Zhao, D., Subotic, P., Raghothaman, M., Scholz, B.: Towards elastic incrementalization for datalog. In: 23rd International Symposium on Principles and Practice of Declarative Programming, pp. 1\u201316 (2021)","DOI":"10.1145\/3479394.3479415"},{"issue":"2","key":"19_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3379446","volume":"42","author":"D Zhao","year":"2020","unstructured":"Zhao, D., Suboti\u0107, P., Scholz, B.: Debugging large-scale datalog: a scalable provenance evaluation strategy. ACM Trans. Program. Lang. Syst. (TOPLAS) 42(2), 1\u201335 (2020)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"19_CR41","doi-asserted-by":"crossref","unstructured":"Zhou, W., Sherr, M., Tao, T., Li, X., Loo, B.T., Mao, Y.: Efficient querying and maintenance of network provenance at internet-scale. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 615\u2013626 (2010)","DOI":"10.1145\/1807167.1807234"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-24841-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T20:37:56Z","timestamp":1728679076000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-24841-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031248405","9783031248412"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-24841-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PADL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Practical Aspects of Declarative Languages","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Boston , MA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl23.sigplan.org\/home\/PADL-2023","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","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":"15","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":"4","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":"42% - 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":"4","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)"}}]}}