{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:10:23Z","timestamp":1725538223039},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042218"},{"type":"electronic","value":"9783642042225"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04222-5_1","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T16:42:11Z","timestamp":1253119331000},"page":"1-17","source":"Crossref","is-referenced-by-count":1,"title":["Building SMT-Based Software Model Checkers: An Experience Report"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Armando","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1145\/1321631.1321734","volume-title":"ASE","author":"A. Armando","year":"2007","unstructured":"Armando, A., Benerecetti, M., Carotenuto, D., Mantovani, J., Spica, P.: The EUREKA tool for software model checking. In: Stirewalt, R.E.K., Egyed, A., Fischer, B. (eds.) ASE, pp. 541\u2013542. ACM, New York (2007)"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-540-71209-1_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Armando","year":"2007","unstructured":"Armando, A., Benerecetti, M., Mantovani, J.: Abstraction refinement of linear programs with arrays. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 373\u2013388. Springer, Heidelberg (2007)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-30482-1_22","volume-title":"Formal Methods and Software Engineering","author":"A. Armando","year":"2004","unstructured":"Armando, A., Castellini, C., Mantovani, J.: Software model checking using linear constraints. In: Davies, J., Schulte, W., Barnett, M. (eds.) ICFEM 2004. LNCS, vol.\u00a03308, pp. 209\u2013223. Springer, Heidelberg (2004)"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/11691617_9","volume-title":"Model Checking Software","author":"A. Armando","year":"2006","unstructured":"Armando, A., Mantovani, J., Platania, L.: Bounded Model Checking of Software using SMT Solvers instead of SAT Solvers. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol.\u00a03925, pp. 146\u2013162. Springer, Heidelberg (2006)"},{"issue":"1","key":"1_CR5","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. International Journal on Software Tools for Technology Transfer (STTT)\u00a011(1), 69\u201383 (2009)","journal-title":"International Journal on Software Tools for Technology Transfer (STTT)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-27813-9_49","volume-title":"Computer Aided Verification","author":"C. Barrett","year":"2004","unstructured":"Barrett, C., Berezin, S.: CVC Lite: A new implementation of the cooperating validity checker. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 515\u2013518. Springer, Heidelberg (2004)"},{"key":"1_CR7","first-page":"73","volume-title":"EuroSys 2006: Proceedings of the 2006 EuroSys conference","author":"T. Ball","year":"2006","unstructured":"Ball, T., Bounimova, E., Cook, B., Levin, V., Lichtenberg, J., McGarvey, C., Ondrusek, B., Rajamani, S.K., Ustuner, A.: Thorough static analysis of device drivers. In: EuroSys 2006: Proceedings of the 2006 EuroSys conference, pp. 73\u201385. ACM Press, New York (2006)"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R.E. Bellman","year":"1958","unstructured":"Bellman, R.E.: On a Routing Problem. Quarterly of applied mathematics\u00a016, 87\u201390 (1958)","journal-title":"Quarterly of applied mathematics"},{"issue":"4","key":"1_CR9","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1145\/325478.325480","volume":"21","author":"T. Bultan","year":"1999","unstructured":"Bultan, T., Gerber, R., Pugh, W.: Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results. ACM Transactions on Programming Languages and Systems\u00a021(4), 747\u2013789 (1999)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR10","unstructured":"Black, P.E.: Gray code, in dictionary of algorithms and data structures (2005), http:\/\/www.nist.gov\/dads\/HTML\/graycode.html"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/10722468_7","volume-title":"SPIN Model Checking and Software Verification","author":"T. Ball","year":"2000","unstructured":"Ball, T., Rajamani, S.K.: Bebop: A symbolic model checker for boolean programs. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN 2000. LNCS, vol.\u00a01885, pp. 113\u2013130. Springer, Heidelberg (2000)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-45139-0_7","volume-title":"Model Checking Software","author":"T. Ball","year":"2001","unstructured":"Ball, T., Rajamani, S.K.: Automatically validating temporal safety properties of interfaces. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol.\u00a02057, pp. 103\u2013122. Springer, Heidelberg (2001)"},{"key":"1_CR13","first-page":"238","volume-title":"POPL","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, Los Angeles, USA, pp. 238\u2013252. ACM, New York (1977)"},{"key":"1_CR14","first-page":"25","volume-title":"Proceedings of POPL (ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages)","author":"R. Cytron","year":"1989","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: An efficient method of computing static single assignment form. In: Proceedings of POPL (ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages), pp. 25\u201335. ACM, New York (1989)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/978-3-540-31980-1_40","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E. Clarke","year":"2005","unstructured":"Clarke, E., Kroening, D., Sharygina, N., Yorav, K.: SATABS: SAT-based predicate abstraction for ANSI-C. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 570\u2013574. Springer, Heidelberg (2005)"},{"key":"1_CR16","volume-title":"Model Checking","author":"E. Clarke","year":"2000","unstructured":"Clarke, E.: Model Checking. MIT Press, Boston (2000)"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/11691372_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H. Collavizza","year":"2006","unstructured":"Collavizza, H., Rueher, M.: Exploration of the capabilities of constraint programming for software verification. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.\u00a03920, pp. 182\u2013196. Springer, Heidelberg (2006)"},{"key":"1_CR18","unstructured":"Detlefs, D.L., Nelson, G., Saxe, J.B.: Simplify: a Theorem Prover for Program Checking. Technical Report 148, HP Labs (2003)"},{"key":"1_CR19","unstructured":"Flanagan, C.: Software model checking via iterative abstraction refinement of constraint logic queries. In: CP+CV 2004 (2004)"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1145\/512529.512558","volume-title":"PLDI 2002: Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation","author":"C. Flanagan","year":"2002","unstructured":"Flanagan, C., Leino, K.R.M., Lillibridge, M., Nelson, G., Saxe, J.B., Stata, R.: Extended static checking for java. In: PLDI 2002: Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, pp. 234\u2013245. ACM Press, New York (2002)"},{"key":"1_CR21","unstructured":"Gates, B.: Keynote address at WinHEC 2002 (2002), http:\/\/www.microsoft.com\/presspass\/exec\/billg\/speeches\/2002\/04-18winhec.aspx"},{"key":"1_CR22","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/503272.503279","volume-title":"POPL","author":"T.A. Henzinger","year":"2002","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: POPL, Portland, USA, pp. 58\u201370. ACM, New York (2002)"},{"key":"1_CR23","first-page":"297","volume-title":"ICCD 2005: Proceedings of the 2005 International Conference on Computer Design","author":"F. Ivanicic","year":"2005","unstructured":"Ivanicic, F., Shlyakhter, I., Gupta, A., Ganai, M.K.: Model checking c programs using f-soft. In: ICCD 2005: Proceedings of the 2005 International Conference on Computer Design, Washington, DC, USA, pp. 297\u2013308. IEEE Computer Society, Los Alamitos (2005)"},{"key":"1_CR24","first-page":"368","volume-title":"Proc. of DAC 2003","author":"D. Kroening","year":"2003","unstructured":"Kroening, D., Clarke, E., Yorav, K.: Behavioral consistency of C and Verilog programs using bounded model checking. In: Proc. of DAC 2003, Anaheim, USA, pp. 368\u2013371. ACM Press, New York (2003)"},{"key":"1_CR25","volume-title":"The Art of Computer Programming, Volume 3: Sorting and Searching","author":"D. Knuth","year":"1997","unstructured":"Knuth, D.: The Art of Computer Programming, Volume 3: Sorting and Searching, vol.\u00a03. Addison-Wesley, Reading (1997)"},{"issue":"3-4","key":"1_CR26","first-page":"141","volume":"3","author":"R. Sebastiani","year":"2007","unstructured":"Sebastiani, R.: Lazy satisability modulo theories. JSAT\u00a03(3-4), 141\u2013224 (2007)","journal-title":"JSAT"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04222-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T20:18:38Z","timestamp":1685132318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04222-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042218","9783642042225"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04222-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}