{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T12:05:32Z","timestamp":1774440332485,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540238416","type":"print"},{"value":"9783540304821","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30482-1_26","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:27:38Z","timestamp":1267460858000},"page":"274-289","source":"Crossref","is-referenced-by-count":19,"title":["Learning to Verify Safety Properties"],"prefix":"10.1007","author":[{"given":"Abhay","family":"Vardhan","sequence":"first","affiliation":[]},{"given":"Koushik","family":"Sen","sequence":"additional","affiliation":[]},{"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[]},{"given":"Gul","family":"Agha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/10722167_31","volume-title":"Computer Aided Verification","author":"A. Bouajjani","year":"2000","unstructured":"Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 403\u2013418. Springer, Heidelberg (2000)"},{"key":"26_CR2","series-title":"Series in Machine Perception and Artificial Intelligence","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1142\/9789812797902_0004","volume-title":"Pattern Recognition and Image Analysis","author":"J. Oncina","year":"1992","unstructured":"Oncina, J., Garcia, P.: Inferring regular languages in polynomial update time. In: Pattern Recognition and Image Analysis. Series in Machine Perception and Artificial Intelligence, vol.\u00a01, pp. 49\u201361. World Scientific, Singapore (1992)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/BFb0033357","volume-title":"Grammatical Inference: Learning Syntax from Sentences","author":"P. Dupont","year":"1996","unstructured":"Dupont, P.: Incremental regular inference. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS, vol.\u00a01147, pp. 222\u2013237. Springer, Heidelberg (1996)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Vardhan, A., Sen, K., Viswanathan, M., Agha, G.: Learning to verify safety properties, Tech. Rep. UIUCDCS-R-2004-2445 University of Illinois (2004), http:\/\/osl.cs.uiuc.edu\/docs\/sub2004vardhan\/cfsmLearn.pdf","DOI":"10.1007\/978-3-540-30482-1_26"},{"key":"26_CR5","volume-title":"Introduction to Automata Theory, Languages and Computability","author":"J.E. Hopcroft","year":"2000","unstructured":"Hopcroft, J.E., Motwani, R., Rotwani, Ullman, J.D.: Introduction to Automata Theory, Languages and Computability. Addison-Wesley Longman Publishing Co. Inc., Amsterdam (2000)"},{"key":"26_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free-Languages","author":"J. Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and Context-Free-Languages. B.G. Teubner, Stuttgart (1979)"},{"issue":"2","key":"26_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inform. Comput.\u00a075(2), 87\u2013106 (1987)","journal-title":"Inform. Comput."},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language indentification in the limit. Inform. Control\u00a010, 447\u2013474 (1967)","journal-title":"Inform. Control"},{"issue":"1","key":"26_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0890-5401(02)00027-5","volume":"181","author":"A. Finkel","year":"2003","unstructured":"Finkel, A., Purushothaman Iyer, S., Sutre, G.: Well-abstracted transition systems: Application to FIFO automata. Information and Computation\u00a0181(1), 1\u201331 (2003)","journal-title":"Information and Computation"},{"key":"26_CR10","unstructured":"LEVER, Learning to verify tool (2004), http:\/\/osl.cs.uiuc.edu\/vardhan\/lever.html"},{"key":"26_CR11","unstructured":"M\u00f8ller, A.: http:\/\/www.brics.dk\/~amoeller\/automaton\/ (2004)"},{"key":"26_CR12","volume-title":"Computer Networks","author":"A.S. Tanenbaum","year":"1989","unstructured":"Tanenbaum, A.S.: Computer Networks, 2nd edn. Prentice-Hall, Englewood Cliffs (1989)","edition":"2"},{"key":"26_CR13","unstructured":"Nilsson, M.: http:\/\/www.regulalrmodelchecking.com (2004)"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-540-45069-6_25","volume-title":"Computer Aided Verification","author":"P.A. Abdulla","year":"2003","unstructured":"Abdulla, P.A., Jonsson, B., Nilsson, M., d\u2019Orso, J.: Algorithmic improvements in regular model checking. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 236\u2013248. Springer, Heidelberg (2003)"},{"key":"26_CR15","unstructured":"Boigelot, B.: Symbolic Methods for Exploring Infinite State Spaces, Ph.D. thesis, Collection des Publications de la Facult\u00e9 des Sciences Appliqu\u00e9es de l\u2019Universit\u00e9 de Li\u00e9ge (1999)"},{"issue":"1\u20132","key":"26_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(99)00033-X","volume":"221","author":"A. Bouajjani","year":"1999","unstructured":"Bouajjani, A., Habermehl, P.: Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations. Theoretical Computer Science\u00a0221(1\u20132), 211\u2013250 (1999)","journal-title":"Theoretical Computer Science"},{"key":"26_CR17","volume-title":"ENTCS","author":"T. Touili","year":"2001","unstructured":"Touili, T.: Regular model checking using widening techniques. In: ENTCS, vol.\u00a050, Elsevier, Amsterdam (2001)"},{"key":"26_CR18","unstructured":"Bultan, T.: Automated symbolic analysis of reactive systems, Ph.D. thesis, Dept. of Computer Science, University of Maryland, College Park, Md. (1998)"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Bartzis, C., Bultan, T.: Widening arithmetic automata. In: Computer Aided Verification 2004 (to appear, 2004)","DOI":"10.1007\/978-3-540-27813-9_25"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Peled, D., Vardi, M.Y., Yannakakis, M.: Black box checking. In: FORTE\/PSTV, Beijing, China (1999)","DOI":"10.1007\/978-0-387-35578-8_13"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-46002-0_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Groce","year":"2002","unstructured":"Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, pp. 357\u2013371. Springer, Heidelberg (2002)"},{"key":"26_CR22","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., Pasareanu, 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":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BFb0035397","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B. Boigelot","year":"1997","unstructured":"Boigelot, B., Godefroid, P.: Automatic synthesis of specifications from the dynamic observation of reactive programs. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol.\u00a01217, pp. 321\u2013334. Springer, Heidelberg (1997)"},{"issue":"1","key":"26_CR24","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/565816.503275","volume":"37","author":"G. Ammons","year":"2002","unstructured":"Ammons, G., Bod\u00edk, R., Larus, J.R.: Mining specifications. ACM SIGPLAN Notices\u00a037(1), 4\u201316 (2002)","journal-title":"ACM SIGPLAN Notices"},{"key":"26_CR25","unstructured":"Edelkamp, S., Lafuente, A., Leue, S.: Protocol verification with heuristic search. In: AAAI Symposium on Model-based Validation of Intelligence (2001)"},{"key":"26_CR26","doi-asserted-by":"crossref","unstructured":"Ernst, M.D., Cockrell, J., Griswold, W.G., Notkin, D.: Dynamically discovering likely program invariants to support program evolution. In: International Conference on Software Engineering (ICSE 1999), pp. 213\u2013224 (1999)","DOI":"10.1145\/302405.302467"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30482-1_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T17:39:46Z","timestamp":1685468386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30482-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540238416","9783540304821"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30482-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}