{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T20:05:06Z","timestamp":1767989106544,"version":"3.49.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030670665","type":"print"},{"value":"9783030670672","type":"electronic"}],"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:\/\/2.zoppoz.workers.dev:443\/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:\/\/2.zoppoz.workers.dev:443\/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-67067-2_16","type":"book-chapter","created":{"date-parts":[[2021,1,11]],"date-time":"2021-01-11T20:57:20Z","timestamp":1610398640000},"page":"353-375","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Approximate Bit Dependency Analysis to Identify Program Synthesis Problems as Infeasible"],"prefix":"10.1007","author":[{"given":"Marius","family":"Kamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Philippsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,12]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., et al.: Syntax-guided synthesis. In: FMCAD 2013: Formal Methods in Computer-Aided Design, Portland, OR, pp. 1\u20138 (2013). https:\/\/2.zoppoz.workers.dev:443\/https\/sygus.org","DOI":"10.1109\/FMCAD.2013.6679385"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Bornholt, J., Torlak, E., Grossman, D., Ceze, L.: Optimizing synthesis with metasketches. In: POPL 2016: Principles of Programming Languages, St. Petersburg, FL, pp. 775\u2013788 (2016). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/2837614.2837666","DOI":"10.1145\/2837614.2837666"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-662-46663-6_9","volume-title":"Compiler Construction","author":"S Buchwald","year":"2015","unstructured":"Buchwald, S.: Optgen: a generator for local optimizations. In: Franke, B. (ed.) CC 2015. LNCS, vol. 9031, pp. 171\u2013189. Springer, Heidelberg (2015). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-662-46663-6_9"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Buchwald, S., Fried, A., Hack, S.: Synthesizing an instruction selection rule library from semantic specifications. In: CGO 2018: Code Generation and Optimization, Vienna, Austria, pp. 300\u2013313 (2018). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/3168821","DOI":"10.1145\/3168821"},{"key":"16_CR5","doi-asserted-by":"publisher","unstructured":"Cowan, M., Moreau, T., Chen, T., Bornholt, J., Ceze, L.: Automatic generation of high-performance quantized machine learning kernels. In: CGO 2020: Code Generation and Optimization, San Diego, CA, pp. 305\u2013316 (2020). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/3368826.3377912","DOI":"10.1145\/3368826.3377912"},{"key":"16_CR6","doi-asserted-by":"publisher","unstructured":"Crama, Y., Hammer, P.L.: Fundamental concepts and applications. In: Boolean Functions: Theory, Algorithms, and Applications, pp. 3\u201366. Cambridge University Press, Cambridge (2011). ISBN: 978-0-521-84751-3. https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1017\/CBO9780511852008.002","DOI":"10.1017\/CBO9780511852008.002"},{"key":"16_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"BA Davey","year":"2002","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (2002)"},{"key":"16_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory. Springer, Berlin (2017). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-662-53622-3"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/978-3-319-08867-9_49","volume-title":"Computer Aided Verification","author":"B Dutertre","year":"2014","unstructured":"Dutertre, B.: Yices\u00a02.2. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 737\u2013744. Springer, Cham (2014). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-319-08867-9_49"},{"key":"16_CR10","doi-asserted-by":"publisher","unstructured":"Gulwani, S., Jha, S., Tiwari, A., Venkatesan, R.: Synthesis of loop-free programs. In: PLDI 2011: Programming Language Design and Implementation, San Jose, CA, pp. 62\u201373 (2011). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/1993498.1993506","DOI":"10.1145\/1993498.1993506"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-030-25540-4_18","volume-title":"Computer Aided Verification","author":"Q Hu","year":"2019","unstructured":"Hu, Q., Breck, J., Cyphert, J., D\u2019Antoni, L., Reps, T.: Proving unrealizability for syntax-guided synthesis. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 335\u2013352. Springer, Cham (2019). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-25540-4_18"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Hu, Q., Cyphert, J., D\u2019Antoni, L., Reps, T.W.: Exact and approximate methods for proving unrealizability of syntax-guided synthesis problems. In: PLDI 2020: Programming Language Design and Implementation, London, UK, pp. 1128\u20131142 (2020). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/3385412.3385979","DOI":"10.1145\/3385412.3385979"},{"key":"16_CR13","doi-asserted-by":"publisher","unstructured":"Kamp, M., Philippsen, M.: Artifact for \u201capproximate bit dependency analysis to identify program synthesis problems as infeasible\u201d, October 2020. https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.5281\/zenodo.4275482","DOI":"10.5281\/zenodo.4275482"},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Mechtaev, S., Griggio, A., Cimatti, A., Roychoudhury, A.: Symbolic execution with existential second-order constraints. In: ESEC\/FSE 2018: European Software Engineering Conference and Symposium on the Foundations of Software Engineering, Lake Buena Vista, FL, pp. 389\u2013399 (2018). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/3236024.3236049","DOI":"10.1145\/3236024.3236049"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-030-24258-9_20","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"A N\u00f6tzli","year":"2019","unstructured":"N\u00f6tzli, A., et al.: Syntax-guided rewrite rule enumeration for SMT solvers. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 279\u2013297. Springer, Cham (2019). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-24258-9_20"},{"issue":"6","key":"16_CR17","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1145\/2666356.2594339","volume":"49","author":"PM Phothilimthana","year":"2014","unstructured":"Phothilimthana, P.M., Jelvis, T., Shah, R., Totla, N., Chasins, S., Bodik, R.: Chlorophyll: synthesis-aided compiler for low-power spatial architectures. ACM SIGPLAN Not. 49(6), 396\u2013407 (2014). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/2666356.2594339","journal-title":"ACM SIGPLAN Not."},{"key":"16_CR18","unstructured":"Sasnauskas, R., et al.: Souper: a synthesizing superoptimizer (2018). arXiv:1711.04422, April 2018. https:\/\/2.zoppoz.workers.dev:443\/https\/github.com\/google\/souper"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/978-3-030-53291-8_29","volume-title":"Computer Aided Verification","author":"J Van Geffen","year":"2020","unstructured":"Van Geffen, J., Nelson, L., Dillig, I., Wang, X., Torlak, E.: Synthesizing JIT compilers for in-kernel DSLs. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12225, pp. 564\u2013586. Springer, Cham (2020). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-53291-8_29"},{"issue":"6","key":"16_CR20","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1145\/359605.359632","volume":"20","author":"HS Warren Jr","year":"1977","unstructured":"Warren Jr., H.S.: Functions realizable with word-parallel logical and two\u2019s-complement addition instructions. Commun. ACM 20(6), 439\u2013441 (1977). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/359605.359632","journal-title":"Commun. ACM"},{"key":"16_CR21","volume-title":"Hacker\u2019s Delight","author":"HS Warren Jr","year":"2012","unstructured":"Warren Jr., H.S.: Hacker\u2019s Delight. Addison-Wesley, Upper Saddle River (2012)"},{"key":"16_CR22","volume-title":"The Complexity of Boolean Functions","author":"I Wegener","year":"1987","unstructured":"Wegener, I.: The Complexity of Boolean Functions. B. G. Teubner, Stuttgart (1987)"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67067-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T20:11:28Z","timestamp":1718050288000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/978-3-030-67067-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030670665","9783030670672"],"references-count":22,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-67067-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"12 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VMCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verification, Model Checking, and Abstract Interpretation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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":"17 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vmcai2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/popl21.sigplan.org\/home\/VMCAI-2021","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":"48","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":"22","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":"1","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":"46% - 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,1","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,6","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 took place virtually 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)"}}]}}