{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:35:37Z","timestamp":1725730537667},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389153"},{"type":"electronic","value":"9783642389160"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38916-0_3","type":"book-chapter","created":{"date-parts":[[2013,6,9]],"date-time":"2013-06-09T22:13:47Z","timestamp":1370816027000},"page":"39-55","source":"Crossref","is-referenced-by-count":13,"title":["Model-Based Testing for Verification Back-Ends"],"prefix":"10.1007","author":[{"given":"Cyrille","family":"Artho","sequence":"first","affiliation":[]},{"given":"Armin","family":"Biere","sequence":"additional","affiliation":[]},{"given":"Martina","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"3_CR1","first-page":"1165","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. TCAD\u00a027(7), 1165\u20131178 (2008)","journal-title":"TCAD"},{"key":"3_CR2","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. IOS Press (2009)"},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/s10009-004-0183-4","volume":"7","author":"M.R. Prasad","year":"2005","unstructured":"Prasad, M.R., Biere, A., Gupta, A.: A survey of recent advances in SAT-based formal verification. STTT\u00a07(2), 156\u2013173 (2005)","journal-title":"STTT"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-14186-7_6","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"R. Brummayer","year":"2010","unstructured":"Brummayer, R., Lonsing, F., Biere, A.: Automated Testing and Debugging of SAT and QBF Solvers. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol.\u00a06175, pp. 44\u201357. Springer, Heidelberg (2010)"},{"key":"3_CR5","unstructured":"Biere, A.: Lingeling and Friends at the SAT Competition 2011. FMV Report Series Technical Report 11(1) (2011)"},{"issue":"7","key":"3_CR6","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. Communications of the ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Brummayer, R., Biere, A.: Fuzzing and delta-debugging SMT solvers. In: Proc. of the Workshop on Satisfiability Modulo Theories, pp. 1\u20135. ACM (2009)","DOI":"10.1145\/1670412.1670413"},{"issue":"4-6","key":"3_CR8","first-page":"741","volume":"10","author":"R. Brummayer","year":"2010","unstructured":"Brummayer, R., J\u00e4rvisalo, M.: Testing and debugging techniques for answer set solver development. TPLP\u00a010(4-6), 741\u2013758 (2010)","journal-title":"TPLP"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-28891-3_12","volume-title":"NASA Formal Methods","author":"P. Cuoq","year":"2012","unstructured":"Cuoq, P., Monate, B., Pacalet, A., Prevosto, V., Regehr, J., Yakobowski, B., Yang, X.: Testing static analyzers with randomly generated programs. In: Goodloe, A.E., Person, S. (eds.) NFM 2012. LNCS, vol.\u00a07226, pp. 120\u2013125. Springer, Heidelberg (2012)"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-30473-6_14","volume-title":"Tests and Proofs","author":"N. Creignou","year":"2012","unstructured":"Creignou, N., Egly, U., Seidl, M.: A Framework for the Specification of Random SAT and QSAT Formulas. In: Brucker, A.D., Julliand, J. (eds.) TAP 2012. LNCS, vol.\u00a07305, pp. 163\u2013168. Springer, Heidelberg (2012)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-540-30201-8_33","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"E. Nudelman","year":"2004","unstructured":"Nudelman, E., Leyton-Brown, K., Hoos, H.H., Devkar, A., Shoham, Y.: Understanding Random SAT: Beyond the Clauses-to-Variables Ratio. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 438\u2013452. Springer, Heidelberg (2004)"},{"key":"3_CR12","unstructured":"P\u00e9rez, J.A.N., Voronkov, A.: Generation of Hard Non-Clausal Random Satisfiability Problems. In: Proc. of AAAI\/IAAA, AAAI, pp. 436\u2013442. The MIT Press (2005)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Misherghi, G., Su, Z.: HDD: hierarchical Delta Debugging. In: Proc. of ICSE, pp. 142\u2013151. ACM (2006)","DOI":"10.1145\/1134285.1134307"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Artho, C., Biere, A., Hagiya, M., Potter, R., Ramler, R., Tanabe, Y., Yamamoto, F.: Modbat: A model-based API tester for event-driven systems. In: Dependable Systems Workshop (2012)","DOI":"10.1007\/978-3-319-03077-7_8"},{"issue":"9","key":"3_CR15","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/357766.351266","volume":"35","author":"K. Claessen","year":"2000","unstructured":"Claessen, K., Hughes, J.: Quickcheck: a lightweight tool for random testing of haskell programs. ACM Sigplan Notices\u00a035(9), 268\u2013279 (2000)","journal-title":"ACM Sigplan Notices"},{"issue":"5","key":"3_CR16","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/stvr.456","volume":"22","author":"M. Utting","year":"2012","unstructured":"Utting, M., Pretschner, A., Legeard, B.: A taxonomy of model-based testing approaches. Softw. Test., Verif.\u00a0Reliab.\u00a022(5), 297\u2013312 (2012)","journal-title":"Softw. Test., Verif.\u00a0Reliab."},{"issue":"3","key":"3_CR17","first-page":"41","volume":"1","author":"H. Dai","year":"2010","unstructured":"Dai, H., Murphy, C., Kaiser, G.E.: Confu: Configuration fuzzing testing framework for software vulnerability detection. IJSSE\u00a01(3), 41\u201355 (2010)","journal-title":"IJSSE"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-642-24485-8_31","volume-title":"Model Driven Engineering Languages and Systems","author":"H. Cichos","year":"2011","unstructured":"Cichos, H., Oster, S., Lochau, M., Sch\u00fcrr, A.: Model-Based Coverage-Driven Test Suite Generation for Software Product Lines. In: Whittle, J., Clark, T., K\u00fchne, T. (eds.) MODELS 2011. LNCS, vol.\u00a06981, pp. 425\u2013439. Springer, Heidelberg (2011)"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-540-24617-6_18","volume-title":"Formal Approaches to Software Testing","author":"M. Barnett","year":"2004","unstructured":"Barnett, M., Grieskamp, W., Nachmanson, L., Schulte, W., Tillmann, N., Veanes, M.: Towards a Tool Environment for Model-Based Testing with AsmL. In: Petrenko, A., Ulrich, A. (eds.) FATES 2003. LNCS, vol.\u00a02931, pp. 252\u2013266. Springer, Heidelberg (2004)"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-73770-4_7","volume-title":"Tests and Proofs","author":"L.(L.) Liu","year":"2007","unstructured":"Liu, L(L.), Meyer, B., Schoeller, B.: Using Contracts and Boolean Queries to Improve the Quality of Automatic Test Generation. In: Gurevich, Y., Meyer, B. (eds.) TAP 2007. LNCS, vol.\u00a04454, pp. 114\u2013130. Springer, Heidelberg (2007)"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Jalbert, N., Sen, K.: A trace simplification technique for effective debugging of concurrent programs. In: Proc. of FSE, pp. 57\u201366. ACM (2010)","DOI":"10.1145\/1882291.1882302"},{"key":"3_CR22","unstructured":"Jia, Y.: Milu (2012), \n                  \n                    http:\/\/www0.cs.ucl.ac.uk\/staff\/Y.Jia\/Milu\/"},{"key":"3_CR23","unstructured":"Holzleitner, J.: Using feedback to improve black box fuzz testing of SAT solvers. Master\u2019s thesis, Johannes Kepler University Linz (2009)"}],"container-title":["Lecture Notes in Computer Science","Tests and Proofs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38916-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T20:26:04Z","timestamp":1557779164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38916-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389153","9783642389160"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38916-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}