{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:01:19Z","timestamp":1770278479401,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540373766","type":"print"},{"value":"9783540373773","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11817949_14","type":"book-chapter","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T19:59:29Z","timestamp":1154548769000},"page":"203-217","source":"Crossref","is-referenced-by-count":20,"title":["Minimization, Learning, and Conformance Testing of Boolean Programs"],"prefix":"10.1007","author":[{"given":"Viraj","family":"Kumar","sequence":"first","affiliation":[]},{"given":"P.","family":"Madhusudan","sequence":"additional","affiliation":[]},{"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1145\/1075382.1075387","volume":"27","author":"R. Alur","year":"2005","unstructured":"Alur, R., Benedikt, M., Etessami, K., Godefroid, P., Reps, T.W., Yannakakis, M.: Analysis of recursive state machines. TOPLAS\u00a027(4), 786\u2013818 (2005)","journal-title":"TOPLAS"},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/1040305.1040314","volume-title":"POPL","author":"R. Alur","year":"2005","unstructured":"Alur, R., Cern\u00fd, P., Madhusudan, P., Nam, W.: Synthesis of interface specifications for Java classes. In: POPL, pp. 98\u2013109. ACM Press, New York (2005)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-540-24730-2_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Alur","year":"2004","unstructured":"Alur, R., Etessami, K., Madhusudan, P.: A Temporal Logic of Nested Calls and Returns. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 467\u2013481. Springer, Heidelberg (2004)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1007\/11523468_89","volume-title":"Automata, Languages and Programming","author":"R. Alur","year":"2005","unstructured":"Alur, R., Kumar, V., Madhusudan, P., Viswanathan, M.: Congruences for visibly pushdown languages. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1102\u20131114. Springer, Heidelberg (2005)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/1007352.1007390","volume-title":"STOC","author":"R. Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC, pp. 202\u2013211. ACM Press, New York (2004)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11779148_1","volume-title":"Developments in Language Theory","author":"R. Alur","year":"2006","unstructured":"Alur, R., Madhusudan, P.: Adding Nesting Structure to Words. In: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 1\u201313. Springer, Heidelberg (2006)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/11513988_52","volume-title":"Computer Aided Verification","author":"R. Alur","year":"2005","unstructured":"Alur, R., Madhusudan, P., Nam, W.: Symbolic Compositional Verification by Learning Assumptions. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 548\u2013562. Springer, Heidelberg (2005)"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/565816.503275","volume":"37","author":"G. Ammons","year":"2002","unstructured":"Ammons, G., Bodik, R., Larus, J.R.: Mining specifications. SIGPLAN Not.\u00a037(1), 4\u201316 (2002)","journal-title":"SIGPLAN Not."},{"key":"14_CR9","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. Information and Computation\u00a075, 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/10722468_7","volume-title":"SPIN Model Checking and Software Verification","author":"T. Ball","year":"2000","unstructured":"Ball, T., Rajamani, S.: Bebop: A symbolic model checker for boolean programs. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN 2000. LNCS, vol.\u00a01885, pp. 113\u2013130. Springer, Heidelberg (2000)"},{"key":"14_CR11","first-page":"61","volume-title":"FOCS","author":"P. Berman","year":"1987","unstructured":"Berman, P., Roos, R.: Learning one\u2013counter languages in polynomial time. In: FOCS, pp. 61\u201367. IEEE, Los Alamitos (1987)"},{"key":"14_CR12","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":"14_CR13","volume-title":"Fault Detection in Digital Circuits","author":"A. Friedman","year":"1971","unstructured":"Friedman, A., Menon, P.: Fault Detection in Digital Circuits. PrenticeHall, Inc., Englewood Cliffs (1971)"},{"key":"14_CR14","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\u2013370. Springer, Heidelberg (2002)"},{"key":"14_CR15","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An introduction to computational learning theory","author":"M. Kearns","year":"1994","unstructured":"Kearns, M., Vazirani, U.: An introduction to computational learning theory. MIT Press, Cambridge (1994)"},{"key":"14_CR16","volume-title":"Switching and Finite Automata Theory","author":"Z. Kohavi","year":"1978","unstructured":"Kohavi, Z.: Switching and Finite Automata Theory. McGraw-Hill, New York (1978)"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Kumar, V., Madhusudan, P., Viswanathan, M.: Minimization, learning, and conformance testing of Boolean programs. Technical Report UIUCDCS-R-2006-2736, University of Illinois at Urbana-Champaign (June 2006)","DOI":"10.1007\/11817949_14"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines - A survey. Proceedings of the IEEE 84, 1090\u20131126 (1996)","DOI":"10.1109\/5.533956"},{"key":"14_CR19","volume-title":"Conformance testing methodologies and architectures for OSI protocols","author":"R. Linn","year":"1995","unstructured":"Linn, R., \u00dcyar, M.: Conformance testing methodologies and architectures for OSI protocols. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"14_CR20","first-page":"129","volume-title":"Automata Studies","author":"E.F. Moore","year":"1956","unstructured":"Moore, E.F.: Gedanken-experiments on sequential machines. In: Automata Studies, pp. 129\u2013153. Princeton University Press, Princeton (1956)"},{"issue":"2","key":"14_CR21","first-page":"225","volume":"7","author":"D. Peled","year":"2001","unstructured":"Peled, D., Vardi, M.Y., Yannakakis, M.: Black box checking. J. Autom. Lang. Comb.\u00a07(2), 225\u2013246 (2001)","journal-title":"J. Autom. Lang. Comb."},{"issue":"1","key":"14_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0890-5401(92)90003-X","volume":"97","author":"Y. Sakakibara","year":"1992","unstructured":"Sakakibara, Y.: Efficient learning of context-free grammars from positive structural examples. Inf. Comput.\u00a097(1), 23\u201360 (1992)","journal-title":"Inf. Comput."},{"key":"14_CR23","series-title":"IFIP Trans","first-page":"257","volume-title":"Protocol Test Systems","author":"J. Tretmans","year":"1994","unstructured":"Tretmans, J.: A formal approach to conformance testing. In: Protocol Test Systems. IFIP Trans, vol.\u00a0C-19, pp. 257\u2013276. North-Holland, Amsterdam (1994)"},{"issue":"11","key":"14_CR24","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. Valiant","year":"1984","unstructured":"Valiant, L.: A theory of the learnable. Comm. of the ACM\u00a027(11), 1134\u20131142 (1984)","journal-title":"Comm. of the ACM"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-540-30538-5_41","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"A. Vardhan","year":"2004","unstructured":"Vardhan, A., Sen, K., Viswanathan, M., Agha, G.: Actively Learning to Verify Safety for FIFO Automata. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.\u00a03328, pp. 494\u2013505. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2006 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11817949_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T11:25:40Z","timestamp":1683545140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11817949_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540373766","9783540373773"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11817949_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}