{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:15:53Z","timestamp":1725898553976},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642358609"},{"type":"electronic","value":"9783642358616"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35861-6_16","type":"book-chapter","created":{"date-parts":[[2013,1,11]],"date-time":"2013-01-11T03:44:50Z","timestamp":1357875890000},"page":"260-276","source":"Crossref","is-referenced-by-count":0,"title":["Assumption Generation for Asynchronous Systems by Abstraction Refinement"],"prefix":"10.1007","author":[{"given":"Qiusong","family":"Yang","sequence":"first","affiliation":[]},{"given":"Edmund M.","family":"Clarke","sequence":"additional","affiliation":[]},{"given":"Anvesh","family":"Komuravelli","sequence":"additional","affiliation":[]},{"given":"Mingshu","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-82453-1_5","volume-title":"Logics and Models of Concurrent Systems","author":"A. Pnueli","year":"1985","unstructured":"Pnueli, A.: In transition from global to modular temporal reasoning about programs. In: Apt, K.R. (ed.) Logics and Models of Concurrent Systems, pp. 123\u2013144. Springer-Verlag New York, Inc., New York (1985)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/177492.177725","volume":"16","author":"O. Grumberg","year":"1994","unstructured":"Grumberg, O., Long, D.E.: Model checking and modular verification. ACM Trans. Program. Lang. Syst.\u00a016, 843\u2013871 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"16_CR3","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":"16_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/ASE.2002.1114984","volume-title":"Proceedings of the 17th IEEE International Conference on Automated Software Engineering, ASE 2002","author":"D. Giannakopoulou","year":"2002","unstructured":"Giannakopoulou, D., P\u0103s\u0103reanu, C.S., Barringer, H.: Assumption generation for software component verification. In: Proceedings of the 17th IEEE International Conference on Automated Software Engineering, ASE 2002, p. 3. IEEE Computer Society, Washington, DC (2002)"},{"issue":"2","key":"16_CR5","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. Inf. Comput.\u00a075(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"16_CR6","unstructured":"Barringer, H., Giannakopoulou, D.: Proof rules for automated compositional verification through learning. In: Proc. SAVCBS Workshop, pp. 14\u201321 (2003)"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/ASE.2002.1114984","volume-title":"Proceedings of the 17th IEEE International Conference on Automated Software Engineering, ASE 2002","author":"D. Giannakopoulou","year":"2002","unstructured":"Giannakopoulou, D., P\u0103s\u0103reanu, C.S., Barringer, H.: Assumption generation for software component verification. In: Proceedings of the 17th IEEE International Conference on Automated Software Engineering, ASE 2002, pp. 3\u201312. IEEE Computer Society, Washington, DC (2002)"},{"key":"16_CR8","unstructured":"Bobaru, M.G., P\u0103s\u0103reanu, C.S., Giannakopoulou, D.: Automated assume-guarantee reasoning by abstraction refinement. In: [31], pp. 135\u2013148"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10703-008-0049-6","volume":"32","author":"C.S. P\u0103s\u0103reanu","year":"2008","unstructured":"P\u0103s\u0103reanu, C.S., Giannakopoulou, D., Bobaru, M.G., Cobleigh, J.M., Barringer, H.: Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning. Form. Methods Syst. Des.\u00a032, 175\u2013205 (2008)","journal-title":"Form. Methods Syst. Des."},{"issue":"2","key":"16_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1348250.1348253","volume":"17","author":"J.M. Cobleigh","year":"2008","unstructured":"Cobleigh, J.M., Avrunin, G.S., Clarke, L.A.: Breaking up is hard to do: An evaluation of automated assume-guarantee reasoning. ACM Trans. Softw. Eng. Methodol. 17(2), 7:1\u20137:52 (2008)","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-642-14295-6_44","volume-title":"Computer Aided Verification","author":"Y.F. Chen","year":"2010","unstructured":"Chen, Y.F., Clarke, E.M., Farzan, A., Tsai, M.H., Tsay, Y.K., Wang, B.Y.: Automated Assume-Guarantee Reasoning through Implicit Learning. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol.\u00a06174, pp. 511\u2013526. Springer, Heidelberg (2010)"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1006\/inco.1995.1164","volume":"123","author":"N.H. Bshouty","year":"1995","unstructured":"Bshouty, N.H.: Exact learning boolean functions via the monotone theory. Inf. Comput.\u00a0123, 146\u2013153 (1995)","journal-title":"Inf. Comput."},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s11334-011-0148-1","volume":"7","author":"S. Chaki","year":"2011","unstructured":"Chaki, S., Gurfinkel, A.: Automated assume-guarantee reasoning for omega-regular systems and specifications. Innov. Syst. Softw. Eng.\u00a07, 131\u2013139 (2011)","journal-title":"Innov. Syst. Softw. Eng."},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-540-71209-1_22","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Chaki","year":"2007","unstructured":"Chaki, S., Strichman, O.: Optimized L*-Based Assume-Guarantee Reasoning. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 276\u2013291. Springer, Heidelberg (2007)"},{"key":"16_CR15","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":"16_CR16","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)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-73368-3_8","volume-title":"Computer Aided Verification","author":"N. Sinha","year":"2007","unstructured":"Sinha, N., Clarke, E.: SAT-based compositional verification using lazy learning. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 39\u201354. Springer, Heidelberg (2007)"},{"issue":"3","key":"16_CR18","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10703-008-0050-0","volume":"32","author":"A. Gupta","year":"2008","unstructured":"Gupta, A., Mcmillan, K.L., Fu, Z.: Automated assumption generation for compositional verification. Form. Methods Syst. Des.\u00a032(3), 285\u2013301 (2008)","journal-title":"Form. Methods Syst. Des."},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-00768-2_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y.-F. Chen","year":"2009","unstructured":"Chen, Y.-F., Farzan, A., Clarke, E.M., Tsay, Y.-K., Wang, B.-Y.: Learning Minimal Separating DFA\u2019s for Compositional Verification. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol.\u00a05505, pp. 31\u201345. Springer, Heidelberg (2009)"},{"issue":"5","key":"16_CR20","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1145\/876638.876643","volume":"50","author":"E.M. Clarke","year":"2003","unstructured":"Clarke, E.M., 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":"16_CR21","unstructured":"Bobaru, M.G., Pasareanu, C.S., Giannakopoulou, D.: Automated assume-guarantee reasoning by abstraction refinement. In: [31], pp. 135\u2013148"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-31424-7_25","volume-title":"Computer Aided Verification","author":"A. Komuravelli","year":"2012","unstructured":"Komuravelli, A., P\u0103s\u0103reanu, C.S., Clarke, E.M.: Assume-Guarantee Abstraction Refinement for Probabilistic Systems. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol.\u00a07358, pp. 310\u2013326. Springer, Heidelberg (2012)"},{"key":"16_CR23","unstructured":"MathSAT, \n                  \n                    http:\/\/mathsat.fbk.eu\/"},{"key":"16_CR24","unstructured":"iZ3, \n                  \n                    http:\/\/research.microsoft.com\/en-us\/um\/redmond\/projects\/z3\/iz3.html"},{"issue":"3","key":"16_CR25","doi-asserted-by":"publisher","first-page":"708","DOI":"10.2307\/2275569","volume":"62","author":"M.L. Bonet","year":"1997","unstructured":"Bonet, M.L., Pitassi, T., Raz, R.: Lower bounds for cutting planes proofs with small coefficients. J. Symb. Log.\u00a062(3), 708\u2013728 (1997)","journal-title":"J. Symb. Log."},{"key":"16_CR26","unstructured":"Milner, R.: An algebraic definition of simulation between programs. Technical report, Stanford, CA, USA (1971)"},{"key":"16_CR27","volume-title":"Model checking","author":"E.M. Clarke Jr.","year":"1999","unstructured":"Clarke Jr., E.M., Grumberg, O., Peled, D.A.: Model checking. MIT Press, Cambridge (1999)"},{"key":"16_CR28","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":"16_CR29","unstructured":"NuSMV, \n                  \n                    http:\/\/nusmv.fbk.eu\/"},{"key":"16_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45069-6_1","volume-title":"Computer Aided Verification","author":"K.L. McMillan","year":"2003","unstructured":"McMillan, K.L.: Interpolation and SAT-Based Model Checking. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 1\u201313. Springer, Heidelberg (2003)"},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","year":"2008","unstructured":"Gupta, A., Malik, S. (eds.): CAV 2008. LNCS, vol.\u00a05123. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Formal Aspects of Component Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35861-6_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:32:04Z","timestamp":1620135124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35861-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642358609","9783642358616"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35861-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}