{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T20:17:19Z","timestamp":1784837839012,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642380877","type":"print"},{"value":"9783642380884","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38088-4_9","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T20:38:27Z","timestamp":1368045507000},"page":"124-138","source":"Crossref","is-referenced-by-count":20,"title":["Inferring Automata with State-Local Alphabet Abstractions"],"prefix":"10.1007","author":[{"given":"Malte","family":"Isberner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Falk","family":"Howar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/978-3-642-16558-0_54","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"F. Aarts","year":"2010","unstructured":"Aarts, F., Schmaltz, J., Vaandrager, F.: Inference and Abstraction of the Biometric Passport. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010, Part I. LNCS, vol.\u00a06415, pp. 673\u2013686. Springer, Heidelberg (2010)"},{"issue":"75","key":"9_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"2","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning Regular Sets from Queries and Counterexamples. Information and Computation\u00a02(75), 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-70545-1_14","volume-title":"Computer Aided Verification","author":"M. Gheorghiu Bobaru","year":"2008","unstructured":"Gheorghiu Bobaru, M., P\u0103s\u0103reanu, C.S., Giannakopoulou, D.: Automated Assume-Guarantee Reasoning by Abstraction Refinement. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 135\u2013148. Springer, Heidelberg (2008)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Model-Based Testing of Reactive Systems","year":"2005","unstructured":"Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.): Model-Based Testing of Reactive Systems. LNCS, vol.\u00a03472. Springer, Heidelberg (2005)"},{"issue":"5","key":"9_CR5","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1145\/876638.876643","volume":"50","author":"E. Clarke","year":"2003","unstructured":"Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided Abstraction Refinement for Symbolic Model Checking. J. ACM\u00a050(5), 752\u2013794 (2003)","journal-title":"J. ACM"},{"key":"9_CR6","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. Springer (1999)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-36577-X_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J.M. Cobleigh","year":"2003","unstructured":"Cobleigh, J.M., Giannakopoulou, D., P\u0103s\u0103reanu, C.S.: Learning Assumptions for Compositional Verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 331\u2013346. Springer, Heidelberg (2003)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-19835-9_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H. Garavel","year":"2011","unstructured":"Garavel, H., Lang, F., Mateescu, R., Serwe, W.: CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol.\u00a06605, pp. 372\u2013387. Springer, Heidelberg (2011)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-71209-1_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Gheorghiu","year":"2007","unstructured":"Gheorghiu, M., Giannakopoulou, D., P\u0103s\u0103reanu, C.S.: Refining Interface Alphabets for Compositional Verification. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 292\u2013307. Springer, Heidelberg (2007)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-33125-1_18","volume-title":"Static Analysis","author":"D. Giannakopoulou","year":"2012","unstructured":"Giannakopoulou, D., Rakamari\u0107, Z., Raman, V.: Symbolic Learning of Component Interfaces. In: Min\u00e9, A., Schmidt, D. (eds.) SAS 2012. LNCS, vol.\u00a07460, pp. 248\u2013264. Springer, Heidelberg (2012)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-45923-5_6","volume-title":"Fundamental Approaches to Software Engineering","author":"A. Hagerer","year":"2002","unstructured":"Hagerer, A., Hungar, H., Niese, O., Steffen, B.: Model Generation by Moderated Regular Extrapolation. In: Kutsche, R.-D., Weber, H. (eds.) FASE 2002. LNCS, vol.\u00a02306, pp. 80\u201395. Springer, Heidelberg (2002)"},{"key":"9_CR12","first-page":"1033","volume":"55","author":"A. Hagerer","year":"2001","unstructured":"Hagerer, A., Margaria, T., Niese, O., Steffen, B., Brune, G., Ide, H.-D.: Efficient Regression Testing of CTI-systems: Testing a Complex Call-center Solution. Annual Review of Comm., Int. Engineering Consortium (IEC)\u00a055, 1033\u20131040 (2001)","journal-title":"Annual Review of Comm., Int. Engineering Consortium (IEC)"},{"key":"9_CR13","first-page":"58","volume-title":"POPL 2002","author":"T.A. Henzinger","year":"2002","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: POPL 2002, pp. 58\u201370. ACM, New York (2002)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-27940-9_17","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"F. Howar","year":"2012","unstructured":"Howar, F., Steffen, B., Jonsson, B., Cassel, S.: Inferring Canonical Register Automata. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol.\u00a07148, pp. 251\u2013266. Springer, Heidelberg (2012)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/978-3-642-16558-0_55","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"F. Howar","year":"2010","unstructured":"Howar, F., Steffen, B., Merten, M.: From ZULU to RERS: Lessons learned in the ZULU challenge. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010, Part I. LNCS, vol.\u00a06415, pp. 687\u2013704. Springer, Heidelberg (2010)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-18275-4_19","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"F. Howar","year":"2011","unstructured":"Howar, F., Steffen, B., Merten, M.: Automata Learning with Automated Alphabet Abstraction Refinement. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol.\u00a06538, pp. 263\u2013277. Springer, Heidelberg (2011)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Issarny, V., Steffen, B., Jonsson, B., Blair, G.S., Grace, P., Kwiatkowska, M.Z., Calinescu, R., Inverardi, P., Tivoli, M., Bertolino, A., Sabetta, A.: CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems. In: ICECCS, pp. 154\u2013161 (2009)","DOI":"10.1109\/ICECCS.2009.44"},{"key":"9_CR18","unstructured":"Moller, F., Stevens, P.: Edinburgh Concurrency Workbench User Manual (Version 7.1), \n                    \n                      http:\/\/homepages.inf.ed.ac.uk\/perdita\/cwb\/"},{"issue":"4","key":"9_CR19","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A. Nerode","year":"1958","unstructured":"Nerode, A.: Linear Automaton Transformations. Proceedings of the American Mathematical Society\u00a09(4), 541\u2013544 (1958)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"9_CR20","first-page":"1","volume-title":"TAV-WEB 2008","author":"H. Raffelt","year":"2008","unstructured":"Raffelt, H., Margaria, T., Steffen, B., Merten, M.: Hybrid Test of Web Applications with Webtest. In: TAV-WEB 2008, pp. 1\u20137. ACM, New York (2008)"},{"issue":"5","key":"9_CR21","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10009-009-0111-8","volume":"11","author":"H. Raffelt","year":"2009","unstructured":"Raffelt, H., Steffen, B., Berg, T., Margaria, T.: LearnLib: A Framework for Extrapolating Behavioral Models. International Journal on Software Tools for Technology Transfer (STTT)\u00a011(5), 393\u2013407 (2009)","journal-title":"International Journal on Software Tools for Technology Transfer (STTT)"},{"issue":"2","key":"9_CR22","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/inco.1993.1021","volume":"103","author":"R.L. Rivest","year":"1993","unstructured":"Rivest, R.L., Schapire, R.E.: Inference of Finite Automata Using Homing Sequences. Inf. Comput.\u00a0103(2), 299\u2013347 (1993)","journal-title":"Inf. Comput."},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-05089-3_14","volume-title":"FM 2009: Formal Methods","author":"M. Shahbaz","year":"2009","unstructured":"Shahbaz, M., Groz, R.: Inferring Mealy Machines. In: Cavalcanti, A., Dams, D. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 207\u2013222. Springer, Heidelberg (2009)"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-21455-4_8","volume-title":"Formal Methods for Eternal Networked Software Systems","author":"B. Steffen","year":"2011","unstructured":"Steffen, B., Howar, F., Merten, M.: Introduction to Active Automata Learning from a Practical Perspective. In: Bernardo, M., Issarny, V. (eds.) SFM 2011. LNCS, vol.\u00a06659, pp. 256\u2013296. Springer, Heidelberg (2011)"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Steffen, B., Margaria, T., Raffelt, H., Niese, O.: Efficient test-based model generation of legacy systems. In: HLDVT 2004, Sonoma (CA), USA, pp. 95\u2013100. IEEE Computer Society Press (November 2004)","DOI":"10.1109\/HLDVT.2004.1431246"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38088-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T19:34:17Z","timestamp":1557689657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38088-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642380877","9783642380884"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38088-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}