{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:14:56Z","timestamp":1743135296889,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642277047"},{"type":"electronic","value":"9783642277054"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-27705-4_24","type":"book-chapter","created":{"date-parts":[[2012,1,25]],"date-time":"2012-01-25T17:18:06Z","timestamp":1327511886000},"page":"310-325","source":"Crossref","is-referenced-by-count":11,"title":["Infeasible Code Detection"],"prefix":"10.1007","author":[{"given":"Cristiano","family":"Bertolini","sequence":"first","affiliation":[]},{"given":"Martin","family":"Sch\u00e4f","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Schweitzer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","first-page":"82","volume-title":"Proceedings of the 6th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, PASTE 2005","author":"M. Barnett","year":"2005","unstructured":"Barnett, M., Leino, K.R.M.: Weakest-precondition of unstructured programs. In: Proceedings of the 6th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, PASTE 2005, pp. 82\u201387. ACM, New York (2005)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Bertolini, C., Sch\u00e4f, M., Schweitzer, P.: Infeasible code detection. Technical Report 455, United Nations University, IIST (November 2011)","DOI":"10.1007\/978-3-642-27705-4_24"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0164-1212(93)90004-H","volume":"20","author":"A. Bertolino","year":"1993","unstructured":"Bertolino, A.: Unconstrained edges and their application to branch analysis and testing of programs. Journal of Systems and Software\u00a020, 125\u2013133 (1993)","journal-title":"Journal of Systems and Software"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1109\/32.368137","volume":"20","author":"A. Bertolino","year":"1994","unstructured":"Bertolino, A., Marr\u00e9, M.: Automatic generation of path covers based on the control flow analysis of computer programs. IEEE Trans. Softw. Eng.\u00a020, 885\u2013899 (1994)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst.\u00a013, 451\u2013490 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"24_CR6","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. Moura De","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.\u00a04963, pp. 337\u2013340. Springer, Heidelberg (2008)"},{"key":"24_CR7","volume-title":"A\u00a0discipline\u00a0of\u00a0programming","author":"E.W. Dijkstra","year":"1976","unstructured":"Dijkstra, E.W.: A\u00a0discipline\u00a0of\u00a0programming. Prentice-Hall, Englewood Cliffs (1976)"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.entcs.2008.06.039","volume":"217","author":"P. Emanuelsson","year":"2008","unstructured":"Emanuelsson, P., Nilsson, U.: A comparative study of industrial static analysis tools. Electron. Notes Theor. Comput. Sci.\u00a0217, 5\u201321 (2008)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-73368-3_21","volume-title":"Computer Aided Verification","author":"J.-C. Filli\u00e2tre","year":"2007","unstructured":"Filli\u00e2tre, J.-C., March\u00e9, C.: The why\/krakatoa\/caduceus Platform for Deductive Program Verification. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 173\u2013177. Springer, Heidelberg (2007)"},{"key":"24_CR10","volume-title":"Proceedings of the 11th International Workshop on Formal Techniques for Java-like Programs, FTfJP 2009","author":"R. Grigore","year":"2009","unstructured":"Grigore, R., Charles, J., Fairmichael, F., Kiniry, J.: Strongest postcondition of unstructured programs. In: Proceedings of the 11th International Workshop on Formal Techniques for Java-like Programs, FTfJP 2009, pp. 6:1\u20136:7. ACM, New York (2009)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-642-05089-3_22","volume-title":"FM 2009: Formal Methods","author":"J. Hoenicke","year":"2009","unstructured":"Hoenicke, J., Leino, K.R., Podelski, A., Sch\u00e4f, M., Wies, T.: It\u2019s Doomed; We Can Prove It. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 338\u2013353. Springer, Heidelberg (2009)"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10703-010-0102-0","volume":"37","author":"J. Hoenicke","year":"2010","unstructured":"Hoenicke, J., Leino, K.R., Podelski, A., Sch\u00e4f, M., Wies, T.: Doomed program points. Form. Methods Syst. Des.\u00a037, 171\u2013199 (2010)","journal-title":"Form. Methods Syst. Des."},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/1028664.1028717","volume-title":"Companion to the 19th Annual ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA 2004","author":"D. Hovemeyer","year":"2004","unstructured":"Hovemeyer, D., Pugh, W.: Finding bugs is easy. In: Companion to the 19th Annual ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA 2004, pp. 132\u2013136. ACM, New York (2004)"},{"key":"24_CR14","first-page":"23","volume-title":"Proceedings of the 2007 Conference on Specification and Verification of Component-Based Systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, SAVCBS 2007","author":"M. Janota","year":"2007","unstructured":"Janota, M., Grigore, R., Moskal, M.: Reachability analysis for annotated code. In: Proceedings of the 2007 Conference on Specification and Verification of Component-Based Systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, SAVCBS 2007, pp. 23\u201330. ACM, New York (2007)"},{"key":"24_CR15","first-page":"256","volume-title":"Approximation algorithms for combinatorial problems","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems, vol.\u00a09, pp. 256\u2013278. Academic Press, Inc., Orlando (1974)"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-12002-2_26","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Leino","year":"2010","unstructured":"Leino, K., R\u00fcmmer, P.: A Polymorphic Intermediate Verification Language: Design and Logical Encoding. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 312\u2013327. Springer, Heidelberg (2010)"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.ipl.2004.10.015","volume":"93","author":"K.R.M. Leino","year":"2005","unstructured":"Leino, K.R.M.: Efficient weakest preconditions. Inf. Process. Lett.\u00a093, 281\u2013288 (2005)","journal-title":"Inf. Process. Lett."},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1145\/258533.258641","volume-title":"Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC 1997","author":"R. Raz","year":"1997","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC 1997, pp. 475\u2013484. ACM, New York (1997)"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1109\/ISSRE.2004.1","volume-title":"Proceedings of the 15th International Symposium on Software Reliability Engineering","author":"N. Rutar","year":"2004","unstructured":"Rutar, N., Almazan, C.B., Foster, J.S.: A comparison of bug finding tools for java. In: Proceedings of the 15th International Symposium on Software Reliability Engineering, pp. 245\u2013256. IEEE Computer Society, Washington, DC, USA (2004)"}],"container-title":["Lecture Notes in Computer Science","Verified Software: Theories, Tools, Experiments"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27705-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,27]],"date-time":"2021-12-27T00:44:58Z","timestamp":1640565898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27705-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642277047","9783642277054"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27705-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}