{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:44:47Z","timestamp":1743011087754,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031457838"},{"type":"electronic","value":"9783031457845"}],"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-45784-5_2","type":"book-chapter","created":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T17:01:40Z","timestamp":1697389300000},"page":"9-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Design Datalog Templates for\u00a0Synthesizing Bidirectional Programs from\u00a0Tabular Examples"],"prefix":"10.1007","author":[{"given":"Bach Nguyen","family":"Trong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kanae","family":"Tsushima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenjiang","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,16]]},"reference":[{"key":"2_CR1","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison Wesley, Boston (1995)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/978-3-319-66158-2_44","volume-title":"Principles and Practice of Constraint Programming","author":"A Albarghouthi","year":"2017","unstructured":"Albarghouthi, A., Koutris, P., Naik, M., Smith, C.: Constraint-based synthesis of datalog programs. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 689\u2013706. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66158-2_44"},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1145\/1328897.1328487","volume":"43","author":"A Bohannon","year":"2008","unstructured":"Bohannon, A., Foster, J.N., Pierce, B.C., Pilkiewicz, A., Schmitt, A.: Boomerang: resourceful lenses string data. SIGPLAN Not. 43(1), 407\u2013419 (2008)","journal-title":"SIGPLAN Not."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bohannon, A., Pierce, B.C., Vaughan, J.A.: Relational lenses: a language for updatable views. In: Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006, pp. 338\u2013347. Association for Computing Machinery, New York, NY, USA (2006)","DOI":"10.1145\/1142351.1142399"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Ceri, S., Gottlob, G., Tanca, L.: What you always wanted to know about datalog (and never dared to ask). IEEE Trans. on Knowl. Data Eng. 1(1), 146\u2013166 (1989)","DOI":"10.1109\/69.43410"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-030-32409-4_7","volume-title":"Formal Methods and Software Engineering","author":"L Cheng","year":"2019","unstructured":"Cheng, L.: SqlSol: an accurate SQL query synthesizer. In: Ait-Ameur, Y., Qin, S. (eds.) ICFEM 2019. LNCS, vol. 11852, pp. 104\u2013120. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32409-4_7"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-02408-5_19","volume-title":"Theory and Practice of Model Transformations","author":"K Czarnecki","year":"2009","unstructured":"Czarnecki, K., Foster, J.N., Hu, Z., L\u00e4mmel, R., Sch\u00fcrr, A., Terwilliger, J.F.: Bidirectional transformations: a cross-discipline perspective. In: Paige, R.F. (ed.) ICMT 2009. LNCS, vol. 5563, pp. 260\u2013283. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02408-5_19"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Feng, Y., Martins, R., Van Geffen, J., Dillig, I., Chaudhuri, S.: Component-based synthesis of table consolidation and transformation tasks from examples. In: Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2017, pp. 422\u2013436. Association for Computing Machinery, New York, NY, USA (2017)","DOI":"10.1145\/3062341.3062351"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Foster, J.N., Greenwald, M.B., Moore, J.T., Pierce, B.C., Schmitt, A.: Combinators for bidirectional tree transformations: a linguistic approach to the view-update problem. ACM Trans. Program. Lang. Syst. 29(3), 17-es (2007)","DOI":"10.1145\/1232420.1232424"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Gupta, A., Mumick, I.S., Subrahmanian, V.S.: Maintaining views incrementally. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, SIGMOD 1993, pp. 157\u2013166. Association for Computing Machinery, New York, NY, USA (1993)","DOI":"10.1145\/170035.170066"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Horn, R., Perera, R., Cheney, J.: Incremental relational lenses. Proc. ACM Program. Lang. 2(ICFP) (2018)","DOI":"10.1145\/3236769"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Jordan, H., Scholz, B., Subotic, P.: Souffl\u00e9: On synthesis of program analyzers. In: CAV (2016)","DOI":"10.1007\/978-3-319-41540-6_23"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Keller, A.M.: Algorithms for translating view updates to database updates for views involving selections, projections, and joins. In: Proceedings of the Fourth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1985, pp. 154\u2013163. Association for Computing Machinery, New York, NY, USA (1985)","DOI":"10.1145\/325405.325423"},{"key":"2_CR14","unstructured":"Keller, A.M.: Choosing a view update translator by dialog at view definition time. In: Proceedings of the 12th International Conference on Very Large Data Bases, VLDB 1986, p. 467\u2013474. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1986)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Larson, J.A., Sheth, A.P.: Updating relational views using knowledge at view definition and view update time. Inf. Syst. 16(2), 145\u2013168 (1991)","DOI":"10.1016\/0306-4379(91)90012-X"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Le, V., Gulwani, S.: Flashextract: a framework for data extraction by examples. In: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2014, pp. 542\u2013553. Association for Computing Machinery, New York, NY, USA (2014)","DOI":"10.1145\/2594291.2594333"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Maina, S., Miltner, A., Fisher, K., Pierce, B.C., Walker, D., Zdancewic, S.: Synthesizing quotient lenses. Proc. ACM Program. Lang. 2(ICFP) (2018)","DOI":"10.1145\/3235041"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-319-89884-1_2","volume-title":"Programming Languages and Systems","author":"K Matsuda","year":"2018","unstructured":"Matsuda, K., Wang, M.: HOBiT: programming lenses without using lens combinators. In: Ahmed, A. (ed.) ESOP 2018. LNCS, vol. 10801, pp. 31\u201359. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_2"},{"issue":"7","key":"2_CR19","first-page":"6444","volume":"35","author":"J Mendelson","year":"2021","unstructured":"Mendelson, J., Naik, A., Raghothaman, M., Naik, M.: Gensynth: Synthesizing datalog programs without language bias. Proc. AAAI Conf. Artif. Intell. 35(7), 6444\u20136453 (2021)","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Miltner, A., Fisher, K., Pierce, B.C., Walker, D., Zdancewic, S.: Synthesizing bijective lenses. Proc. ACM Program. Lang. 2(POPL), 1\u201330 (2017)","DOI":"10.1145\/3158089"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Miltner, A., Maina, S., Fisher, K., Pierce, B.C., Walker, D., Zdancewic, S.: Synthesizing symmetric lenses. Proc. ACM Program. Lang. 3(ICFP), 1\u201328 (2019)","DOI":"10.1145\/3341699"},{"issue":"10","key":"2_CR22","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.14778\/2794367.2794377","volume":"8","author":"T Papenbrock","year":"2015","unstructured":"Papenbrock, T., et al.: Functional dependency discovery: an experimental evaluation of seven algorithms. Proc. VLDB Endow. 8(10), 1082\u20131093 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"2_CR23","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":"2_CR24","doi-asserted-by":"crossref","unstructured":"Shen, Y., Chakrabarti, K., Chaudhuri, S., Ding, B., Novik, L.: Discovering queries based on example tuples. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, SIGMOD 2014, pp. 493\u2013504. Association for Computing Machinery, New York, NY, USA (2014)","DOI":"10.1145\/2588555.2593664"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Si, X., Lee, W., Zhang, R., Albarghouthi, A., Koutris, P., Naik, M.: Syntax-guided synthesis of datalog programs. In: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC\/FSE 2018, pp. 515\u2013527. Association for Computing Machinery, New York, NY, USA (2018)","DOI":"10.1145\/3236024.3236034"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Solar-Lezama, A., Tancau, L., Bodik, R., Seshia, S., Saraswat, V.: Combinatorial sketching for finite programs. SIGARCH Comput. Archit. News 34(5), 404\u2013415 (2006)","DOI":"10.1145\/1168919.1168907"},{"issue":"5","key":"2_CR27","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10009-012-0223-4","volume":"15","author":"S Srivastava","year":"2012","unstructured":"Srivastava, S., Gulwani, S., Foster, J.S.: Template-based program verification and program synthesis. Int. J. Softw. Tools Technol. Transfer 15(5), 497\u2013518 (2012). https:\/\/doi.org\/10.1007\/s10009-012-0223-4","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Takenouchi, K., Ishio, T., Okada, J., Sakata, Y.: PatSQL: efficient synthesis of SQL queries from example tables with quick inference of projected columns. Proc. VLDB Endow. 14(11), 1937\u20131949 (2021)","DOI":"10.14778\/3476249.3476253"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Tran, V.D., Kato, H., Hu, Z.: Programmable view update strategies on relations. Proc. VLDB Endow. 13(5), 726\u2013739 (2020)","DOI":"10.14778\/3377369.3377380"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-030-59025-3_10","volume-title":"Functional and Logic Programming","author":"K Tsushima","year":"2020","unstructured":"Tsushima, K., Trong, B.N., Gl\u00fcck, R., Hu, Z.: An efficient composition of bidirectional programs by memoization and lazy update. In: Nakano, K., Sagonas, K. (eds.) FLOPS 2020. LNCS, vol. 12073, pp. 159\u2013178. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59025-3_10"},{"issue":"6","key":"2_CR31","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1145\/3140587.3062365","volume":"52","author":"C Wang","year":"2017","unstructured":"Wang, C., Cheung, A., Bodik, R.: Synthesizing highly expressive SQL queries from input-output examples. SIGPLAN Not. 52(6), 452\u2013466 (2017)","journal-title":"SIGPLAN Not."},{"issue":"7","key":"2_CR32","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.14778\/3384345.3384350","volume":"13","author":"Y Wang","year":"2020","unstructured":"Wang, Y., Shah, R., Criswell, A., Pan, R., Dillig, I.: Data migration using datalog program synthesis. Proc. VLDB Endow. 13(7), 1006\u20131019 (2020)","journal-title":"Proc. VLDB Endow."},{"issue":"5","key":"2_CR33","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1145\/3187009.3177735","volume":"11","author":"N Yaghmazadeh","year":"2018","unstructured":"Yaghmazadeh, N., Wang, X., Dillig, I.: Automated migration of hierarchical data to relational tables using programming-by-example. Proc. VLDB Endow. 11(5), 580\u2013593 (2018)","journal-title":"Proc. VLDB Endow."},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Yamaguchi, M., Matsuda, K., David, C., Wang, M.: Synbit: synthesizing bidirectional programs using unidirectional sketches. Proc. ACM Program. Lang. 5(OOPSLA), 1\u201331 (2021)","DOI":"10.1145\/3485482"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Zhang, S., Sun, Y.: Automatically synthesizing SQL queries from input-output examples. In: 2013 28th IEEE\/ACM International Conference on Automated Software Engineering (ASE), pp. 224\u2013234 (2013)","DOI":"10.1109\/ASE.2013.6693082"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45784-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T18:10:37Z","timestamp":1697393437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45784-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031457838","9783031457845"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45784-5_2","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":"16 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cascais","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lopstr.github.io\/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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","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":"8","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":"28% - 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)"}}]}}