{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T05:00:53Z","timestamp":1769749253451,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642331183","type":"print"},{"value":"9783642331190","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33119-0_5","type":"book-chapter","created":{"date-parts":[[2012,9,7]],"date-time":"2012-09-07T11:50:13Z","timestamp":1347018613000},"page":"45-59","source":"Crossref","is-referenced-by-count":10,"title":["On the Application of SAT Solvers to the Test Suite Minimization Problem"],"prefix":"10.1007","author":[{"given":"Franco","family":"Arito","sequence":"first","affiliation":[]},{"given":"Francisco","family":"Chicano","sequence":"additional","affiliation":[]},{"given":"Enrique","family":"Alba","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Frontiers in Artificial Intelligence and Applications","volume-title":"Handbook of Satisfiability","author":"A. Biere","year":"2009","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T.: Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185. IOS Press, Amsterdam (2009)"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/800157.805047","volume-title":"Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC 1971","author":"S.A. Cook","year":"1971","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC 1971, pp. 151\u2013158. ACM, New York (1971)"},{"issue":"7","key":"5_CR3","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Commun. ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"key":"5_CR4","unstructured":"Deb, K.: Multi-objective optimization using evolutionary algorithms. John Wiley & Sons (2001)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10664-005-3861-2","volume":"10","author":"H. Do","year":"2005","unstructured":"Do, H., Elbaum, S., Rothermel, G.: Supporting controlled experimentation with testing techniques: An infrastructure and its potential impact. Empirical Software Engineering\u00a010, 405\u2013435 (2005)","journal-title":"Empirical Software Engineering"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"issue":"1-4","key":"5_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190014","volume":"2","author":"N. E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating Pseudo-Boolean Constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation\u00a02(1-4), 1\u201326 (2006)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"5_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0017434","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"C. Gomes","year":"1997","unstructured":"Gomes, C., Selman, B., Crato, N.: Heavy-tailed Distributions in Combinatorial Search. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 121\u2013135. Springer, Heidelberg (1997)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Hsu, H.Y., Orso, A.: MINTS: A general framework and tool for supporting test-suite minimization. In: IEEE 31st International Conference on Software Engineering, ICSE 2009, pp. 419\u2013429 (May 2009)","DOI":"10.1109\/ICSE.2009.5070541"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/ICSE.1994.296778","volume-title":"Proceedings of the 16th International Conference on Software Engineering, ICSE 1994","author":"M. Hutchins","year":"1994","unstructured":"Hutchins, M., Foster, H., Goradia, T., Ostrand, T.: Experiments of the effectiveness of dataflow- and controlflow-based test adequacy criteria. In: Proceedings of the 16th International Conference on Software Engineering, ICSE 1994, pp. 191\u2013200. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J.: Practical applications of boolean satisfiability. In: 9th International Workshop on Discrete Event Systems, WODES 2008, pp. 74 \u201380 (May 2008)","DOI":"10.1109\/WODES.2008.4605925"},{"key":"5_CR13","unstructured":"Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In: Proceedings of the Tenth National Conference on Artificial Intelligence, AAAI 1992, pp. 459\u2013465. AAAI Press (1992)"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1145\/378239.379017","volume-title":"Proceedings of the 38th Annual Design Automation Conference, DAC 2001","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: Proceedings of the 38th Annual Design Automation Conference, DAC 2001, pp. 530\u2013535. ACM, New York (2001)"},{"key":"5_CR15","first-page":"220","volume-title":"Proceedings of the 1996 IEEE\/ACM International Conference on Computer-aided Design","author":"J.P.M. Silva","year":"1996","unstructured":"Silva, J.P.M., Sakallah, K.A.: Grasp: A new search algorithm for satisfiability. In: Proceedings of the 1996 IEEE\/ACM International Conference on Computer-aided Design, pp. 220\u2013227. IEEE Computer Society, Washington, DC (1996)"},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0004-3702(77)90029-7","volume":"9","author":"R.M. Stallman","year":"1977","unstructured":"Stallman, R.M., Sussman, G.J.: Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence\u00a09(2), 135\u2013196 (1977)","journal-title":"Artificial Intelligence"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Yoo, S., Harman, M.: Regression testing minimization, selection and prioritization: a survey. Software Testing, Verification and Reliability (2010), http:\/\/dx.doi.org\/10.1002\/stvr.430 , doi: 10.1002\/stvr.430","DOI":"10.1002\/stvr.430"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/1572272.1572297","volume-title":"Proceedings of the Eighteenth International Symposium on Software Testing and Analysis, ISSTA 2009","author":"L. Zhang","year":"2009","unstructured":"Zhang, L., Hou, S.S., Guo, C., Xie, T., Mei, H.: Time-aware test-case prioritization using integer linear programming. In: Proceedings of the Eighteenth International Symposium on Software Testing and Analysis, ISSTA 2009, pp. 213\u2013224. ACM, New York (2009)"}],"container-title":["Lecture Notes in Computer Science","Search Based Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33119-0_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:55:47Z","timestamp":1620129347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33119-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331183","9783642331190"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33119-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}