{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:12:48Z","timestamp":1743084768215,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030317836"},{"type":"electronic","value":"9783030317843"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-31784-3_13","type":"book-chapter","created":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T21:32:04Z","timestamp":1571607124000},"page":"228-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["BUBEN: Automated Library Abstractions Enabling Scalable Bug Detection for Large Programs with I\/O and Complex Environment"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Par\u00edzek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,21]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Artzi, S., Kiezun, A., Glasser, D., Ernst, M.: Combined static and dynamic mutability analysis. In: Proceedings of ASE 2007. ACM (2007)","DOI":"10.1145\/1321631.1321649"},{"key":"13_CR2","first-page":"1","volume-title":"Advances in Computers","author":"David W. Binkley","year":"1996","unstructured":"Binkley, D., Gallagher, K.B.: Program slicing. In: Advances in Computers, vol. 43 (1996)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Blackburn, S.M., et al.: The DaCapo benchmarks: Java benchmarking development and analysis. In: Proceedings of OOPSLA 2006. ACM (2006)","DOI":"10.1145\/1167473.1167488"},{"key":"13_CR4","unstructured":"Cadar, C., Dunbar, D., Engler, D.R.: KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs. In: Proceedings of OSDI 2008. USENIX (2008)"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2557833.2560572","volume":"39","author":"Matteo Ceccarello","year":"2014","unstructured":"Ceccarello, M., Tkachuk, O.: Automated generation of model classes for Java PathFinder. In: Proceedings of Java Pathfinder Workshop 2013, ACM SIGSOFT Software Engineering Notes, vol. 39, no. 1 (2014)","journal-title":"ACM SIGSOFT Software Engineering Notes"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-71229-9_12","volume-title":"Compiler Construction","author":"S Cherem","year":"2007","unstructured":"Cherem, S., Rugina, R.: A practical escape and effect analysis for building lightweight method summaries. In: Krishnamurthi, S., Odersky, M. (eds.) CC 2007. LNCS, vol. 4420, pp. 172\u2013186. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-71229-9_12"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Freund, S.N.: The RoadRunner dynamic analysis framework for concurrent programs. In: Proceedings of PASTE 2010. ACM (2010)","DOI":"10.1145\/1806672.1806674"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10515-009-0048-x","volume":"16","author":"D Giffhorn","year":"2009","unstructured":"Giffhorn, D., Hammer, C.: Precise slicing of concurrent programs. Autom. Softw. Eng. 16(2), 197 (2009)","journal-title":"Autom. Softw. Eng."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Marek, L., Villazon, A., Zheng, Y., Ansaloni, D., Binder, W., Qi, Z.: DiSL: a domain-specific language for bytecode instrumentation. In: Proceedings of AOSD 2012. ACM (2012)","DOI":"10.1145\/2162049.2162077"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Matosevic, I., Abdelrahman, T.S.: Efficient bottom-up heap analysis for symbolic path-based data access summaries. In: Proceedings of CGO 2012. ACM (2012)","DOI":"10.1145\/2259016.2259049"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-19861-8_6","volume-title":"Compiler Construction","author":"NA Naeem","year":"2011","unstructured":"Naeem, N.A., Lhot\u00e1k, O.: Faster alias set analysis using summaries. In: Knoop, J. (ed.) CC 2011. LNCS, vol. 6601, pp. 82\u2013103. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-19861-8_6"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-540-78791-4_4","volume-title":"Compiler Construction","author":"A Rountev","year":"2008","unstructured":"Rountev, A., Sharp, M., Xu, G.: IDE dataflow analysis in the presence of large object-oriented libraries. In: Hendren, L. (ed.) CC 2008. LNCS, vol. 4959, pp. 53\u201368. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-78791-4_4"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-30579-8_14","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A S\u0103lcianu","year":"2005","unstructured":"S\u0103lcianu, A., Rinard, M.: Purity and side effect analysis for Java programs. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 199\u2013215. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30579-8_14"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Tkachuk, O., Dwyer, M.: Adapting side effect analysis for modular program model checking. In: Proceedings of ESEC\/FSE 2003. ACM (2003)","DOI":"10.1145\/940071.940097"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Yorsh, G., Yahav, E., Chandra, S.: Generating precise and concise procedure summaries. In: Proceedings of POPL 2008. ACM (2008)","DOI":"10.1145\/1328438.1328467"},{"key":"13_CR16","unstructured":"Java Pathfinder verification framework (JPF). \nhttps:\/\/github.com\/javapathfinder\/jpf-core\/wiki"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31784-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T13:29:27Z","timestamp":1573738167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31784-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030317836","9783030317843"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31784-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/atva2019.iis.sinica.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"87","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":"29","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":"0","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":"33% - 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.4","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":"Between 1 and 2","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)"}}]}}