{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:46:06Z","timestamp":1770291966903,"version":"3.49.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030557539","type":"print"},{"value":"9783030557546","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-55754-6_15","type":"book-chapter","created":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T23:02:37Z","timestamp":1597014157000},"page":"251-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Constraint Caching Revisited"],"prefix":"10.1007","author":[{"given":"Jan","family":"Taljaard","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5636-6656","authenticated-orcid":false,"given":"Jaco","family":"Geldenhuys","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0913-3091","authenticated-orcid":false,"given":"Willem","family":"Visser","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,10]]},"reference":[{"key":"15_CR1","unstructured":"Cashew. https:\/\/cashew.vlab.cs.ucsb.edu\/. Accessed Feb 2020"},{"key":"15_CR2","unstructured":"Green. https:\/\/github.com\/GreenSolver\/green\/. Accessed Feb 2020"},{"key":"15_CR3","doi-asserted-by":"publisher","unstructured":"Aquino, A., Bianchi, F.A., Chen, M., Denaro, G., Pezz\u00e8, M.: Reusing constraint proofs in program analysis. In: ISSTA 2015, pp. 305\u2013315. ACM (2015). https:\/\/doi.org\/10.1145\/2771783.2771802","DOI":"10.1145\/2771783.2771802"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"Aquino, A., Denaro, G., Pezz\u00e8, M.: Heuristically matching solution spaces of arithmetic formulas to efficiently reuse solutions. In: ICSE 2017, pp. 427\u2013437. IEEE\/ACM (2017). https:\/\/doi.org\/10.1109\/ICSE.2017.46","DOI":"10.1109\/ICSE.2017.46"},{"key":"15_CR5","doi-asserted-by":"publisher","unstructured":"Aquino, A., Denaro, G., Pezz\u00e8, M.: Reusing solutions modulo theories. IEEE Trans. Softw. Eng. (Early access), 385\u2013394 (2019). https:\/\/doi.org\/10.1109\/TSE.2019.2898199","DOI":"10.1109\/TSE.2019.2898199"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-30557-6_14","volume-title":"Practical Aspects of Declarative Languages","author":"J Bailey","year":"2005","unstructured":"Bailey, J., Stuckey, P.J.: Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In: Hermenegildo, M.V., Cabeza, D. (eds.) PADL 2005. LNCS, vol. 3350, pp. 174\u2013186. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30557-6_14"},{"key":"15_CR7","doi-asserted-by":"publisher","unstructured":"Brennan, T., Tsiskaridze, N., Rosner, N., Aydin, A., Bultan, T.: Constraint normalization and parameterized caching for quantitative program analysis. In: FSE 2017, pp. 535\u2013546. ACM (2017). https:\/\/doi.org\/10.1145\/3106237.3106303","DOI":"10.1145\/3106237.3106303"},{"key":"15_CR8","doi-asserted-by":"publisher","unstructured":"De la Banda, M.J.G., Stuckey, P.J., Wazny, J.: Finding all minimal unsatisfiable subsets. In: PPDP 2003, pp. 32\u201343. ACM (2003). https:\/\/doi.org\/10.1145\/888251.888256","DOI":"10.1145\/888251.888256"},{"key":"15_CR9","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:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/ijoc.2.1.61","volume":"2","author":"J Gleeson","year":"1990","unstructured":"Gleeson, J., Ryan, J.: Identifying minimally infeasible subsystems of inequalities. INFORMS J. Comput. 2(1), 61\u201363 (1990). https:\/\/doi.org\/10.1287\/ijoc.2.1.61","journal-title":"INFORMS J. Comput."},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Jia, X., Ghezzi, C., Ying, S.: Enhancing reuse of constraint solutions to improve symbolic execution. In: ISSTA 2015, pp. 177\u2013187. ACM (2015). https:\/\/doi.org\/10.1145\/2771783.2771806","DOI":"10.1145\/2771783.2771806"},{"issue":"7","key":"15_CR12","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/360248.360252","volume":"19","author":"JC King","year":"1976","unstructured":"King, J.C.: Symbolic execution and program testing. Commun. ACM 19(7), 385\u2013394 (1976). https:\/\/doi.org\/10.1145\/360248.360252","journal-title":"Commun. ACM"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-38171-3_11","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"MH Liffiton","year":"2013","unstructured":"Liffiton, M.H., Malik, A.: Enumerating infeasibility: finding multiple MUSes quickly. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 160\u2013175. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38171-3_11"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/11814948_37","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"A Morgado","year":"2006","unstructured":"Morgado, A., Matos, P., Manquinho, V., Marques-Silva, J.: Counting models in integer domains. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 410\u2013423. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814948_37"},{"key":"15_CR15","unstructured":"Taljaard, J.H.: Optimised constraint solving for real-world problems. Master\u2019s thesis, Stellenbosch University (2019). https:\/\/doi.org\/10019.1\/107292"},{"key":"15_CR16","doi-asserted-by":"publisher","unstructured":"Visser, W., Geldenhuys, J., Dwyer, M.B.: Green: reducing, reusing and recycling constraints in program analysis. In: FSE 2012, pp. 1\u201311. ACM (2012). https:\/\/doi.org\/10.1145\/2393596.2393665","DOI":"10.1145\/2393596.2393665"},{"key":"15_CR17","doi-asserted-by":"publisher","unstructured":"Yang, G., P\u0103s\u0103reanu, C.S., Khurshid, S.: Memoized symbolic execution. In: ISSTA 2012, pp. 144\u2013154. ACM (2012). https:\/\/doi.org\/10.1145\/2338965.2336771","DOI":"10.1145\/2338965.2336771"},{"key":"15_CR18","doi-asserted-by":"publisher","unstructured":"Zou, Q., An, J., Huang, W., Fan, W.: Integrating assertion stack and caching to optimize constraint solving. In: ICCSNT 2015, pp. 397\u2013401. IEEE (2015). https:\/\/doi.org\/10.1109\/ICCSNT.2015.7490777","DOI":"10.1109\/ICCSNT.2015.7490777"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-55754-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T18:23:04Z","timestamp":1619202184000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-55754-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030557539","9783030557546"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-55754-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"10 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moffett Field, CA","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ti.arc.nasa.gov\/events\/nfm-2020\/","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":"62","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":"20","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":"5","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":"32% - 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.2","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.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 was held 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)"}}]}}