{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T10:23:31Z","timestamp":1748600611534,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030452360"},{"type":"electronic","value":"9783030452377"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T00:00:00Z","timestamp":1587081600000},"content-version":"vor","delay-in-days":107,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p><jats:sc>Ultimate Taipan<\/jats:sc> is a software model checker that combines trace abstraction with abstract interpretation on path programs. In this year\u2019s version, we replaced our abstract interpretation engine and now use a combination of multiple abstraction functions, fixpoint computation, algebraic program analysis, and SMT solving. Our new approach will allow us to integrate new techniques more easily.<\/jats:p>","DOI":"10.1007\/978-3-030-45237-7_32","type":"book-chapter","created":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T10:02:53Z","timestamp":1587117773000},"page":"418-422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Ultimate Taipan with Symbolic Interpretation and Fluid Abstractions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8947-5373","authenticated-orcid":false,"given":"Daniel","family":"Dietsch","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4252-3558","authenticated-orcid":false,"given":"Matthias","family":"Heizmann","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Nutz","sequence":"additional","affiliation":[]},{"given":"Claus","family":"Sch\u00e4tzle","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Sch\u00fcssele","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"D.\u00a0Beyer. Reliable and Reproducible Competition Results with BenchExec and Witnesses (Report on SV-COMP 2016). In TACAS 2016, pages 887\u2013904, 2016.","DOI":"10.1007\/978-3-662-49674-9_55"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"D.\u00a0Beyer, M.\u00a0Dangl, D.\u00a0Dietsch, and M.\u00a0Heizmann. Correctness Witnesses: Exchanging Verification Results between Verifiers. In FSE 2016, pages 326\u2013337, 2016.","DOI":"10.1145\/2950290.2950351"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"D.\u00a0Beyer, M.\u00a0Dangl, D.\u00a0Dietsch, M.\u00a0Heizmann, and A.\u00a0Stahlbauer. Witness Validation and Stepwise Testification across Software Verifiers. In ESEC\/FSE 2015, pages 721\u2013733, 2015.","DOI":"10.1145\/2786805.2786867"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"J.\u00a0A. Brzozowski. Derivatives of Regular Expressions. J. ACM, 11(4):481\u2013494, 1964.","DOI":"10.1145\/321239.321249"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"P.\u00a0Cousot and R.\u00a0Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In POPL 1977, pages 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"J.\u00a0Cyphert, J.\u00a0Breck, Z.\u00a0Kincaid, and T.\u00a0W. Reps. Refinement of Path Expressions for Static Analysis. PACMPL, 3(POPL):45:1\u201345:29, 2019.","DOI":"10.1145\/3290358"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"M.\u00a0Greitschus, D.\u00a0Dietsch, and A.\u00a0Podelski. Loop Invariants from Counterexamples. In SAS 2017, pages 128\u2013147, 2017.","DOI":"10.1007\/978-3-319-66706-5_7"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"M.\u00a0Heizmann, J.\u00a0Hoenicke, and A.\u00a0Podelski. Refinement of Trace Abstraction. In SAS 2009, pages 69\u201385, 2009.","DOI":"10.1007\/978-3-642-03237-0_7"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"R.\u00a0E. Tarjan. A Unified Approach to Path Problems.J. ACM, 28(3):577\u2013593, 1981.","DOI":"10.1145\/322261.322272"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"A.\u00a0Tiwari and S.\u00a0Gulwani. Logical Interpretation: Static Program Analysis Using Theorem Proving. In CADE, volume 4603 of LNCS, pages 147\u2013166. Springer, 2007.","DOI":"10.1007\/978-3-540-73595-3_11"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45237-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,22]],"date-time":"2021-03-22T18:09:09Z","timestamp":1616436549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45237-7_32"}},"subtitle":["(Competition Contribution)"],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030452360","9783030452377"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45237-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","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":"25 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2020\/tacas","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":"155","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":"8","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":"26% - 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":"14","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 could not take place due to the COVID-19 pandemic. There was an online event on July 2, 2020.","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)"}}]}}