{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:58:24Z","timestamp":1742997504706,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319050317"},{"type":"electronic","value":"9783319050324"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05032-4_9","type":"book-chapter","created":{"date-parts":[[2014,3,7]],"date-time":"2014-03-07T09:36:26Z","timestamp":1394184986000},"page":"113-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SMT-Constrained Symbolic Execution for Eclipse CDT\/Codan"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Ibing","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,8]]},"reference":[{"key":"9_CR1","volume-title":"The CERT C secure coding standard","author":"R Seacord","year":"2009","unstructured":"Seacord, R.: The CERT C secure coding standard. Addison-Wesley, Reading (2009)"},{"key":"9_CR2","unstructured":"Coverity Scan: 2011 open source integrity report (2011). www.coverity.com\/library\/pdf\/coverity-scan-2011-open-source-integrity-report.pdf"},{"key":"9_CR3","unstructured":"Martin, R., Barnum, S., Christey, S.: Being explicit about security weaknesses. In: Blackhat DC (2007)"},{"key":"9_CR4","doi-asserted-by":"publisher","DOI":"10.1201\/9780849332517","volume-title":"Data Flow Analysis","author":"U Khedker","year":"2009","unstructured":"Khedker, U., Sanyal, A., Karkare, B.: Data Flow Analysis. CRC Press, Boca Raton (2009)"},{"issue":"4","key":"9_CR5","first-page":"21","volume":"41","author":"R Jhala","year":"2009","unstructured":"Jhala, R., Majundar, R.: Software model checking. J. ACM Comput. Surv. 41(4), 21\u201374 (2009)","journal-title":"J. ACM Comput. Surv."},{"issue":"7","key":"9_CR6","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/360248.360252","volume":"19","author":"J King","year":"1976","unstructured":"King, J.: Symbolic execution and program testing. Commun. ACM 19(7), 385\u2013394 (1976)","journal-title":"Commun. ACM"},{"key":"9_CR7","volume-title":"Constraint Processing","author":"R Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"key":"9_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511576430","volume-title":"Handbook of Practical Logic and Automated Reasoning","author":"J Harrison","year":"2009","unstructured":"Harrison, J.: Handbook of Practical Logic and Automated Reasoning. Cambridge University Press, Cambridge (2009)"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10009-008-0091-0","volume":"11","author":"A Armando","year":"2009","unstructured":"Armando, A., Mantovani, J., Platania, L.: Bounded model checking of software using SMT solvers instead of SAT solvers. Int. J. Softw. Tools Technol. Transf. 11(1), 69\u201383 (2009)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"9_CR10","unstructured":"Barrett, C., Stump, A., Tinelli, C.: The SMT-LIB Standard Version 2.0. (Dec. 2010) online http:\/\/goedel.cs.uiowa.edu\/smtlib\/papers\/smt-lib-reference-v2.0-r10.12.21.pdf"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Xie, Y., Aiken, A.: Scalable error detection using Boolean satisfiability. In: Principles of Programming Languages (POPL) (2005)","DOI":"10.1145\/1040305.1040334"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Xie, Y., Chou, A., Engler, D.: Archer: Using symbolic, path-sensitive analysis to detect memory access errors. In: SIGSOFT Softw. Eng. Notes. pp. 327\u2013336 (2003)","DOI":"10.1145\/949952.940115"},{"key":"9_CR13","series-title":"LNCS","first-page":"168","volume-title":"TACAS 2004","author":"E Clarke","year":"2004","unstructured":"Clarke, E., Kroning, D., Lerda, F.: A tool for checking ANSI-C programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 168\u2013176. Springer, Heidelberg (2004)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Cordeiro, L., Fischer, B., Marques-Silva, J.: SMT-based bounded model checking for embedded ANSI-C software. In: The International Conference on Automated Software Engineering (2009)","DOI":"10.1109\/ASE.2009.63"},{"key":"9_CR15","unstructured":"Cadar, C., Dunbar, D., Engler, D.: KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs. In: USENIX Symposium on Operating Systems Design and Implementation (2008)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Emanuelsson, P., Nilsson, U.: A comparative study of industrial static analysis tools. In: Electronic Notes in Computer Science (ENTCS). Number 217, pp. 5\u201321 (2008)","DOI":"10.1016\/j.entcs.2008.06.039"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Chatzieleftheriou, G., Katsaros, P.: Test-driving static analysis tools in search of C code vulnerabilities. In: IEEE Computer Software and Application Conference Workshops (COMPSACW), pp. 96\u2013103 (2011)","DOI":"10.1109\/COMPSACW.2011.26"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Ku, K., Hart, T., Chechik, M., Lie, D.: A buffer overflow benchmark for software model checkers. In: IEEE\/ACM International Conference on Automated Software Engineering (2007)","DOI":"10.1145\/1321631.1321691"},{"key":"9_CR19","unstructured":"United States National Security Agency, Center for Assured Software: Juliet Test Suite v1.1 for C\/C++ (Dec. 2011). http:\/\/samate.nist.gov\/SRD\/testCases\/suites\/Juliet_Test_Suite_v1.1_for_C_Cpp.zip"},{"key":"9_CR20","unstructured":"Duprat, S., Velten, M.: FCDT: Using Eclipse CDT + FRAMA-C for advanced C static analysis in industrial context. In: Eclipse Day Toulouse (2012). http:\/\/gforge.enseeiht.fr\/projects\/fcdt\/"},{"key":"9_CR21","unstructured":"L. Correnson et al.: FRAMA-C User Manual, release oxygen-20120901. CEA LIST (2012). http:\/\/frama-c.com\/download\/frama-c-user-manual.pdf"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Necula, G., McPeak, S., Rahul, S., Weimer, W.: CIL: Intermediate language and tools for analysis and transformation of C programs. In: International Conference Compiler Construction, pp. 213\u2013228 (2002). http:\/\/dl.acm.org\/citation.cfm?id=647478.727796","DOI":"10.1007\/3-540-45937-5_16"},{"key":"9_CR23","unstructured":"Lattner, C., Adve, V.: LLVM: A compilation framework for lifelong program analysis and transformation. In: International Symposium Code Generation and Optimization (2004)"},{"key":"9_CR24","unstructured":"Laskavaia, A.: Codan- C\/C++ static analysis framework for CDT. In: EclipseCon. (2011)"},{"key":"9_CR25","first-page":"189","volume-title":"Program Flow Analysis: Theory and Applications","author":"M Sharir","year":"1981","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In: Muchnik, S., Jones, N. (eds.) Program Flow Analysis: Theory and Applications, pp. 189\u2013233. Prentice-Hall, Englewood Cliffs (1981)"},{"issue":"3","key":"9_CR26","first-page":"121","volume":"3","author":"F Tip","year":"1995","unstructured":"Tip, F.: A survey of program slicing techniques. J. Program. Lang. 3(3), 121\u2013189 (1995)","journal-title":"J. Program. Lang."},{"key":"9_CR27","unstructured":"Parr, T.: Language Implementation Patterns. Pragmatic Bookshelf, Raleigh (2010)"},{"key":"9_CR28","doi-asserted-by":"crossref","first-page":"59","DOI":"10.3233\/SAT190075","volume":"7","author":"D LeBerre","year":"2010","unstructured":"LeBerre, D.: The SAT4J library, release 2.2, system description. J. Satisfiability Boolean Model. Comput. (JSAT) 7, 59\u201364 (2010)","journal-title":"J. Satisfiability Boolean Model. Comput. (JSAT)"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Cimatti, A., Griggio, A., Schaafsma, B., Sebastiani, R.: The MathSAT5 SMT solver. In: TACAS (2013)","DOI":"10.1007\/978-3-642-36742-7_7"}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05032-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T21:42:16Z","timestamp":1674250936000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-05032-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319050317","9783319050324"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05032-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 March 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}