{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T12:54:34Z","timestamp":1725627274833},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642245794"},{"type":"electronic","value":"9783642245800"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24580-0_8","type":"book-chapter","created":{"date-parts":[[2011,11,2]],"date-time":"2011-11-02T10:21:42Z","timestamp":1320229302000},"page":"97-114","source":"Crossref","is-referenced-by-count":8,"title":["Learning-Based Testing for Reactive Systems Using Term Rewriting Technology"],"prefix":"10.1007","author":[{"given":"Karl","family":"Meinke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Niu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","first-page":"447","volume-title":"Handbook of Automated Reasoning","author":"F. Baader","year":"2001","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Handbook of Automated Reasoning, pp. 447\u2013531. Elsevier, Amsterdam (2001)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36126-X_3","volume-title":"Formal Methods in Computer-Aided Design","author":"P. Chauhan","year":"2002","unstructured":"Chauhan, P., Clarke, E.M., Kukula, J.H., Sapra, S., Veith, H., Wang, D.: Automated abstraction refinement for model checking large state spaces using sat based conflict analysis. In: Aagaard, M.D., O\u2019Leary, J.W. (eds.) FMCAD 2002. LNCS, vol.\u00a02517. Springer, Heidelberg (2002)"},{"key":"8_CR3","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. Clarke","year":"2002","unstructured":"Clarke, E., Gupta, A., Kukula, J., Strichman, O.: Sat-based abstraction refinement using ilp and machine learning. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, p. 265. Springer, Heidelberg (2002)"},{"key":"8_CR4","first-page":"322","volume-title":"Computational Logic: Essays in Honor of Alan Robinson","author":"H. Comon","year":"1991","unstructured":"Comon, H.: Disunification: a survey. In: Computational Logic: Essays in Honor of Alan Robinson, pp. 322\u2013359. MIT Press, Cambridge (1991)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"de Moura, L., Bjorner, N.: An efficient smt solver. In: Tools and Algorithms for the Construction and Analysis of Systems, TACAS (2008)","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-73449-9_13","volume-title":"Term Rewriting and Applications","author":"S. Escobar","year":"2007","unstructured":"Escobar, S., Bevilacqua, V.: Symbolic model checking of infinite-state systems using narrowing. In: Baader, F. (ed.) RTA 2007. LNCS, vol.\u00a04533, pp. 153\u2013168. Springer, Heidelberg (2007)"},{"key":"8_CR7","series-title":"ENTCS","volume-title":"Proc. WRLA 2008","author":"S. Escobar","year":"2009","unstructured":"Escobar, S., Meseguer, J., Sasse, R.: Variant narrowing and equational unification. In: Proc. WRLA 2008. ENTCS, vol.\u00a0238(3), Springer, Heidelberg (2009)"},{"key":"8_CR8","unstructured":"Fraser, G., Wotawa, F., Ammann, P.E.: Testing with model checkers: A survey. Tech. rep. 2007-p2-04, TU Graz (2007)"},{"issue":"5","key":"8_CR9","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1093\/jigpal\/jzl007","volume":"14","author":"A. Groce","year":"2006","unstructured":"Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. Logic Journal of the IGPL\u00a014(5), 729\u2013744 (2006)","journal-title":"Logic Journal of the IGPL"},{"issue":"4","key":"8_CR10","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/65.598458","volume":"11","author":"B. Guha","year":"2007","unstructured":"Guha, B., Mukherjee, B.: Network security via reverse engineering of tcp code: vulnerability analysis and proposed solutions. IEEE Network\u00a011(4), 40\u201349 (2007)","journal-title":"IEEE Network"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","first-page":"122","volume-title":"5th Conference on Automated Deduction","author":"J.M. Hullot","year":"1980","unstructured":"Hullot, J.M.: Canonical forms and unification. In: Bibel, W. (ed.) CADE 1980. LNCS, vol.\u00a087, pp. 122\u2013128. Springer, Heidelberg (1980)"},{"key":"8_CR12","first-page":"122","volume":"79","author":"N. Markey","year":"2003","unstructured":"Markey, N.: Temporal logic with past is exponentially more succinct. EATCS Bulletin\u00a079, 122\u2013128 (2003)","journal-title":"EATCS Bulletin"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/1007512.1007532","volume-title":"ISSTA 2004: Proceedings of the 2004 ACM SIGSOFT International Symposium on Software Testing and Analysis","author":"K. Meinke","year":"2004","unstructured":"Meinke, K.: Automated black-box testing of functional correctness using function approximation. In: ISSTA 2004: Proceedings of the 2004 ACM SIGSOFT International Symposium on Software Testing and Analysis, pp. 143\u2013153. ACM, New York (2004)"},{"key":"8_CR14","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-15488-1_13","volume-title":"Grammatical Inference: Theoretical Results and Applications","author":"K. Meinke","year":"2010","unstructured":"Meinke, K.: Cge: A sequential learning algorithm for mealy automata. In: Sempere, J.M., Garc\u00eda, P. (eds.) ICGI 2010. LNCS (LNAI), vol.\u00a06339, pp. 148\u2013162. Springer, Heidelberg (2010)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-16573-3_16","volume-title":"Testing Software and Systems","author":"K. Meinke","year":"2010","unstructured":"Meinke, K., Niu, F.: A learning-based approach to unit testing of numerical software. In: Petrenko, A., Sim\u00e3o, A., Maldonado, J.C. (eds.) ICTSS 2010. LNCS, vol.\u00a06435, pp. 221\u2013235. Springer, Heidelberg (2010)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-21768-5_11","volume-title":"Tests and Proofs","author":"K. Meinke","year":"2011","unstructured":"Meinke, K., Sindhu, M.: Incremental learning-based testing for reactive systems. In: Gogolla, M., Wolff, B. (eds.) TAP 2011. LNCS, vol.\u00a06706, pp. 134\u2013151. Springer, Heidelberg (2011)"},{"key":"8_CR17","first-page":"189","volume-title":"Handbook of Logic in Computer Science","author":"K. Meinke","year":"1993","unstructured":"Meinke, K., Tucker, J.V.: Universal algebra. In: Handbook of Logic in Computer Science, vol.\u00a01, pp. 189\u2013411. Oxford University Press, Oxford (1993)"},{"issue":"3-4","key":"8_CR18","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BF01190830","volume":"5","author":"A. Middeldorp","year":"1994","unstructured":"Middeldorp, A., Hamoen, E.: Completeness results for basic narrowing. Applicable Algebra in Engineering, Communication and Computing\u00a05(3-4), 213\u2013253 (1994)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"8_CR19","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/978-0-387-35578-8_13","volume-title":"Formal Methods for Protocol Engineering and Distributed Systems FORTE\/PSTV","author":"D. Peled","year":"1999","unstructured":"Peled, D., Vardi, M.Y., Yannakakis, M.: Black-box checking. In: Formal Methods for Protocol Engineering and Distributed Systems FORTE\/PSTV, pp. 225\u2013240. Kluwer, Dordrecht (1999)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-77966-7_13","volume-title":"Hardware and Software: Verification and Testing","author":"H. Raffelt","year":"2008","unstructured":"Raffelt, H., Steffen, B., Margaria, T.: Dynamic testing via automata learning. In: Yorav, K. (ed.) HVC 2007. LNCS, vol.\u00a04899, pp. 136\u2013152. Springer, Heidelberg (2008)"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-16573-3_10","volume-title":"Testing Software and Systems","author":"N. Walkinshaw","year":"2010","unstructured":"Walkinshaw, N., Bogdanov, K., Derrick, J., Paris, J.: Increasing functional coverage by inductive testing: a case study. In: Petrenko, A., Sim\u00e3o, A., Maldonado, J.C. (eds.) ICTSS 2010. LNCS, vol.\u00a06435, pp. 126\u2013141. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Testing Software and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24580-0_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T11:33:00Z","timestamp":1620041580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24580-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642245794","9783642245800"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24580-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}