{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:53:15Z","timestamp":1743061995229,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030908690"},{"type":"electronic","value":"9783030908706"}],"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:\/\/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:\/\/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-90870-6_29","type":"book-chapter","created":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T00:06:44Z","timestamp":1636502804000},"page":"545-562","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Trace Abstraction-Based Verification for Uninterpreted Programs"],"prefix":"10.1007","author":[{"given":"Weijiang","family":"Hong","sequence":"first","affiliation":[]},{"given":"Zhenbang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yide","family":"Du","sequence":"additional","affiliation":[]},{"given":"Ji","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,10]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","unstructured":"Ball, T., Majumdar, R., Millstein, T.D., Rajamani, S.K.: Automatic predicate abstraction of C programs. In: Burke, M., Soffa, M.L. (eds.) Proceedings of the 2001 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Snowbird, Utah, USA, 2001, pp. 203\u2013213. ACM (2001). https:\/\/doi.org\/10.1145\/378795.378846","DOI":"10.1145\/378795.378846"},{"key":"29_CR2","unstructured":"Boogie Language: www.microsoft.com\/en-us\/research\/project\/boogie-an-intermediate-verification-language\/"},{"key":"29_CR3","doi-asserted-by":"publisher","unstructured":"Cassez, F., Jensen, P.G., Larsen, K.G.: Verification and parameter synthesis for real-time programs using refinement of trace abstraction. Fundam. Informaticae 178(1\u20132), 31\u201357 (2021). https:\/\/doi.org\/10.3233\/FI-2021-1997","DOI":"10.3233\/FI-2021-1997"},{"key":"29_CR4","doi-asserted-by":"publisher","unstructured":"Cassez, F., Ziegler, F.: Verification of concurrent programs using trace abstraction refinement. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds.) LPAR 2015. LNCS, vol. 9450, pp. 233\u2013248. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48899-7_17","DOI":"10.1007\/978-3-662-48899-7_17"},{"key":"29_CR5","doi-asserted-by":"publisher","unstructured":"Christ, J., Hoenicke, J., Nutz, A.: SMTInterpol: an interpolating SMT solver. In: Donaldson, A., Parker, D. (eds.) SPIN 2012. LNCS, vol. 7385, pp. 248\u2013254. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31759-0_19","DOI":"10.1007\/978-3-642-31759-0_19"},{"key":"29_CR6","doi-asserted-by":"publisher","unstructured":"Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 154\u2013169. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722167_15","DOI":"10.1007\/10722167_15"},{"key":"29_CR7","doi-asserted-by":"publisher","unstructured":"Heizmann, M., et al.: Ultimate automizer with SMTInterpol. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 641\u2013643. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36742-7_53","DOI":"10.1007\/978-3-642-36742-7_53"},{"key":"29_CR8","doi-asserted-by":"publisher","unstructured":"Heizmann, M., Hoenicke, J., Podelski, A.: Refinement of trace abstraction. In: Palsberg, J., Su, Z. (eds.) SAS 2009. LNCS, vol. 5673, pp. 69\u201385. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03237-0_7","DOI":"10.1007\/978-3-642-03237-0_7"},{"key":"29_CR9","doi-asserted-by":"publisher","unstructured":"Heizmann, M., Hoenicke, J., Podelski, A.: Nested interpolants. In: Hermenegildo, M.V., Palsberg, J. (eds.) Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, pp. 471\u2013482. ACM (2010). https:\/\/doi.org\/10.1145\/1706299.1706353","DOI":"10.1145\/1706299.1706353"},{"key":"29_CR10","doi-asserted-by":"publisher","unstructured":"Hoder, K., Kov\u00e1cs, L., Voronkov, A.: Playing in the grey area of proofs. In: Field, J., Hicks, M. (eds.) Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, Philadelphia, Pennsylvania, USA, pp. 259\u2013272. ACM (2012). https:\/\/doi.org\/10.1145\/2103656.2103689","DOI":"10.1145\/2103656.2103689"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Automata and computability. Undergraduate texts in computer science, Springer (1997)","DOI":"10.1007\/978-1-4612-1844-9"},{"key":"29_CR12","doi-asserted-by":"publisher","unstructured":"Kroening, D., Strichman, O.: Decision procedures - an algorithmic point of view, 2nd Edn. Texts in Theoretical Computer Science. An EATCS Series, Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-50497-0","DOI":"10.1007\/978-3-662-50497-0"},{"key":"29_CR13","doi-asserted-by":"publisher","unstructured":"Krogmeier, P., et al.: Decidable synthesis of programs with uninterpreted functions. In: Lahiri, S. K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12225, pp. 634\u2013657. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_32","DOI":"10.1007\/978-3-030-53291-8_32"},{"key":"29_CR14","doi-asserted-by":"publisher","unstructured":"Leino, K., Rustan, M..: Dafny: an automatic program verifier for functional correctness. In: Clarke, E.M., Voronkov, A. (eds.) LPAR 2010. LNCS (LNAI), vol. 6355, pp. 348\u2013370. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17511-4_20","DOI":"10.1007\/978-3-642-17511-4_20"},{"key":"29_CR15","doi-asserted-by":"publisher","unstructured":"Mathur, U., Madhusudan, P., Viswanathan, M.: Decidable verification of uninterpreted programs. In: Proceedings ACM Programing. Language 3(POPL), pp. 1\u201329 (2019). https:\/\/doi.org\/10.1145\/3290359","DOI":"10.1145\/3290359"},{"key":"29_CR16","doi-asserted-by":"publisher","unstructured":"Mathur, U., Madhusudan, P., Viswanathan, M.: What\u2019s decidable about program verification modulo axioms?. In: TACAS 2020. LNCS, vol. 12079, pp. 158\u2013177. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45237-7_10","DOI":"10.1007\/978-3-030-45237-7_10"},{"key":"29_CR17","doi-asserted-by":"publisher","unstructured":"Mathur, U., Murali, A., Krogmeier, P., Madhusudan, P., Viswanathan, M.: Deciding memory safety for single-pass heap-manipulating programs. In: Proceedings ACM Programming Language 4(POPL), 1\u201329 (2020). https:\/\/doi.org\/10.1145\/3371103","DOI":"10.1145\/3371103"},{"issue":"2","key":"29_CR18","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1145\/322186.322198","volume":"27","author":"G Nelson","year":"1980","unstructured":"Nelson, G., Oppen, D.C.: Fast decision procedures based on congruence closure. J. ACM 27(2), 356\u2013364 (1980). https:\/\/doi.org\/10.1145\/322186.322198","journal-title":"J. ACM"},{"key":"29_CR19","unstructured":"SV-benchmarks: github.com\/sosy-lab\/sv-benchmarks"},{"key":"29_CR20","doi-asserted-by":"publisher","unstructured":"Torre, S.L., Madhusudan, P.: Reachability in concurrent uninterpreted programs. In: Chattopadhyay, A., Gastin, P. (eds.) 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019, Bombay, India. LIPIcs, vol. 150, pp. 1\u201316. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2019.46","DOI":"10.4230\/LIPIcs.FSTTCS.2019.46"}],"container-title":["Lecture Notes in Computer Science","Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90870-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T00:11:32Z","timestamp":1636503092000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90870-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030908690","9783030908706"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90870-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"10 November 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/formalmethods2021.csp.escience.cn\/dct\/page\/1","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":"131","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":"40","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":"2","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":"31% - 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":"9","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":"Additionally, this includes 4 invited full papers.","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)"}}]}}