{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T00:20:53Z","timestamp":1779927653130,"version":"3.53.1"},"publisher-location":"Cham","reference-count":157,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319105741","type":"print"},{"value":"9783319105758","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-10575-8_10","type":"book-chapter","created":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T04:05:28Z","timestamp":1526616328000},"page":"277-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["SAT-Based Model Checking"],"prefix":"10.1007","author":[{"given":"Armin","family":"Biere","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Kr\u00f6ning","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,5,19]]},"reference":[{"key":"10_CR1","series-title":"LNCS","first-page":"411","volume-title":"Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":"P.A. Abdulla","year":"2000","unstructured":"Abdulla, P.A., Bjesse, P., E\u00e9n, N.: Symbolic reachability analysis based on SAT-solvers. In: Graf, S., Schwartzbach, M.I. (eds.) Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol.\u00a01785, pp.\u00a0411\u2013425. Springer, Heidelberg (2000)"},{"key":"10_CR2","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/978-3-642-39799-8_9","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"J. Alglave","year":"2013","unstructured":"Alglave, J., Kroening, D., Tautschnig, M.: Partial orders for efficient bounded model checking of concurrent software. In: Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a08044, pp.\u00a0141\u2013157. Springer, Heidelberg (2013)"},{"key":"10_CR3","first-page":"1","volume-title":"Symp. on Principles of Programming Languages (POPL)","author":"B. Alpern","year":"1988","unstructured":"Alpern, B., Wegman, M.N., Zadeck, F.K.: Detecting equality of variables in programs. In: Ferrante, J., Mager, P. (eds.) Symp. on Principles of Programming Languages (POPL), pp.\u00a01\u201311. ACM, New York (1988)"},{"key":"10_CR4","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/978-3-540-30494-4_19","volume-title":"Formal Methods in Computer Aided Design (FMCAD)","author":"N. Amla","year":"2004","unstructured":"Amla, N., McMillan, K.L.: A hybrid of counterexample-based and proof-based abstraction. In: Hu, A.J., Martin, A.K. (eds.) Formal Methods in Computer Aided Design (FMCAD). LNCS, vol.\u00a03312, pp.\u00a0260\u2013274. Springer, Heidelberg (2004)"},{"key":"10_CR5","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/978-3-540-27813-9_8","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"M. Awedh","year":"2004","unstructured":"Awedh, M., Somenzi, F.: Proving more properties with bounded model checking. In: Alur, R., Peled, D. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a03114, pp.\u00a096\u2013108. Springer, Heidelberg (2004)"},{"key":"10_CR6","first-page":"1073","volume-title":"Design Automation Conf. (DAC)","author":"M. Awedh","year":"2006","unstructured":"Awedh, M., Somenzi, F.: Automatic invariant strengthening to prove properties in bounded model checking. In: Sentovich, E. (ed.) Design Automation Conf. (DAC), pp.\u00a01073\u20131076. ACM, New York (2006)"},{"issue":"1","key":"10_CR7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.entcs.2005.07.019","volume":"144","author":"M. Awedh","year":"2006","unstructured":"Awedh, M., Somenzi, F.: Termination criteria for bounded model checking: extensions and comparison. Electron. Notes Theor. Comput. Sci. 144(1), 51\u201366 (2006)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10_CR8","first-page":"73","volume-title":"European Conf. on Computer Systems (EuroSys)","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: Berbers, Y., Zwaenepoel, W. (eds.) European Conf. on Computer Systems (EuroSys), pp.\u00a073\u201385. ACM, New York (2006)"},{"key":"10_CR9","first-page":"35","volume-title":"Formal Methods in Computer Aided Design (FMCAD)","author":"T. Ball","year":"2010","unstructured":"Ball, T., Bounimova, E., Kumar, R., Levin, V.: SLAM2: Static driver verification with under 4% false alarms. In: Bloem, R., Sharygina, N. (eds.) Formal Methods in Computer Aided Design (FMCAD), pp.\u00a035\u201342. IEEE, Piscataway (2010)"},{"key":"10_CR10","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/978-3-540-27813-9_36","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"T. Ball","year":"2004","unstructured":"Ball, T., Cook, B., Lahiri, S.K., Zhang, L.: Zapato: automatic theorem proving for predicate abstraction refinement. In: Alur, R., Peled, D. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a03114, pp.\u00a0457\u2013461. Springer, Heidelberg (2004)"},{"key":"10_CR11","series-title":"LNCS","first-page":"268","volume-title":"Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":"T. Ball","year":"2001","unstructured":"Ball, T., Podelski, A., Rajamani, S.K.: Boolean and Cartesian abstraction for model checking C programs. In: Margaria, T., Yi, W. (eds.) Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol.\u00a02031, pp.\u00a0268\u2013283. Springer, Heidelberg (2001)"},{"key":"10_CR12","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/10722468_7","volume-title":"Intl. Workshop on 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.) Intl. Workshop on SPIN Model Checking and Software Verification. LNCS, vol.\u00a01885, pp.\u00a0113\u2013130. Springer, Heidelberg (2000)"},{"key":"10_CR13","unstructured":"Ball, T., Rajamani, S.K.: Boolean programs: a model and process for software analysis. Tech. rep., Microsoft Research (2000)"},{"key":"10_CR14","series-title":"LNCS","first-page":"138","volume-title":"Intl. Haifa Verification Conference (HVC)","author":"S. Barner","year":"2007","unstructured":"Barner, S., Eisner, C., Glazberg, Z., Kroening, D., Rabinovitz, I.: ExpliSAT: guiding SAT-based software verification with explicit states. In: Yorav, K. (ed.) Intl. Haifa Verification Conference (HVC). LNCS, vol.\u00a04383, pp.\u00a0138\u2013154. Springer, Heidelberg (2007)"},{"key":"10_CR15","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"825","volume-title":"Handbook of Satisfiability","author":"C.W. Barrett","year":"2009","unstructured":"Barrett, C.W., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185, pp.\u00a0825\u2013885. IOS Press, Amsterdam (2009)"},{"key":"10_CR16","volume-title":"Handbook of Model Checking","author":"C.W. Barrett","year":"2018","unstructured":"Barrett, C.W., Tinelli, C.: Satisfiability modulo theories. In: Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.) Handbook of Model Checking. Springer, Heidelberg (2018)"},{"key":"10_CR17","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-3-540-73370-6_10","volume-title":"Intl. Workshop on Model Checking Software (SPIN)","author":"G. Basler","year":"2007","unstructured":"Basler, G., Kroening, D., Weissenbacher, G.: SAT-based summarization for Boolean programs. In: Bosnacki, D., Edelkamp, S. (eds.) Intl. Workshop on Model Checking Software (SPIN). LNCS, vol.\u00a04595, pp.\u00a0131\u2013148 (2007)"},{"key":"10_CR18","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/978-3-642-02658-4_9","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"G. Basler","year":"2009","unstructured":"Basler, G., Mazzucchi, M., Wahl, T., Kroening, D.: Symbolic counter abstraction for concurrent software. In: Bouajjani, A., Maler, O. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a05643, pp.\u00a064\u201378. Springer, Heidelberg (2009)"},{"issue":"3","key":"10_CR19","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10703-010-0096-7","volume":"36","author":"G. Basler","year":"2010","unstructured":"Basler, G., Mazzucchi, M., Wahl, T., Kroening, D.: Context-aware counter abstraction. Form. Methods Syst. Des. 36(3), 223\u2013245 (2010)","journal-title":"Form. Methods Syst. Des."},{"key":"10_CR20","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/DATE.2004.1268824","volume-title":"Design, Automation & Test in Europe Conf. and Exposition (DATE)","author":"J. Baumgartner","year":"2004","unstructured":"Baumgartner, J., Kuehlmann, A.: Enhanced diameter bounding via structural transformation. In: Design, Automation & Test in Europe Conf. and Exposition (DATE), pp.\u00a036\u201341. IEEE, Piscataway (2004)"},{"key":"10_CR21","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/3-540-45657-0_12","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"J. Baumgartner","year":"2002","unstructured":"Baumgartner, J., Kuehlmann, A., Abraham, J.A.: Property checking via structural analysis. In: Brinksma, E., Larsen, K.G. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a02404, pp.\u00a0151\u2013165. Springer, Heidelberg (2002)"},{"key":"10_CR22","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/978-3-540-69738-1_27","volume-title":"Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI)","author":"D. Beyer","year":"2007","unstructured":"Beyer, D., Henzinger, T.A., Majumdar, R., Rybalchenko, A.: Invariant synthesis for combined theories. In: Cook, B., Podelski, A. (eds.) Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI). LNCS, vol.\u00a04349, pp.\u00a0378\u2013394. Springer, Heidelberg (2007)"},{"key":"10_CR23","first-page":"300","volume-title":"Conf. on Programming Language Design and Implementation (PLDI)","author":"D. Beyer","year":"2007","unstructured":"Beyer, D., Henzinger, T.A., Majumdar, R., Rybalchenko, A.: Path invariants. In: Ferrante, J., McKinley, K.S. (eds.) Conf. on Programming Language Design and Implementation (PLDI), pp.\u00a0300\u2013309. ACM, New York (2007)"},{"key":"10_CR24","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"457","volume-title":"Handbook of Satisfiability","author":"A. Biere","year":"2009","unstructured":"Biere, A.: Bounded model checking. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185, pp.\u00a0457\u2013481. IOS Press, Amsterdam (2009)"},{"key":"10_CR25","first-page":"160","volume-title":"Intl. ERCIM Workshop on Formal Methods for Industrial Critical Systems (FMICS)","author":"A. Biere","year":"2002","unstructured":"Biere, A., Artho, C., Schuppan, V.: Liveness checking as safety checking. In: Cleaveland, R., Garavel, H. (eds.) Intl. ERCIM Workshop on Formal Methods for Industrial Critical Systems (FMICS), pp.\u00a0160\u2013177. Elsevier, Amsterdam (2002)"},{"key":"10_CR26","series-title":"LNCS","first-page":"193","volume-title":"Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":"A. Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, R. (ed.) Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol.\u00a01579, pp.\u00a0193\u2013207. Springer, Heidelberg (1999)"},{"issue":"5","key":"10_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2168\/LMCS-2(5:5)2006","volume":"2","author":"A. Biere","year":"2006","unstructured":"Biere, A., Heljanko, K., Junttila, T.A., Latvala, T., Schuppan, V.: Linear encodings of bounded LTL model checking. Log. Methods Comput. Sci. 2(5), 1\u201364 (2006)","journal-title":"Log. Methods Comput. Sci."},{"key":"10_CR28","series-title":"Frontiers in Artificial Intelligence and Applications","volume-title":"Handbook of Satisfiability","year":"2009","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185. IOS Press, Amsterdam (2009)"},{"key":"10_CR29","first-page":"356","volume-title":"Intl. Conf. on Computer-Aided Design (ICCAD)","author":"N. Blanc","year":"2008","unstructured":"Blanc, N., Kroening, D.: Race analysis for SystemC using model checking. In: Intl. Conf. on Computer-Aided Design (ICCAD), pp.\u00a0356\u2013363. IEEE, Piscataway (2008)"},{"issue":"3","key":"10_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1754405.1754406","volume":"15","author":"N. Blanc","year":"2010","unstructured":"Blanc, N., Kroening, D.: Race analysis for SystemC using model checking. ACM Trans. Des. Autom. Electron. Syst. 15(3), 1\u201332 (2010)","journal-title":"ACM Trans. Des. Autom. Electron. Syst."},{"key":"10_CR31","series-title":"LNCS","first-page":"467","volume-title":"Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":"N. Blanc","year":"2008","unstructured":"Blanc, N., Kroening, D., Sharygina, N.: Scoot: a tool for the analysis of SystemC models. In: Ramakrishnan, C.R., Rehof, J. (eds.) Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol.\u00a04963, pp.\u00a0467\u2013470. Springer, Heidelberg (2008)"},{"key":"10_CR32","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"Intl. Conf. on Concurrency Theory (CONCUR)","author":"A. Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: application to model-checking. In: Mazurkiewicz, A.W., Winkowski, J. (eds.) Intl. Conf. on Concurrency Theory (CONCUR). LNCS, vol.\u00a01243, pp.\u00a0135\u2013150. Springer, Heidelberg (1997)"},{"key":"10_CR33","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/978-3-642-18275-4_7","volume-title":"Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI)","author":"A.R. Bradley","year":"2011","unstructured":"Bradley, A.R.: SAT-based model checking without unrolling. In: Jhala, R., Schmidt, D.A. (eds.) Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI). LNCS, vol.\u00a06538, pp.\u00a070\u201387. Springer, Heidelberg (2011)"},{"key":"10_CR34","series-title":"LNCS","first-page":"1","volume-title":"Theory and Applications of Satisfiability Testing (SAT)","author":"A.R. Bradley","year":"2012","unstructured":"Bradley, A.R.: Understanding IC3. In: Cimatti, A., Sebastiani, R. (eds.) Theory and Applications of Satisfiability Testing (SAT). LNCS, vol.\u00a07317, pp.\u00a01\u201314. Springer, Heidelberg (2012)"},{"key":"10_CR35","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/FAMCAD.2007.15","volume-title":"Formal Methods in Computer Aided Design (FMCAD)","author":"A.R. Bradley","year":"2007","unstructured":"Bradley, A.R., Manna, Z.: Checking safety by inductive generalization of counterexamples to induction. In: Formal Methods in Computer Aided Design (FMCAD), pp.\u00a0173\u2013180. IEEE, Piscataway (2007)"},{"key":"10_CR36","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1007\/978-3-642-14203-1_33","volume-title":"Intl. Joint Conf. on Automated Reasoning (IJCAR)","author":"A. Brillout","year":"2010","unstructured":"Brillout, A., Kroening, D., R\u00fcmmer, P., Wahl, T.: An interpolating sequent calculus for quantifier-free Presburger arithmetic. In: Giesl, J., H\u00e4hnle, R. (eds.) Intl. Joint Conf. on Automated Reasoning (IJCAR). LNCS, vol.\u00a06173, pp.\u00a0384\u2013399. Springer, Heidelberg (2010)"},{"key":"10_CR37","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/978-3-642-18275-4_8","volume-title":"Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI)","author":"A. Brillout","year":"2011","unstructured":"Brillout, A., Kroening, D., R\u00fcmmer, P., Wahl, T.: Beyond quantifier-free interpolation in extensions of Presburger arithmetic. In: Jhala, R., Schmidt, D.A. (eds.) Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI). LNCS, vol.\u00a06538, pp.\u00a088\u2013102. Springer, Heidelberg (2011)"},{"key":"10_CR38","first-page":"69","volume-title":"Formal Methods in Computer Aided Design (FMCAD)","author":"A. Brillout","year":"2009","unstructured":"Brillout, A., Kroening, D., Wahl, T.: Mixed abstractions for floating-point arithmetic. In: Formal Methods in Computer Aided Design (FMCAD), pp.\u00a069\u201376. IEEE, Piscataway (2009)"},{"key":"10_CR39","series-title":"LNCS","first-page":"304","volume-title":"Intl. Conf. on Computer Aided Systems Theory (EUROCAST)","author":"R. Brummayer","year":"2009","unstructured":"Brummayer, R., Biere, A.: Effective bit-width and under-approximation. In: Moreno-D\u00edaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) Intl. Conf. on Computer Aided Systems Theory (EUROCAST). LNCS, vol.\u00a05717, pp.\u00a0304\u2013311. Springer, Heidelberg (2009)"},{"issue":"8","key":"10_CR40","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph Based Algorithms for Boolean Function Manipulation. Trans. Comput. C-35(8), 677\u2013691 (1986)","journal-title":"Trans. Comput."},{"key":"10_CR41","series-title":"LNCS","first-page":"358","volume-title":"Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":"R.E. Bryant","year":"2007","unstructured":"Bryant, R.E., Kroening, D., Ouaknine, J., Seshia, S.A., Strichman, O., Brady, B.: Deciding bit-vector arithmetic with abstraction. In: Grumberg, O., Huth, M. (eds.) Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol.\u00a04424, pp.\u00a0358\u2013372. Springer, Heidelberg (2007)"},{"issue":"3\u20134","key":"10_CR42","first-page":"91","volume":"6","author":"J.R. B\u00fcchi","year":"1964","unstructured":"B\u00fcchi, J.R.: Regular canonical systems. Arch. Math. Log. 6(3\u20134), 91\u2013111 (1964)","journal-title":"Arch. Math. Log."},{"issue":"2","key":"10_CR43","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1145\/2408776.2408795","volume":"56","author":"C. Cadar","year":"2013","unstructured":"Cadar, C., Sen, K.: Symbolic execution for software testing: Three decades later. Commun. ACM 56(2), 82\u201390 (2013)","journal-title":"Commun. ACM"},{"key":"10_CR44","first-page":"17","volume-title":"Formal Methods in Computer Aided Design (FMCAD)","author":"M.L. Case","year":"2009","unstructured":"Case, M.L., Mony, H., Baumgartner, J., Kanzelman, R.: Enhanced verification by temporal decomposition. In: Formal Methods in Computer Aided Design (FMCAD), pp.\u00a017\u201324. IEEE, Piscataway (2009)"},{"key":"10_CR45","first-page":"1590","volume-title":"Design, Automation & Test in Europe (DATE)","author":"B. Chambers","year":"2009","unstructured":"Chambers, B., Manolios, P., Vroon, D.: Faster SAT solving with better CNF generation. In: Design, Automation & Test in Europe (DATE), pp.\u00a01590\u20131595. IEEE, Piscataway (2009)"},{"key":"10_CR46","first-page":"524","volume-title":"Design Automation Conf. (DAC)","author":"P. Chauhan","year":"2004","unstructured":"Chauhan, P., Clarke, E.M., Kroening, D.: A SAT-based algorithm for reparameterization in symbolic simulation. In: Malik, S., Fix, L., Kahng, A.B. (eds.) Design Automation Conf. (DAC), pp.\u00a0524\u2013529. ACM, New York (2004)"},{"issue":"5","key":"10_CR47","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1109\/TCAD.2011.2180382","volume":"31","author":"H. Chockler","year":"2012","unstructured":"Chockler, H., Kroening, D., Purandare, M.: Computing mutation coverage in interpolation-based model checking. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 31(5), 765\u2013778 (2012)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"10_CR48","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/978-3-642-31424-7_23","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"A. Cimatti","year":"2012","unstructured":"Cimatti, A., Griggio, A.: Software model checking via IC3. In: Madhusudan, P., Seshia, S.A. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a07358, pp.\u00a0277\u2013293. Springer, Heidelberg (2012)"},{"key":"10_CR49","first-page":"52","volume-title":"Formal Methods in Computer Aided Design (FMCAD)","author":"K. Claessen","year":"2012","unstructured":"Claessen, K., S\u00f6rensson, N.: A liveness checking algorithm that counts. In: Cabodi, G., Singh, S. (eds.) Formal Methods in Computer Aided Design (FMCAD), pp.\u00a052\u201359. IEEE, Piscataway (2012)"},{"issue":"1","key":"10_CR50","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10703-006-0020-3","volume":"30","author":"E. Clarke","year":"2007","unstructured":"Clarke, E., Jain, H., Kroening, D.: Verification of SpecC using predicate abstraction. Form. Methods Syst. Des. 30(1), 5\u201328 (2007)","journal-title":"Form. Methods Syst. Des."},{"key":"10_CR51","first-page":"308","volume-title":"Asia and South Pacific Design Automation Conf. (ASPDAC)","author":"E. Clarke","year":"2003","unstructured":"Clarke, E., Kroening, D.: Hardware verification using ANSI-C programs as a reference. In: Yasuura, H. (ed.) Asia and South Pacific Design Automation Conf. (ASPDAC), pp.\u00a0308\u2013311. IEEE, Piscataway (2003)"},{"key":"10_CR52","series-title":"LNCS","first-page":"168","volume-title":"Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":"E. Clarke","year":"2004","unstructured":"Clarke, E., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In: Jensen, K., Podelski, A. (eds.) Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol.\u00a02988, pp.\u00a0168\u2013176. Springer, Heidelberg (2004)"},{"issue":"2\u20133","key":"10_CR53","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1023\/B:FORM.0000040025.89719.f3","volume":"25","author":"E. Clarke","year":"2004","unstructured":"Clarke, E., Kroening, D., Sharygina, N., Yorav, K.: Predicate abstraction of ANSI-C programs using SAT. Form. Methods Syst. Des. 25(2\u20133), 105\u2013127 (2004)","journal-title":"Form. Methods Syst. Des."},{"key":"10_CR54","series-title":"LNCS","first-page":"570","volume-title":"Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","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.) Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol.\u00a03440, pp.\u00a0570\u2013574. Springer, Heidelberg (2005)"},{"issue":"5","key":"10_CR55","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1145\/876638.876643","volume":"50","author":"E.M. Clarke","year":"2003","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), 752\u2013794 (2003)","journal-title":"J. ACM"},{"issue":"5","key":"10_CR56","doi-asserted-by":"crossref","first-page":"1512","DOI":"10.1145\/186025.186051","volume":"16","author":"E.M. Clarke","year":"1994","unstructured":"Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. Trans. Program. Lang. Syst. 16(5), 1512\u20131542 (1994)","journal-title":"Trans. Program. Lang. Syst."},{"key":"10_CR57","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)"},{"issue":"2","key":"10_CR58","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/s10009-004-0182-5","volume":"7","author":"E.M. Clarke","year":"2005","unstructured":"Clarke, E.M., Kroening, D., Ouaknine, J., Strichman, O.: Computational challenges in bounded model checking. Softw. Tools Technol. Transf. 7(2), 174\u2013183 (2005)","journal-title":"Softw. Tools Technol. Transf."},{"key":"10_CR59","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/11513988_30","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"B. Cook","year":"2005","unstructured":"Cook, B., Kroening, D., Sharygina, N.: Cogent: accurate theorem proving for program verification. In: Etessami, K., Rajamani, S.K. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a03576, pp.\u00a0296\u2013300. Springer, Heidelberg (2005)"},{"key":"10_CR60","first-page":"331","volume-title":"Intl. Conf. on Software Engineering (ICSE)","author":"L. Cordeiro","year":"2011","unstructured":"Cordeiro, L., Fischer, B.: Verifying multi-threaded software using SMT-based context-bounded model checking. In: Taylor, R.N., Gall, H., Medvidovic, N. (eds.) Intl. Conf. on Software Engineering (ICSE), pp.\u00a0331\u2013340. ACM, New York (2011)"},{"key":"10_CR61","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-642-15297-9_8","volume-title":"Intl. Conf. on Formal Modeling and Analysis of Timed Systems (FORMATS)","author":"S. Cotton","year":"2010","unstructured":"Cotton, S.: Natural domain SMT: a preliminary assessment. In: Chatterjee, K., Henzinger, T.A. (eds.) Intl. Conf. on Formal Modeling and Analysis of Timed Systems (FORMATS). LNCS, vol.\u00a06246, pp.\u00a077\u201391. Springer, Heidelberg (2010)"},{"key":"10_CR62","first-page":"130","volume-title":"Design Automation Conf. (DAC)","author":"D.W. Currie","year":"2000","unstructured":"Currie, D.W., Hu, A.J., Rajan, S.P.: Automatic formal verification of DSP software. In: Micheli, G.D. (ed.) Design Automation Conf. (DAC), pp.\u00a0130\u2013135. ACM, New York (2000)"},{"key":"10_CR63","unstructured":"Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: a theorem prover for program checking. Tech. rep., HP Labs (2003)"},{"key":"10_CR64","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-642-18275-4_13","volume-title":"Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI)","author":"A. Donaldson","year":"2011","unstructured":"Donaldson, A., Haller, L., Kroening, D.: Strengthening induction-based race checking with lightweight static analysis. In: Jhala, R., Schmidt, D.A. (eds.) Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI). LNCS, vol.\u00a06538, pp.\u00a0169\u2013183. Springer, Heidelberg (2011)"},{"key":"10_CR65","series-title":"LNCS","first-page":"280","volume-title":"Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":"A. Donaldson","year":"2010","unstructured":"Donaldson, A., Kroening, D., R\u00fcmmer, P.: Automatic analysis of scratch-pad memory code for heterogeneous multicore processors. In: Esparza, J., Majumdar, R. (eds.) Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol.\u00a06015, pp.\u00a0280\u2013295. Springer, Heidelberg (2010)"},{"key":"10_CR66","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/978-3-642-33125-1_22","volume-title":"Intl. Symp. on Static Analysis (SAS)","author":"V. D\u2019Silva","year":"2012","unstructured":"D\u2019Silva, V., Haller, L., Kroening, D.: Satisfiability solvers are static analysers. In: Min\u00e9, A., Schmidt, D. (eds.) Intl. Symp. on Static Analysis (SAS). LNCS, vol.\u00a07460, pp.\u00a0317\u2013333. Springer, Heidelberg (2012)"},{"key":"10_CR67","first-page":"143","volume-title":"Symp. on Principles of Programming Languages (POPL)","author":"V. D\u2019Silva","year":"2013","unstructured":"D\u2019Silva, V., Haller, L., Kroening, D.: Abstract conflict driven learning. In: Giacobazzi, R., Cousot, R. (eds.) Symp. on Principles of Programming Languages (POPL), pp.\u00a0143\u2013154. ACM, New York (2013)"},{"key":"10_CR68","series-title":"LNCS","first-page":"48","volume-title":"Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":"V. D\u2019Silva","year":"2012","unstructured":"D\u2019Silva, V., Haller, L., Kroening, D., Tautschnig, M.: Numeric bounds analysis with conflict-driven learning. In: Flanagan, C., K\u00f6nig, B. (eds.) Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol.\u00a07214, pp.\u00a048\u201363. Springer, Berlin (2012)"},{"issue":"7","key":"10_CR69","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1109\/TCAD.2008.923410","volume":"27","author":"V. D\u2019Silva","year":"2008","unstructured":"D\u2019Silva, V., Kroening, D., Weissenbacher, G.: A survey of automated techniques for formal software verification. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 27(7), 1165\u20131178 (2008)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"issue":"10\u201311","key":"10_CR70","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1016\/j.scico.2011.07.005","volume":"77","author":"J. Dubrovin","year":"2012","unstructured":"Dubrovin, J., Junttila, T.A., Heljanko, K.: Exploiting step semantics for efficient bounded model checking of asynchronous systems. Sci. Comput. Program. 77(10\u201311), 1095\u20131121 (2012)","journal-title":"Sci. Comput. Program."},{"key":"10_CR71","first-page":"125","volume-title":"Formal Methods in Computer Aided Design (FMCAD)","author":"N. E\u00e9n","year":"2011","unstructured":"E\u00e9n, N., Mishchenko, A., Brayton, R.K.: Efficient implementation of property directed reachability. In: Bjesse, P., Slobodov\u00e1, A. (eds.) Formal Methods in Computer Aided Design (FMCAD), pp.\u00a0125\u2013134. FMCAD, Austin (2011)"},{"key":"10_CR72","series-title":"LNCS","first-page":"272","volume-title":"Theory and Applications of Satisfiability Testing (SAT)","author":"N. E\u00e9n","year":"2007","unstructured":"E\u00e9n, N., Mishchenko, A., S\u00f6rensson, N.: Applying logic synthesis for speeding up SAT. In: Marques-Silva, J., Sakallah, K.A. (eds.) Theory and Applications of Satisfiability Testing (SAT). LNCS, vol.\u00a04501, pp.\u00a0272\u2013286. Springer, Heidelberg (2007)"},{"key":"10_CR73","series-title":"LNCS","first-page":"502","volume-title":"Theory and Applications of Satisfiability Testing (SAT)","author":"N. E\u00e9n","year":"2003","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) Theory and Applications of Satisfiability Testing (SAT). LNCS, vol.\u00a02919, pp.\u00a0502\u2013518. Springer, Heidelberg (2003)"},{"key":"10_CR74","first-page":"53","volume-title":"Formal Methods in Computer Aided Design (FMCAD)","author":"N. E\u00e9n","year":"2013","unstructured":"E\u00e9n, N., Sterin, B., Claessen, K.: A circuit approach to LTL model checking. In: Jobstmann, B., Ray, S. (eds.) Formal Methods in Computer Aided Design (FMCAD), pp.\u00a053\u201360. IEEE, Piscataway (2013)"},{"issue":"7","key":"10_CR75","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1109\/43.851997","volume":"19","author":"C.A.J. Eijk van","year":"2000","unstructured":"van Eijk, C.A.J.: Sequential equivalence checking based on structural similarities. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 19(7), 814\u2013819 (2000)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"10_CR76","volume-title":"A Practical Introduction to PSL","author":"C. Eisner","year":"2006","unstructured":"Eisner, C., Fisman, D.: A Practical Introduction to PSL. Springer, Heidelberg (2006)"},{"key":"10_CR77","volume-title":"Handbook of Model Checking","author":"C. Eisner","year":"2018","unstructured":"Eisner, C., Fisman, D.: Functional specification of hardware via temporal logic. In: Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.) Handbook of Model Checking. Springer, Heidelberg (2018)"},{"key":"10_CR78","first-page":"411","volume-title":"Symp. on Principles of Programming Languages (POPL)","author":"M. Emmi","year":"2011","unstructured":"Emmi, M., Qadeer, S., Rakamaric, Z.: Delay-bounded scheduling. In: Ball, T., Sagiv, M. (eds.) Symp. on Principles of Programming Languages (POPL), pp.\u00a0411\u2013422. ACM, New York (2011)"},{"key":"10_CR79","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S1571-0661(05)80426-8","volume":"9","author":"A. Finkel","year":"1997","unstructured":"Finkel, A., Willems, B., Wolper, P.: A direct symbolic approach to model checking pushdown systems. Electron. Notes Theor. Comput. Sci. 9, 27\u201337 (1997)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10_CR80","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.scico.2013.03.005","volume":"82","author":"X. Gan","year":"2014","unstructured":"Gan, X., Dubrovin, J., Heljanko, K.: A symbolic model checking approach to verifying satellite onboard software. Sci. Comput. Program. 82, 44\u201355 (2014)","journal-title":"Sci. Comput. Program."},{"key":"10_CR81","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-69167-1","volume-title":"SAT-Based Scalable Formal Verification Solutions","author":"M.K. Ganai","year":"2007","unstructured":"Ganai, M.K., Gupta, A.: SAT-Based Scalable Formal Verification Solutions. Springer, Heidelberg (2007)"},{"key":"10_CR82","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/978-3-642-16164-3_17","volume-title":"Intl. Workshop on Model Checking Software (SPIN)","author":"N. Ghafari","year":"2010","unstructured":"Ghafari, N., Hu, A.J., Rakamaric, Z.: Context-bounded translations for concurrent software: an empirical evaluation. In: van de Pol, J., Weber, M. (eds.) Intl. Workshop on Model Checking Software (SPIN). LNCS, vol.\u00a06349, pp.\u00a0227\u2013244. Springer, Heidelberg (2010)"},{"key":"10_CR83","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"761","volume-title":"Handbook of Satisfiability","author":"E. Giunchiglia","year":"2009","unstructured":"Giunchiglia, E., Marin, P., Narizzano, M.: Reasoning with quantified boolean formulas. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185, pp.\u00a0761\u2013780. IOS Press, Amsterdam (2009)"},{"key":"10_CR84","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-63166-6_10","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"S. Graf","year":"1997","unstructured":"Graf, S., Sa\u00efdi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a01254, pp.\u00a072\u201383. Springer, Heidelberg (1997)"},{"key":"10_CR85","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.entcs.2004.12.023","volume":"119","author":"A. Groce","year":"2005","unstructured":"Groce, A., Kroening, D.: Making the most of BMC counterexamples. Electron. Notes Theor. Comput. Sci. 119, 67\u201381 (2005)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10_CR86","series-title":"LNCS","first-page":"224","volume-title":"Intl. Conf. on Formal Engineering Methods (ICFEM)","author":"A. Groce","year":"2004","unstructured":"Groce, A., Kroening, D., Clarke, E.: Counterexample guided abstraction refinement via program execution. In: Davies, J., Schulte, W., Barnett, M. (eds.) Intl. Conf. on Formal Engineering Methods (ICFEM). LNCS, vol.\u00a03308, pp.\u00a0224\u2013238. Springer, Heidelberg (2004)"},{"key":"10_CR87","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/978-3-540-27813-9_35","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"A. Groce","year":"2004","unstructured":"Groce, A., Kroening, D., Lerda, F.: Understanding counterexamples with explain. In: Alur, R., Peled, D.A. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a03114, pp.\u00a0453\u2013456. Springer, Heidelberg (2004)"},{"key":"10_CR88","volume-title":"Handbook of Model Checking","author":"A. Gupta","year":"2018","unstructured":"Gupta, A., Kahlon, V., Qadeer, S., Touili, T.: Model checking concurrent programs. In: Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.) Handbook of Model Checking. Springer, Heidelberg (2018)"},{"key":"10_CR89","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1007\/978-3-642-31424-7_38","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"Z. Hassan","year":"2012","unstructured":"Hassan, Z., Bradley, A.R., Somenzi, F.: Incremental, inductive CTL model checking. In: Madhusudan, P., Seshia, S.A. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a07358, pp.\u00a0532\u2013547. Springer, Heidelberg (2012)"},{"key":"10_CR90","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/11817963_12","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"K. Heljanko","year":"2006","unstructured":"Heljanko, K., Junttila, T.A., Kein\u00e4nen, M., Lange, M., Latvala, T.: Bounded model checking for weak alternating B\u00fcchi automata. In: Ball, T., Jones, R.B. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a04144, pp.\u00a095\u2013108. Springer, Heidelberg (2006)"},{"key":"10_CR91","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/11513988_10","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"K. Heljanko","year":"2005","unstructured":"Heljanko, K., Junttila, T.A., Latvala, T.: Incremental and complete bounded model checking for full PLTL. In: Etessami, K., Rajamani, S.K. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a03576, pp.\u00a098\u2013111. Springer, Heidelberg (2005)"},{"key":"10_CR92","first-page":"232","volume-title":"Symp. on Principles of Programming Languages (POPL)","author":"T.A. Henzinger","year":"2004","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., McMillan, K.L.: Abstractions from proofs. In: Jones, N.D., Leroy, X. (eds.) Symp. on Principles of Programming Languages (POPL), pp.\u00a0232\u2013244. ACM, New York (2004)"},{"key":"10_CR93","series-title":"LNCS","first-page":"157","volume-title":"Theory and Applications of Satisfiability Testing (SAT)","author":"K. Hoder","year":"2012","unstructured":"Hoder, K., Bj\u00f8rner, N.: Generalized property directed reachability. In: Cimatti, A., Sebastiani, R. (eds.) Theory and Applications of Satisfiability Testing (SAT). LNCS, vol.\u00a07317, pp.\u00a0157\u2013171. Springer, Heidelberg (2012)"},{"key":"10_CR94","first-page":"297","volume-title":"Intl. Conf. on Computer Design (ICCD)","author":"F. Ivancic","year":"2005","unstructured":"Ivancic, F., Shlyakhter, I., Gupta, A., Ganai, M.K.: Model checking C programs using F-SOFT. In: Intl. Conf. on Computer Design (ICCD), pp.\u00a0297\u2013308. IEEE, Piscataway (2005)"},{"key":"10_CR95","first-page":"563","volume-title":"Design Automation Conf. (DAC)","author":"H. Jain","year":"2009","unstructured":"Jain, H., Clarke, E.M.: Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts. In: Design Automation Conf. (DAC), pp.\u00a0563\u2013568. ACM, New York (2009)"},{"key":"10_CR96","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/11817963_15","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"H. Jain","year":"2006","unstructured":"Jain, H., Ivancic, F., Gupta, A., Shlyakhter, I., Wang, C.: Using statically computed invariants inside the predicate abstraction and refinement loop. In: Ball, T., Jones, R.B. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a04144, pp.\u00a0137\u2013151. Springer, Heidelberg (2006)"},{"issue":"4","key":"10_CR97","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10817-011-9239-9","volume":"49","author":"M. J\u00e4rvisalo","year":"2012","unstructured":"J\u00e4rvisalo, M., Biere, A., Heule, M.: Simulating circuit-level simplifications on CNF. J. Autom. Reason. 49(4), 583\u2013619 (2012)","journal-title":"J. Autom. Reason."},{"key":"10_CR98","first-page":"38","volume-title":"Conf. on Programming Language Design and Implementation (PLDI)","author":"R. Jhala","year":"2005","unstructured":"Jhala, R., Majumdar, R.: Path slicing. In: Sarkar, V., Hall, M.W. (eds.) Conf. on Programming Language Design and Implementation (PLDI), pp.\u00a038\u201347. ACM, New York (2005)"},{"key":"10_CR99","volume-title":"Handbook of Model Checking","author":"R. Jhala","year":"2018","unstructured":"Jhala, R., Podelski, A., Rybalchenko, A.: Predicate abstraction for program verification. In: Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.) Handbook of Model Checking. Springer, Heidelberg (2018)"},{"issue":"4","key":"10_CR100","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/S1571-0661(05)82543-5","volume":"89","author":"T. Jussila","year":"2003","unstructured":"Jussila, T., Heljanko, K., Niemel\u00e4, I.: BMC via on-the-fly determinization. Electron. Notes Theor. Comput. Sci. 89(4), 561\u2013577 (2003)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10_CR101","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/978-3-642-02658-4_31","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"V. Kahlon","year":"2009","unstructured":"Kahlon, V., Wang, C., Gupta, A.: Monotonic partial order reduction: an optimal symbolic partial order reduction technique. In: Bouajjani, A., Maler, O. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a05643, pp.\u00a0398\u2013413. Springer, Heidelberg (2009)"},{"key":"10_CR102","series-title":"LNCS","first-page":"654","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"A. Kaiser","year":"2010","unstructured":"Kaiser, A., Kroening, D., Wahl, T.: Dynamic cutoff detection in parameterized concurrent programs. In: Touili, T., Cook, B., Jackson, P. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a06174, pp.\u00a0654\u2013659. Springer, Heidelberg (2010)"},{"key":"10_CR103","first-page":"1194","volume-title":"National Conf. on Artificial Intelligence (AAAI)","author":"H.A. Kautz","year":"1996","unstructured":"Kautz, H.A., Selman, B.: Pushing the envelope: planning, propositional logic and stochastic search. In: Clancey, W.J., Weld, D.S. (eds.) National Conf. on Artificial Intelligence (AAAI), pp.\u00a01194\u20131201. AAAI Press\/MIT Press, Portland\/Cambridge (1996)"},{"key":"10_CR104","series-title":"LNCS","first-page":"66","volume-title":"Intl. Haifa Verification Conference (HVC)","author":"Z. Khasidashvili","year":"2011","unstructured":"Khasidashvili, Z., Nadel, A.: Implicative simultaneous satisfiability and applications. In: Eder, K., Louren\u00e7o, J., Shehory, O. (eds.) Intl. Haifa Verification Conference (HVC). LNCS, vol.\u00a07261, pp.\u00a066\u201379. Springer, Heidelberg (2011)"},{"issue":"7","key":"10_CR105","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/360248.360252","volume":"19","author":"J.C. King","year":"1976","unstructured":"King, J.C.: Symbolic execution and program testing. Commun. ACM 19(7), 385\u2013394 (1976)","journal-title":"Commun. ACM"},{"key":"10_CR106","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"735","volume-title":"Handbook of Satisfiability","author":"H. Kleine B\u00fcning","year":"2009","unstructured":"Kleine B\u00fcning, H., Bubeck, U.: Theory of quantified boolean formulas. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185, pp.\u00a0735\u2013760. IOS Press, Amsterdam (2009)"},{"key":"10_CR107","first-page":"44","volume-title":"Intl. Workshop on Satisfiability Modulo Theories (SMT)","author":"G. Kov\u00e1sznai","year":"2012","unstructured":"Kov\u00e1sznai, G., Fr\u00f6hlich, A., Biere, A.: On the complexity of fixed-size bit-vector logics with binary encoded bit-width. In: Fontaine, P., Goel, A. (eds.) Intl. Workshop on Satisfiability Modulo Theories (SMT), pp.\u00a044\u201355 (2012). EasyChair"},{"key":"10_CR108","first-page":"5","volume-title":"Proc. of the Verification Workshop (VERIFY)","author":"D. Kroening","year":"2002","unstructured":"Kroening, D.: Application specific higher order logic theorem proving. In: Autexier, S., Mantel, H. (eds.) Proc. of the Verification Workshop (VERIFY), pp.\u00a05\u201315 (2002)"},{"issue":"1","key":"10_CR109","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.entcs.2005.07.021","volume":"144","author":"D. Kroening","year":"2006","unstructured":"Kroening, D.: Computing over-approximations with bounded model checking. Electron. Notes Theor. Comput. Sci. 144(1), 79\u201392 (2006)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10_CR110","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"505","volume-title":"Handbook of Satisfiability","author":"D. Kroening","year":"2009","unstructured":"Kroening, D.: Software verification. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185, pp.\u00a0505\u2013532. IOS Press, Amsterdam (2009)"},{"key":"10_CR111","first-page":"66","volume-title":"Intl. Conf. on Computer-Aided Design (ICCAD)","author":"D. Kroening","year":"2004","unstructured":"Kroening, D., Clarke, E.: Checking consistency of C and Verilog using predicate abstraction and induction. In: Intl. Conf. on Computer-Aided Design (ICCAD), pp.\u00a066\u201372. IEEE\/ACM, Piscataway\/New York (2004)"},{"key":"10_CR112","first-page":"368","volume-title":"Design Automation Conf. (DAC)","author":"D. Kroening","year":"2003","unstructured":"Kroening, D., Clarke, E., Yorav, K.: Behavioral consistency of C and Verilog programs using bounded model checking. In: Design Automation Conf. (DAC), pp.\u00a0368\u2013371. ACM, New York (2003)"},{"key":"10_CR113","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/978-3-642-16242-8_35","volume-title":"Intl. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR)","author":"D. Kroening","year":"2010","unstructured":"Kroening, D., Leroux, J., R\u00fcmmer, P.: Interpolating quantifier-free Presburger arithmetic. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) Intl. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR). LNCS, vol.\u00a06397, pp.\u00a0489\u2013503. Springer, Heidelberg (2010)"},{"key":"10_CR114","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/978-3-540-27813-9_24","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"D. Kroening","year":"2004","unstructured":"Kroening, D., Ouaknine, J., Seshia, S., Strichman, O.: Abstraction-based satisfiability solving of Presburger arithmetic. In: Alur, R., Peled, D.A. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a03114, pp.\u00a0308\u2013320. Springer, Heidelberg (2004)"},{"key":"10_CR115","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/978-3-642-22110-1_44","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"D. Kroening","year":"2011","unstructured":"Kroening, D., Ouaknine, J., Strichman, O., Wahl, T., Worrell, J.: Linear completeness thresholds for bounded model checking. In: Gopalakrishnan, G., Qadeer, S. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a06806, pp.\u00a0557\u2013572. Springer, Heidelberg (2011)"},{"key":"10_CR116","series-title":"LNCS","first-page":"242","volume-title":"Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":"D. Kroening","year":"2006","unstructured":"Kroening, D., Sharygina, N.: Approximating predicate images for bit-vector logic. In: Hermanns, H., Palsberg, J. (eds.) Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol.\u00a03920, pp.\u00a0242\u2013256. Springer, Heidelberg (2006)"},{"key":"10_CR117","first-page":"668","volume-title":"Intl. Conf. on Automated Software Engineering (ASE)","author":"D. Kroening","year":"2009","unstructured":"Kroening, D., Sharygina, N., Tonetta, S., Tsitovich, A., Wintersteiger, C.: Loopfrog: a static analyzer for ANSI-C programs. In: Intl. Conf. on Automated Software Engineering (ASE), pp.\u00a0668\u2013670. IEEE, Piscataway (2009)"},{"key":"10_CR118","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-540-88387-6_10","volume-title":"Intl. Symp. on Automated Technology for Verification and Analysis (ATVA)","author":"D. Kroening","year":"2008","unstructured":"Kroening, D., Sharygina, N., Tonetta, S., Tsitovich, A., Wintersteiger, C.M.: Loop summarization using abstract transformers. In: Cha, S.D., Choi, J., Kim, M., Lee, I., Viswanathan, M. (eds.) Intl. Symp. on Automated Technology for Verification and Analysis (ATVA). LNCS, vol.\u00a05311, pp.\u00a0111\u2013125. Springer, Heidelberg (2008)"},{"key":"10_CR119","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/3-540-36384-X_24","volume-title":"Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI)","author":"D. Kroening","year":"2003","unstructured":"Kroening, D., Strichman, O.: Efficient computation of recurrence diameters. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI). LNCS, vol.\u00a02575, pp.\u00a0298\u2013309. Springer, Heidelberg (2003)"},{"key":"10_CR120","volume-title":"Decision Procedures","author":"D. Kroening","year":"2008","unstructured":"Kroening, D., Strichman, O.: Decision Procedures. Springer, Heidelberg (2008)"},{"key":"10_CR121","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/11817963_16","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"D. Kroening","year":"2006","unstructured":"Kroening, D., Weissenbacher, G.: Counterexamples with loops for predicate abstraction. In: Ball, T., Jones, R.B. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a04144, pp.\u00a0152\u2013165. Springer, Heidelberg (2006)"},{"key":"10_CR122","first-page":"50","volume-title":"Intl. Conf. on Computer-Aided Design (ICCAD)","author":"A. Kuehlmann","year":"2004","unstructured":"Kuehlmann, A.: Dynamic transition relation simplification for bounded property checking. In: Intl. Conf. on Computer-Aided Design (ICCAD), pp.\u00a050\u201357. IEEE\/ACM, Piscataway\/New York (2004)"},{"issue":"12","key":"10_CR123","doi-asserted-by":"crossref","first-page":"1377","DOI":"10.1109\/TCAD.2002.804386","volume":"21","author":"A. Kuehlmann","year":"2002","unstructured":"Kuehlmann, A., Paruthi, V., Krohm, F., Ganai, M.K.: Robust boolean reasoning for equivalence checking and functional property verification. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 21(12), 1377\u20131394 (2002)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"10_CR124","series-title":"LNCS","first-page":"32","volume-title":"Intl. Haifa Verification Conference (HVC)","author":"T. Kuismin","year":"2013","unstructured":"Kuismin, T., Heljanko, K.: Increasing confidence in liveness model checking results with proofs. In: Bertacco, V., Legay, A. (eds.) Intl. Haifa Verification Conference (HVC). LNCS, vol.\u00a08244, pp.\u00a032\u201343. Springer, Heidelberg (2013)"},{"key":"10_CR125","volume-title":"Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach","author":"R.P. Kurshan","year":"1994","unstructured":"Kurshan, R.P.: Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, Princeton (1994)"},{"key":"10_CR126","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/978-3-642-02658-4_38","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"S.K. Lahiri","year":"2009","unstructured":"Lahiri, S.K., Qadeer, S., Rakamaric, Z.: Static and precise detection of concurrency errors in systems code using SMT solvers. In: Bouajjani, A., Maler, O. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a05643, pp.\u00a0509\u2013524. Springer, Heidelberg (2009)"},{"issue":"1","key":"10_CR127","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10703-009-0078-9","volume":"35","author":"A. Lal","year":"2009","unstructured":"Lal, A., Reps, T.W.: Reducing concurrent analysis under a context bound to sequential analysis. Form. Methods Syst. Des. 35(1), 73\u201397 (2009)","journal-title":"Form. Methods Syst. Des."},{"key":"10_CR128","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/978-3-540-30494-4_14","volume-title":"Formal Methods in Computer Aided Design (FMCAD)","author":"T. Latvala","year":"2004","unstructured":"Latvala, T., Biere, A., Heljanko, K., Junttila, T.A.: Simple bounded LTL model checking. In: Hu, A.J., Martin, A.K. (eds.) Formal Methods in Computer Aided Design (FMCAD). LNCS, vol.\u00a03312, pp.\u00a0186\u2013200. Springer, Heidelberg (2004)"},{"key":"10_CR129","series-title":"LNCS","first-page":"227","volume-title":"Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":"B. Li","year":"2006","unstructured":"Li, B., Somenzi, F.: Efficient abstraction refinement in interpolation-based unbounded model checking. In: Hermanns, H., Palsberg, J. (eds.) Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol.\u00a03920, pp.\u00a0227\u2013241. Springer, Heidelberg (2006)"},{"issue":"2","key":"10_CR130","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10009-004-0169-2","volume":"7","author":"B. Li","year":"2005","unstructured":"Li, B., Wang, C., Somenzi, F.: Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure. Softw. Tools Technol. Transf. 7(2), 143\u2013155 (2005)","journal-title":"Softw. Tools Technol. Transf."},{"key":"10_CR131","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/3-540-45657-0_19","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"K.L. McMillan","year":"2002","unstructured":"McMillan, K.L.: Applying SAT methods in unbounded symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a02404, pp.\u00a0250\u2013264. Springer, Heidelberg (2002)"},{"key":"10_CR132","series-title":"LNCS","first-page":"1","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"K.L. McMillan","year":"2003","unstructured":"McMillan, K.L.: Interpolation and SAT-based model checking. In: Hunt, W.A. Jr., Somenzi, F. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a02725, pp.\u00a01\u201313. Springer, Heidelberg (2003)"},{"key":"10_CR133","series-title":"LNCS","first-page":"16","volume-title":"Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":"K.L. McMillan","year":"2004","unstructured":"McMillan, K.L.: An interpolating theorem prover. In: Jensen, K., Podelski, A. (eds.) Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol.\u00a02988, pp.\u00a016\u201330. Springer, Heidelberg (2004)"},{"key":"10_CR134","volume-title":"Handbook of Model Checking","author":"K.L. McMillan","year":"2018","unstructured":"McMillan, K.L.: Interpolation and model checking. In: Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.) Handbook of Model Checking. Springer, Heidelberg (2018)"},{"key":"10_CR135","series-title":"LNCS","first-page":"2","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"K.L. McMillan","year":"2003","unstructured":"McMillan, K.L., Amla, N.: Automatic abstraction without counterexamples. In: Garavel, H., Hatcliff, J. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a02619, pp.\u00a02\u201317. Springer, Heidelberg (2003)"},{"key":"10_CR136","first-page":"530","volume-title":"Design Automation Conf. (DAC)","author":"M.W. Moskewicz","year":"2001","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Design Automation Conf. (DAC), pp.\u00a0530\u2013535. ACM, New York (2001)"},{"key":"10_CR137","first-page":"45","volume-title":"Formal Methods in Computer Aided Design (FMCAD)","author":"L.M. Moura de","year":"2009","unstructured":"de Moura, L.M., Bj\u00f8rner, N.: Generalized, efficient array decision procedures. In: Formal Methods in Computer Aided Design (FMCAD), pp.\u00a045\u201352. IEEE, Piscataway (2009)"},{"issue":"6","key":"10_CR138","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1145\/1217856.1217859","volume":"53","author":"R. Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: From an abstract Davis\u2013Putnam\u2013Logemann\u2013Loveland procedure to DPLL(T). J. ACM 53(6), 937\u2013977 (2006)","journal-title":"J. ACM"},{"issue":"1\u20132","key":"10_CR139","first-page":"135","volume":"51","author":"W. Penczek","year":"2002","unstructured":"Penczek, W., Wozna, B., Zbrzezny, A.: Bounded model checking for the universal fragment of CTL. Fundam. Inform. 51(1\u20132), 135\u2013156 (2002)","journal-title":"Fundam. Inform."},{"key":"10_CR140","volume-title":"Handbook of Model Checking","author":"N. Piterman","year":"2018","unstructured":"Piterman, N., Pnueli, A.: Temporal logic and fair discrete systems. In: Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.) Handbook of Model Checking. Springer, Heidelberg (2018)"},{"issue":"2","key":"10_CR141","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/s10009-004-0183-4","volume":"7","author":"M. Prasad","year":"2005","unstructured":"Prasad, M., Biere, A., Gupta, A.: A survey on recent advances in SAT-based formal verification. Softw. Tools Technol. Transf. 7(2), 156\u2013173 (2005)","journal-title":"Softw. Tools Technol. Transf."},{"key":"10_CR142","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"75","volume-title":"Handbook of Satisfiability","author":"S.D. Prestwich","year":"2009","unstructured":"Prestwich, S.D.: CNF encodings. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185, pp.\u00a075\u201397. IOS Press, Amsterdam (2009)"},{"key":"10_CR143","series-title":"LNCS","first-page":"93","volume-title":"Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":"S. Qadeer","year":"2005","unstructured":"Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Halbwachs, N., Zuck, L.D. (eds.) Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol.\u00a03440, pp.\u00a093\u2013107. Springer, Heidelberg (2005)"},{"key":"10_CR144","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/11513988_9","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"I. Rabinovitz","year":"2005","unstructured":"Rabinovitz, I., Grumberg, O.: Bounded model checking of concurrent programs. In: Etessami, K., Rajamani, S.K. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a03576, pp.\u00a082\u201397. Springer, Heidelberg (2005)"},{"key":"10_CR145","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.artint.2012.08.001","volume":"193","author":"J. Rintanen","year":"2012","unstructured":"Rintanen, J.: Planning as satisfiability: heuristics. Artif. Intell. 193, 45\u201386 (2012)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"10_CR146","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s10009-003-0121-x","volume":"5","author":"V. Schuppan","year":"2004","unstructured":"Schuppan, V., Biere, A.: Efficient reduction of finite state model checking to reachability analysis. Softw. Tools Technol. Transf. 5(1\u20132), 185\u2013204 (2004)","journal-title":"Softw. Tools Technol. Transf."},{"issue":"3\u20134","key":"10_CR147","first-page":"141","volume":"3","author":"R. Sebastiani","year":"2007","unstructured":"Sebastiani, R.: Lazy satisfiability modulo theories. J. Satisf. Boolean Model. Comput. 3(3\u20134), 141\u2013224 (2007)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"10_CR148","series-title":"LNCS","first-page":"108","volume-title":"Formal Methods in Computer Aided Design (FMCAD)","author":"M. Sheeran","year":"2000","unstructured":"Sheeran, M., Singh, S., St\u00e5lmarck, G.: Checking safety properties using induction and a SAT-solver. In: Hunt, W.A. Jr., Johnson, S.D. (eds.) Formal Methods in Computer Aided Design (FMCAD). LNCS, vol.\u00a01954, pp.\u00a0108\u2013125. Springer, Heidelberg (2000)"},{"key":"10_CR149","first-page":"47","volume-title":"Intl. Symp. on Foundations of Software Engineering (FSE)","author":"N. Sinha","year":"2010","unstructured":"Sinha, N., Wang, C.: Staged concurrent program analysis. In: Roman, G.C., Sullivan, K.J. (eds.) Intl. Symp. on Foundations of Software Engineering (FSE), pp.\u00a047\u201356. ACM, New York (2010)"},{"key":"10_CR150","first-page":"423","volume-title":"Symp. on Principles of Programming Languages (POPL)","author":"N. Sinha","year":"2011","unstructured":"Sinha, N., Wang, C.: On interference abstractions. In: Ball, T., Sagiv, M. (eds.) Symp. on Principles of Programming Languages (POPL), pp.\u00a0423\u2013434. ACM, New York (2011)"},{"key":"10_CR151","series-title":"Seminars in Mathematics","first-page":"234","volume-title":"Studies in Constructive Mathematics and Mathematical Logic, Part II","author":"G.S. Tseitin","year":"1968","unstructured":"Tseitin, G.S.: On the complexity of derivation in propositional calculus. In: Studies in Constructive Mathematics and Mathematical Logic, Part II. Seminars in Mathematics, vol.\u00a08, pp.\u00a0234\u2013259 (1968). V.A. Steklov Mathematical Institute. English Translation, Consultants Bureau, pp.\u00a0115\u2013125 (1970)"},{"issue":"1","key":"10_CR152","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1994.1092","volume":"115","author":"M.Y. Vardi","year":"1994","unstructured":"Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Inf. Comput. 115(1), 1\u201337 (1994)","journal-title":"Inf. Comput."},{"key":"10_CR153","first-page":"310","volume-title":"Asia and South Pacific Design Automation Conf. (ASPDAC)","author":"M.N. Velev","year":"2004","unstructured":"Velev, M.N.: Efficient translation of boolean formulas to CNF in formal verification of microprocessors. In: Imai, M. (ed.) Asia and South Pacific Design Automation Conf. (ASPDAC), pp.\u00a0310\u2013315. IEEE, Piscataway (2004)"},{"key":"10_CR154","volume-title":"A Practical Guide for SystemVerilog Assertions","author":"S. Vijayaraghavan","year":"2005","unstructured":"Vijayaraghavan, S., Ramanathan, M.: A Practical Guide for SystemVerilog Assertions. Springer, Heidelberg (2005)"},{"issue":"11","key":"10_CR155","doi-asserted-by":"publisher","first-page":"2021","DOI":"10.1109\/JPROC.2015.2455034","volume":"103","author":"Y. Vizel","year":"2015","unstructured":"Vizel, Y., Weissenbacher, G., Malik, S.: Boolean satisfiability solvers and their applications in model checking. Proc. IEEE 103(11), 2021\u20132035 (2015). doi:10.1109\/JPROC.2015.2455034","journal-title":"Proc. IEEE"},{"key":"10_CR156","series-title":"LNCS","first-page":"150","volume-title":"Intl. Haifa Verification Conference (HVC)","author":"G. Weissenbacher","year":"2009","unstructured":"Weissenbacher, G., Kroening, D.: An interpolating decision procedure for transitive relations with uninterpreted functions. In: Namjoshi, K.S., Zeller, A., Ziv, A. (eds.) Intl. Haifa Verification Conference (HVC). LNCS, vol.\u00a06405, pp.\u00a0150\u2013168. Springer, Heidelberg (2009)"},{"key":"10_CR157","first-page":"501","volume-title":"Intl. Conf. on Automated Software Engineering (ASE)","author":"T. Witkowski","year":"2007","unstructured":"Witkowski, T., Blanc, N., Weissenbacher, G., Kroening, D.: Model checking concurrent Linux device drivers. In: Stirewalt, R.E.K., Egyed, A., Fischer, B. (eds.) Intl. Conf. on Automated Software Engineering (ASE), pp.\u00a0501\u2013504. ACM, New York (2007)"}],"container-title":["Handbook of Model Checking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10575-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T04:11:06Z","timestamp":1526616666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10575-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319105741","9783319105758"],"references-count":157,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10575-8_10","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}