{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:35:45Z","timestamp":1775054145355,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662460801","type":"print"},{"value":"9783662460818","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46081-8_19","type":"book-chapter","created":{"date-parts":[[2014,12,11]],"date-time":"2014-12-11T09:25:44Z","timestamp":1418289944000},"page":"336-354","source":"Crossref","is-referenced-by-count":17,"title":["An Experimental Evaluation of Deliberate Unsoundness in a Static Program Analyzer"],"prefix":"10.1007","author":[{"given":"Maria","family":"Christakis","sequence":"first","affiliation":[]},{"given":"Peter","family":"M\u00fcller","sequence":"additional","affiliation":[]},{"given":"Valentin","family":"W\u00fcstholz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11804192_17","volume-title":"Formal Methods for Components and Objects","author":"M. Barnett","year":"2006","unstructured":"Barnett, M., Chang, B.-Y.E., DeLine, R., Jacobs, B., Leino, K.R.M.: Boogie: A modular reusable verifier for object-oriented programs. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol.\u00a04111, pp. 364\u2013387. Springer, Heidelberg (2006)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/1646353.1646374","volume":"53","author":"A. Bessey","year":"2010","unstructured":"Bessey, A., Block, K., Chelf, B., Chou, A., Fulton, B., Hallem, S., Gros, C.-H., Kamsky, A., McPeak, S., Engler, D.R.: A few billion lines of code later: Using static analysis to find bugs in the real world. CACM\u00a053, 66\u201375 (2010)","journal-title":"CACM"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-642-54108-7_16","volume-title":"Verified Software: Theories, Tools, Experiments","author":"F. Besson","year":"2014","unstructured":"Besson, F., Cornilleau, P.-E., Jensen, T.: Result certification of static program analysers with automated theorem provers. In: Cohen, E., Rybalchenko, A. (eds.) VSTTE 2013. LNCS, vol.\u00a08164, pp. 304\u2013325. Springer, Heidelberg (2014)"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Blazy, S., Laporte, V., Maroneze, A., Pichardie, D.: Formal verification of a C value analysis based on abstract interpretation. In: Logozzo, F., F\u00e4hndrich, M. (eds.) SAS 2013. LNCS, vol.\u00a07935, pp. 324\u2013344. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-38856-9_18"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-319-11164-3_23","volume-title":"Runtime Verification","author":"M. Christakis","year":"2014","unstructured":"Christakis, M., Emmisberger, P., M\u00fcller, P.: Dynamic test generation with static fields and initializers. In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol.\u00a08734, pp. 269\u2013284. Springer, Heidelberg (2014)"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-32759-9_13","volume-title":"FM 2012: Formal Methods","author":"M. Christakis","year":"2012","unstructured":"Christakis, M., M\u00fcller, P., W\u00fcstholz, V.: Collaborative verification and testing with explicit assumptions. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol.\u00a07436, pp. 132\u2013146. Springer, Heidelberg (2012)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R., Feret, J., Min\u00e9, A., Mauborgne, L., Monniaux, D., Rival, X.: Varieties of static analyzers: A comparison with ASTR\u00c9E. In: TASE, pp. 3\u201320. IEEE Computer Society (2007)","DOI":"10.1109\/TASE.2007.55"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-540-70592-5_18","volume-title":"ECOOP 2008 \u2013 Object-Oriented Programming","author":"S. Drossopoulou","year":"2008","unstructured":"Drossopoulou, S., Francalanza, A., M\u00fcller, P., Summers, A.J.: A unified framework for verification techniques for object invariants. In: Vitek, J. (ed.) ECOOP 2008. LNCS, vol.\u00a05142, pp. 412\u2013437. Springer, Heidelberg (2008)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"F\u00e4hndrich, M., Barnett, M., Logozzo, F.: Embedded contract languages. In: SAC, pp. 2103\u20132110. ACM (2010)","DOI":"10.1145\/1774088.1774531"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-642-18070-5_2","volume-title":"Formal Verification of Object-Oriented Software","author":"M. F\u00e4hndrich","year":"2011","unstructured":"F\u00e4hndrich, M., Logozzo, F.: Static contract checking with abstract interpretation. In: Beckert, B., March\u00e9, C. (eds.) FoVeOOS 2010. LNCS, vol.\u00a06528, pp. 10\u201330. Springer, Heidelberg (2011)"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Liang, P., Tripp, O., Naik, M., Sagiv, M.: A dynamic evaluation of the precision of static heap abstractions. In: OOPSLA, pp. 411\u2013427. ACM (2010)","DOI":"10.1145\/1932682.1869494"},{"key":"19_CR12","unstructured":"Livshits, B., Lahiri, S.K. In: defense of probabilistic static analysis. In: APPROX (2014)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Logozzo, F., Lahiri, S.K., F\u00e4hndrich, M., Blackshear, S.: Verification modulo versions: Towards usable verification. In: PLDI, pp. 294\u2013304. ACM (2014)","DOI":"10.1145\/2666356.2594326"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-33125-1_24","volume-title":"Static Analysis","author":"J. Midtgaard","year":"2012","unstructured":"Midtgaard, J., Adams, M.D., Might, M.: A structural soundness proof for Shivers\u2019s escape technique: A case for Galois connections. In: Min\u00e9, A., Schmidt, D. (eds.) SAS 2012. LNCS, vol.\u00a07460, pp. 352\u2013369. Springer, Heidelberg (2012)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-03237-0_15","volume-title":"Static Analysis","author":"M. Sridharan","year":"2009","unstructured":"Sridharan, M., Fink, S.J.: The complexity of Andersen\u2019s analysis in practice. In: Palsberg, J., Su, Z. (eds.) SAS 2009. LNCS, vol.\u00a05673, pp. 205\u2013221. Springer, Heidelberg (2009)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Summers, A.J., M\u00fcller, P.: Freedom before commitment: A lightweight type system for object initialisation. In: OOPSLA, pp. 1013\u20131032. ACM (2011)","DOI":"10.1145\/2076021.2048142"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46081-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T00:33:21Z","timestamp":1559090001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46081-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460801","9783662460818"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46081-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}