{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:58:14Z","timestamp":1742381894132,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540472377"},{"type":"electronic","value":"9783540472384"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11901914_6","type":"book-chapter","created":{"date-parts":[[2006,10,10]],"date-time":"2006-10-10T05:21:43Z","timestamp":1160457703000},"page":"39-50","source":"Crossref","is-referenced-by-count":1,"title":["A Probabilistic Learning Approach for Counterexample Guided Abstraction Refinement"],"prefix":"10.1007","author":[{"given":"Fei","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyu","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaguang","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","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":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/3-540-45657-0_20","volume-title":"Computer Aided Verification","author":"E.M. Clarke","year":"2002","unstructured":"Clarke, E.M., Gupta, A., Kukula, J.H., Strichman, O.: SAT based abstraction-refinement using ILP and machine learning techniques. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 265\u2013279. Springer, Heidelberg (2002)"},{"issue":"7","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1109\/TCAD.2004.829807","volume":"23","author":"E. Clarke","year":"2004","unstructured":"Clarke, E., Gupta, A., Strichman, O.: SAT based counterexample-guided abstraction-refinement. IEEE Transactions on Computer Aided Design\u00a023(7), 1113\u20131123 (2004)","journal-title":"IEEE Transactions on Computer Aided Design"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: Symposium on Principles of Programming Languages, pp. 58\u201370 (2002)","DOI":"10.1145\/565816.503279"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-36577-X_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Glusman","year":"2003","unstructured":"Glusman, M., Kamhi, G., Mador-Haim, S., Fraer, R., Vardi, M.Y.: Multiple-counterexample guided iterative abstraction refinement: an industrial evaluation. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 176\u2013191. Springer, Heidelberg (2003)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/11513988_11","volume-title":"Computer Aided Verification","author":"A. Gupta","year":"2005","unstructured":"Gupta, A., Strichman, O.: Abstraction refinement for bounded model checking. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 112\u2013124. Springer, Heidelberg (2005)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Govindaraju, S.G., Dill, D.L.: Counterexample-guided choice of projections in approximate symbolic model checking. In: ICCAD, pp. 115\u2013119 (2000)","DOI":"10.1109\/ICCAD.2000.896460"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-36577-X_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K.L. McMillan","year":"2003","unstructured":"McMillan, K.L., Amla, N.: Automatic abstraction without counterexamples. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 2\u201317. Springer, Heidelberg (2003)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Gupta, A., Ganai, M.K., Yang, Z., Ashar, P.: Iterative abstraction using SAT-based BMC with proof analysis. In: ICCAD, pp. 416\u2013423 (2003)","DOI":"10.1109\/ICCAD.2003.1257811"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Wang, C., Jin, H., Hachtel, G.D., Somenzi, F.: Refining the SAT decision ordering for bounded model checking. In: DAC, pp. 535\u2013538 (2004)","DOI":"10.1145\/996566.996713"},{"key":"6_CR11","doi-asserted-by":"crossref","DOI":"10.1201\/9781482273960","volume-title":"Evolutionary Computation","author":"D. Dumitrescu","year":"2000","unstructured":"Dumitrescu, D., Lazzerini, B., Jain, L., Dumitrescu, A.: Evolutionary Computation. CRC Press, Boca Raton (2000)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"J. Beasley","year":"1996","unstructured":"Beasley, J., Chu, P.: A genetic algorithm for the set covering problem. European Journal of Operational Research\u00a094, 392\u2013404 (1996)","journal-title":"European Journal of Operational Research"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/162754.162852","volume-title":"Proceedings of the 1993 ACM\/SIGAPP symposium on Applied computing","author":"S. Sen","year":"1993","unstructured":"Sen, S.: Minimal cost set covering using probabilistic methods. In: Proceedings of the 1993 ACM\/SIGAPP symposium on Applied computing, Indianapolis, Indiana, United States, pp. 157\u2013164. ACM Press, New York (1993)"},{"issue":"10","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1057\/palgrave.jors.2601317","volume":"53","author":"U. Aickelin","year":"2002","unstructured":"Aickelin, U.: An indirect genetic algorithm for set covering problems. Journal of the Operational Research Society\u00a053(10), 1118\u20131126 (2002)","journal-title":"Journal of the Operational Research Society"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-45561-2_36","volume-title":"Real-World Applications of Evolutionary Computing","author":"E. Marchiori","year":"2000","unstructured":"Marchiori, E., Steenbeek, A.: An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling. In: Oates, M.J., Lanzi, P.L., Li, Y., Cagnoni, S., Corne, D.W., Fogarty, T.C., Poli, R., Smith, G.D. (eds.) EvoIASP 2000, EvoWorkshops 2000, EvoFlight 2000, EvoSCONDI 2000, EvoSTIM 2000, EvoTEL 2000, and EvoROB\/EvoRobot 2000. LNCS, vol.\u00a01803, pp. 367\u2013381. Springer, Heidelberg (2000)"},{"key":"6_CR16","first-page":"2","volume-title":"Proceedings of the 3rd International Conference on Genetic Algorithms","author":"G. Syswerda","year":"1989","unstructured":"Syswerda, G.: Uniform crossover in genetic algorithms. In: Proceedings of the 3rd International Conference on Genetic Algorithms, San Mateo, California, USA, pp. 2\u20139. Morgan Kaufmann Publishers Inc., San Francisco (1989)"},{"key":"6_CR17","first-page":"230","volume-title":"Proceedings of the Fourth International Conference on Genetic Algorithms","author":"W.M. Spears","year":"1991","unstructured":"Spears, W.M., De Jong, K.A.: On the virtues of parameterized uniform crossover. In: Belew, R., Booker, L. (eds.) Proceedings of the Fourth International Conference on Genetic Algorithms, San Mateo, CA, pp. 230\u2013236. Morgan Kaufman, San Francisco (1991)"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11901914_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T09:47:42Z","timestamp":1736588862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11901914_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540472377","9783540472384"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11901914_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}