{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T20:23:22Z","timestamp":1743971002885,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002540"},{"type":"electronic","value":"9783642002557"}],"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-00255-7_22","type":"book-chapter","created":{"date-parts":[[2009,2,7]],"date-time":"2009-02-07T07:12:32Z","timestamp":1233990752000},"page":"322-336","source":"Crossref","is-referenced-by-count":8,"title":["Dynamic Path Reduction for Software Model Checking"],"prefix":"10.1007","author":[{"given":"Zijiang","family":"Yang","sequence":"first","affiliation":[]},{"given":"Bashar","family":"Al-Rawi","sequence":"additional","affiliation":[]},{"given":"Karem","family":"Sakallah","sequence":"additional","affiliation":[]},{"given":"Xiaowan","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Scott","family":"Smolka","sequence":"additional","affiliation":[]},{"given":"Radu","family":"Grosu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Ball, T., Majumdar, R., Millstein, T.D., Rajamani, S.K.: Automatic predicate abstraction of C programs. In: SIGPLAN Conference on Programming Language Design and Implementation, pp. 203\u2013213 (2001)","DOI":"10.1145\/378795.378846"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Cadar, C., Ganesh, V., Pawlowski, P., Dill, D., Engler, D.: EXE: automatically generating inputs of death. In: ACM conference on Computer and communications security (CCS) (2006)","DOI":"10.1145\/1180405.1180445"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 154\u2013169. Springer, Heidelberg (2000)"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11817963_11","volume-title":"Computer Aided Verification","author":"B. Dutertre","year":"2006","unstructured":"Dutertre, B., de Moura, L.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 81\u201394. Springer, Heidelberg (2006)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60761-7","volume-title":"Partial-Order Methods for the Verification of Concurrent Systems","author":"P. Godefroid","year":"1996","unstructured":"Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems. LNCS, vol.\u00a01032. Springer, Heidelberg (1996)"},{"key":"22_CR6","first-page":"174","volume-title":"POPL 1997: Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"P. Godefroid","year":"1997","unstructured":"Godefroid, P.: Model checking for programming languages using VeriSoft. In: POPL 1997: Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 174\u2013186. ACM Press, New York (1997)"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Klarlund, N., Sen, K.: DART: Directed automated random testing. In: ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation (PLDI) (2005)","DOI":"10.1145\/1065010.1065036"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Ivancic, F., Yang, Z., Ganai, M., Gupta, A., Ashar, P.: Efficient sat-based bounded model checking for software verification. Theoretical Computer Science\u00a0404(3) (2008)","DOI":"10.1016\/j.tcs.2008.03.013"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Majumdar, R., Sen, K.: Hybrid concolic testing. In: International Conference on Software Engineering (ICSE) (2007)","DOI":"10.1109\/ICSE.2007.41"},{"key":"22_CR10","volume-title":"Symbolic Model Checking","author":"K.L. McMillan","year":"1994","unstructured":"McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Boston (1994)"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1993","unstructured":"Peled, D.: All from one, one for all: on model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 409\u2013423. Springer, Heidelberg (1993)"},{"key":"22_CR12","unstructured":"Silva, J.P.M., Sakallah, K.A.: GRASP\u2014a new search algorithm for satisfiability. In: ICCAD 1996: Proceedings of the 1996 IEEE\/ACM international conference on Computer-aided design, pp. 220\u2013227 (1996)"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/3-540-53863-1_36","volume-title":"Advances in Petri Nets 1990","author":"A. Valmari","year":"1991","unstructured":"Valmari, A.: Stubborn sets for reduced state generation. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol.\u00a0483, pp. 491\u2013515. Springer, Heidelberg (1991)"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/11901914_9","volume-title":"Automated Technology for Verification and Analysis","author":"C. Wang","year":"2006","unstructured":"Wang, C., Yang, Z.-J., Ivan\u010di\u0107, F., Gupta, A.: Whodunit? Causal analysis for counterexamples. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol.\u00a04218, pp. 82\u201395. Springer, Heidelberg (2006)"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Wang, C., Yang, Z., Ivancic, F., Gupta, A.: Disjunctive image computation for software verfication. ACM Transactions on Design Automation of Electronic Systems\u00a012(2) (2007)","DOI":"10.1145\/1230800.1230802"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Yang, Z., Wang, C., Gupta, A., Ivancic, F.: Model checking sequential software programs via mixed symbolic analysis. In: ACM Transactions on Design Automation of Electronic Systems (TODAES) (to appear)","DOI":"10.1145\/1455229.1455239"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, X., Gupta, R., Zhang, Y.: Precise dynamic slicing algorithms. In: IEEE\/ACM International Conference on Software Engineering, pp. 319\u2013329 (2003)","DOI":"10.1109\/ICSE.2003.1201211"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00255-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T13:02:13Z","timestamp":1738933333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00255-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002540","9783642002557"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00255-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}