{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:32:03Z","timestamp":1775097123108,"version":"3.50.1"},"publisher-location":"Cham","reference-count":87,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319105741","type":"print"},{"value":"9783319105758","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-10575-8_12","type":"book-chapter","created":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T04:05:28Z","timestamp":1526616328000},"page":"345-383","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Compositional Reasoning"],"prefix":"10.1007","author":[{"given":"Dimitra","family":"Giannakopoulou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kedar S.","family":"Namjoshi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Corina S.","family":"P\u0103s\u0103reanu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,19]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/151646.151649","volume":"15","author":"M. Abadi","year":"1993","unstructured":"Abadi, M., Lamport, L.: Composing specifications. Trans. Program. Lang. Syst. 15(1), 73\u2013132 (1993)","journal-title":"Trans. Program. Lang. Syst."},{"key":"12_CR2","series-title":"LNCS","first-page":"499","volume-title":"Intl. Symp. on Mathematical Foundations of Computer Science (MFCS)","author":"M. Abadi","year":"1995","unstructured":"Abadi, M., Merz, S.: An abstract account of composition. In: Wiedermann, J., H\u00e1jek, P. (eds.) Intl. Symp. on Mathematical Foundations of Computer Science (MFCS). LNCS, vol.\u00a0969, pp.\u00a0499\u2013508. Springer, Heidelberg (1995)"},{"key":"12_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-642-35873-9_28","volume-title":"Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI)","author":"P.A. Abdulla","year":"2013","unstructured":"Abdulla, P.A., Haziza, F., Hol\u00edk, L.: All for the price of few. In: Giacobazzi, R., Berdine, J., Mastroeni, I. (eds.) Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI). LNCS, vol.\u00a07737, pp.\u00a0476\u2013495. Springer, Heidelberg (2013)"},{"key":"12_CR4","first-page":"109","volume-title":"Intl. Symp. on Foundations of Software Engineering (FSE)","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface automata. In: Intl. Symp. on Foundations of Software Engineering (FSE), pp.\u00a0109\u2013120. ACM, New York (2001)"},{"key":"12_CR5","first-page":"98","volume-title":"Symp. on Principles of Programming Languages (POPL)","author":"R. Alur","year":"2005","unstructured":"Alur, R., Cern\u00fd, P., Madhusudan, P., Nam, W.: Synthesis of interface specifications for Java classes. In: Palsberg, J., Abadi, M. (eds.) Symp. on Principles of Programming Languages (POPL), pp.\u00a098\u2013109. ACM, New York (2005)"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1008739929481","volume":"15","author":"R. Alur","year":"1999","unstructured":"Alur, R., Henzinger, T.A.: Reactive modules. Form. Methods Syst. Des. 15(1), 7\u201348 (1999)","journal-title":"Form. Methods Syst. Des."},{"issue":"5","key":"12_CR7","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R. Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5), 672\u2013713 (2002)","journal-title":"J. ACM"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/BFb0028774","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"R. Alur","year":"1998","unstructured":"Alur, R., Henzinger, T.A., Mang, F.Y.C., Qadeer, S., Rajamani, S.K., Tasiran, S.: Mocha: modularity in model checking. In: Hu, A.J., Vardi, M.Y. (eds.) Intl. Conf. on Computer-Aided Verification (CAV), pp.\u00a0521\u2013525 (1998)"},{"key":"12_CR9","series-title":"LNCS","first-page":"423","volume-title":"Intl. Conf. on Concurrency Theory (CONCUR)","author":"N. Amla","year":"2003","unstructured":"Amla, N., Emerson, E.A., Namjoshi, K.S., Trefler, R.J.: Abstract patterns of compositional reasoning. In: Amadio, R.M., Lugiez, D. (eds.) Intl. Conf. on Concurrency Theory (CONCUR). LNCS, vol.\u00a02761, pp.\u00a0423\u2013438. Springer, Heidelberg (2003)"},{"issue":"2","key":"12_CR10","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. 75(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"12_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-60045-0_57","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"A. Aziz","year":"1995","unstructured":"Aziz, A., Balarin, F., Brayton, R., DiBenedetto, M., Saldanha, A., Sangiovanni-Vincentelli, A.: Supervisory control of finite state machines. In: Wolper, P. (ed.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a0939, pp.\u00a0279\u2013292. Springer, Heidelberg (1995)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Beyer, D., Henzinger, T.A., Singh, V.: Algorithms for interface synthesis. In: Damm and Hermanns [77], pp.\u00a04\u201319","DOI":"10.1007\/978-3-540-73368-3_4"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-70545-1_14","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"M.G. Bobaru","year":"2008","unstructured":"Bobaru, M.G., Pasareanu, C.S., Giannakopoulou, D.: Automated assume-guarantee reasoning by abstraction refinement. In: Gupta, A., Malik, S. (eds.) Intl. Conf. on Computer-Aided Verification (CAV), vol.\u00a05123, pp.\u00a0135\u2013148. Springer, Heidelberg (2008)"},{"issue":"1\u20133","key":"12_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.tcs.2006.12.034","volume":"375","author":"S. Brookes","year":"2007","unstructured":"Brookes, S.: A semantics for concurrent separation logic. Theor. Comput. Sci. 375(1\u20133), 227\u2013270 (2007). doi:10.1016\/j.tcs.2006.12.034","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10703-007-0042-5","volume":"32","author":"S. Chaki","year":"2008","unstructured":"Chaki, S., Strichman, O.: Three optimizations for assume-guarantee reasoning with L*. Form. Methods Syst. Des. 32(3), 267\u2013284 (2008)","journal-title":"Form. Methods Syst. Des."},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-642-14295-6_44","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","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.) Intl. Conf. on Computer-Aided Verification (CAV), vol.\u00a06174, pp.\u00a0511\u2013526. Springer, Heidelberg (2010)"},{"key":"12_CR17","series-title":"LNCS","first-page":"31","volume-title":"Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":"Y.F. Chen","year":"2009","unstructured":"Chen, Y.F., Farzan, A., Clarke, E.M., Tsay, Y.K., Wang, B.Y.: Learning minimal separating DFAs for compositional verification. In: Kowalewski, S., Philippou, A. (eds.) Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol.\u00a05505, pp.\u00a031\u201345. Springer, Heidelberg (2009)"},{"issue":"4","key":"12_CR18","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1145\/222132.222149","volume":"20","author":"S.C. Cheung","year":"1995","unstructured":"Cheung, S.C., Kramer, J.: Compositional reachability analysis of finite-state distributed systems with user-specified constraints. SIGSOFT Softw. Eng. Notes 20(4), 140\u2013150 (1995)","journal-title":"SIGSOFT Softw. Eng. Notes"},{"issue":"12","key":"12_CR19","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1109\/43.552080","volume":"15","author":"H. Cho","year":"1996","unstructured":"Cho, H., Hachtel, G.D., Macii, E., Plessier, B., Somenzi, F.: Algorithms for approximate FSM traversal based on state space decomposition. Trans. Comput.-Aided Des. Integr. Circuits Syst. 15(12), 1465\u20131478 (1996)","journal-title":"Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"12_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/3-540-56922-7_37","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"E.M. Clarke","year":"1993","unstructured":"Clarke, E.M., Filkorn, T., Jha, S.: Exploiting symmetry in temporal logic model checking. In: Courcoubetis, C. (ed.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a0697, pp.\u00a0450\u2013462. Springer, Heidelberg (1993)"},{"key":"12_CR21","volume-title":"Handbook of Model Checking","author":"R. Cleaveland","year":"2018","unstructured":"Cleaveland, R., Roscoe, A., Smolka, S.A.: Process algebra and model checking. In: Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.) Handbook of Model Checking. Springer, Heidelberg (2018)"},{"key":"12_CR22","series-title":"LNCS","first-page":"331","volume-title":"Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","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.) Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol.\u00a02619, pp.\u00a0331\u2013346. Springer, Heidelberg (2003)"},{"issue":"2","key":"12_CR23","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s10703-008-0063-8","volume":"34","author":"Ariel Cohen","year":"2008","unstructured":"Cohen, A., Namjoshi, K.S.: Local proofs for global safety properties. In: Damm and Hermanns [83], pp.\u00a055\u201367. Full version in Formal Methods in System Design 34(2) (2009)","journal-title":"Formal Methods in System Design"},{"key":"12_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-540-70545-1_15","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"A. Cohen","year":"2008","unstructured":"Cohen, A., Namjoshi, K.S.: Local proofs for linear-time properties of concurrent programs. In: Gupta, A., Malik, S. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a05123, pp.\u00a0149\u2013161. Springer, Heidelberg (2008)"},{"key":"12_CR25","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-642-14295-6_46","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"A. Cohen","year":"2010","unstructured":"Cohen, A., Namjoshi, K.S., Sa\u2019ar, Y.: A dash of fairness for compositional reasoning. In: Touili, T., Cook, B., Jackson, P. (eds.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a06174, pp.\u00a0543\u2013557. Springer, Heidelberg (2010)"},{"key":"12_CR26","series-title":"LNCS","first-page":"46","volume-title":"Intl. Haifa Verification Conference (HVC)","author":"A. Cohen","year":"2010","unstructured":"Cohen, A., Namjoshi, K.S., Sa\u2019ar, Y., Zuck, L.D., Kisyova, K.I.: Parallelizing a symbolic compositional model-checking algorithm. In: Barner, S., Harris, I.G., Kroening, D., Raz, O. (eds.) Intl. Haifa Verification Conference (HVC). LNCS, vol.\u00a06504, pp.\u00a046\u201359. Springer, Heidelberg (2010)"},{"key":"12_CR27","first-page":"243","volume-title":"Automatic Program Construction Techniques","author":"P. Cousot","year":"1984","unstructured":"Cousot, P., Cousot, R.: Invariance proof methods and analysis techniques for parallel programs. In: Biermann, A., Guiho, G., Kodratoff, Y. (eds.) Automatic Program Construction Techniques, pp.\u00a0243\u2013271. Macmillan, New York (1984). Chap.\u00a012"},{"key":"12_CR28","series-title":"LNCS","volume-title":"Computer Aided Verification, Proceedings of the 19th International Conference, CAV 2007","year":"2007","unstructured":"Damm, W., Hermanns, H. (eds.): Computer Aided Verification, Proceedings of the 19th International Conference, CAV 2007, Berlin, Germany, July 3\u20137, 2007. LNCS, vol.\u00a04590. Springer, Heidelberg (2007)"},{"key":"12_CR29","volume-title":"Handbook of Model Checking","author":"D. Dams","year":"2018","unstructured":"Dams, D., Grumberg, O.: Abstraction and abstraction refinement. In: Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.) Handbook of Model Checking. Springer, Heidelberg (2018)"},{"key":"12_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-3228-5","volume-title":"Predicate Calculus and Program Semantics","author":"E. Dijkstra","year":"1990","unstructured":"Dijkstra, E., Scholten, C.: Predicate Calculus and Program Semantics. Springer, Heidelberg (1990)"},{"issue":"8","key":"12_CR31","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/360933.360975","volume":"18","author":"E.W. Dijkstra","year":"1975","unstructured":"Dijkstra, E.W.: Guarded commands, nondeterminacy and formal derivation of programs. Commun. ACM 18(8), 453\u2013457 (1975)","journal-title":"Commun. ACM"},{"key":"12_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/3-540-56922-7_38","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"E.A. Emerson","year":"1993","unstructured":"Emerson, E.A., Sistla, A.P.: Symmetry and model checking. In: Courcoubetis, C. (ed.) Intl. Conf. on Computer-Aided Verification (CAV). LNCS, vol.\u00a0697, pp.\u00a0463\u2013478. Springer, Heidelberg (1993)"},{"key":"12_CR33","series-title":"LNCS","first-page":"2","volume-title":"Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":"A. Farzan","year":"2008","unstructured":"Farzan, A., Chen, Y.F., Clarke, E.M., Tsay, Y.K., Wang, B.Y.: Extending automated compositional verification to the full class of omega-regular languages. In: Ramakrishnan, C.R., Rehof, J. (eds.) Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol.\u00a04963, pp.\u00a02\u201317. Springer, Heidelberg (2008)"},{"key":"12_CR34","first-page":"297","volume-title":"Symp. on Principles of Programming Languages (POPL)","author":"A. Farzan","year":"2012","unstructured":"Farzan, A., Kincaid, Z.: Verification of parameterized concurrent programs by modular reasoning about data and control. In: Field, J., Hicks, M. (eds.) Symp. on Principles of Programming Languages (POPL), pp.\u00a0297\u2013308. ACM, New York (2012)"},{"key":"12_CR35","first-page":"129","volume-title":"Symp. on Principles of Programming Languages (POPL)","author":"A. Farzan","year":"2013","unstructured":"Farzan, A., Kincaid, Z., Podelski, A.: Inductive data flow graphs. In: Giacobazzi, R., Cousot, R. (eds.) Symp. on Principles of Programming Languages (POPL), pp.\u00a0129\u2013142. ACM, New York (2013)"},{"key":"12_CR36","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-642-24372-1_40","volume-title":"Intl. Symp. Automated Technology for Verification and Analysis (ATVA)","author":"L. Feng","year":"2011","unstructured":"Feng, L., Han, T., Kwiatkowska, M.Z., Parker, D.: Learning-based compositional verification for synchronous probabilistic systems. In: Bultan, T., Hsiung, P. (eds.) Intl. Symp. Automated Technology for Verification and Analysis (ATVA). LNCS, vol.\u00a06996, pp.\u00a0511\u2013521. Springer, Heidelberg (2011)"},{"issue":"1\u20133","key":"12_CR37","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.tcs.2004.12.006","volume":"338","author":"C. Flanagan","year":"2005","unstructured":"Flanagan, C., Freund, S.N., Qadeer, S., Seshia, S.A.: Modular verification of multithreaded programs. Theor. Comput. Sci. 338(1\u20133), 153\u2013183 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR38","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44829-2_14","volume-title":"Intl. Symposium on Model Checking of Software (SPIN)","author":"C. Flanagan","year":"2003","unstructured":"Flanagan, C., Qadeer, S.: Thread-modular model checking. In: Ball, T., Rajamani, S.K. (eds.) Intl. Symposium on Model Checking of Software (SPIN). LNCS, vol.\u00a02648, pp.\u00a0213\u2013224. Springer, Heidelberg (2003)"},{"key":"12_CR39","series-title":"LNCS","first-page":"26","volume-title":"Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":"P. Garg","year":"2011","unstructured":"Garg, P., Madhusudan, P.: Compositionality entails sequentializability. In: Abdulla, P.A., Leino, K.R.M. (eds.) Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol.\u00a06605, pp.\u00a026\u201340. Springer, Heidelberg (2011)"},{"key":"12_CR40","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-00593-0_7","volume-title":"Intl. Conf. Fundamental Approaches to Software Engineering (FASE)","author":"D. Giannakopoulou","year":"2009","unstructured":"Giannakopoulou, D., Pasareanu, C.S.: Interface generation and compositional verification in JavaPathfinder. In: Chechik, M., Wirsing, M. (eds.) Intl. Conf. Fundamental Approaches to Software Engineering (FASE). LNCS, vol.\u00a05503, pp.\u00a094\u2013108. Springer, Heidelberg (2009)"},{"issue":"3","key":"12_CR41","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10515-005-2641-y","volume":"12","author":"D. Giannakopoulou","year":"2005","unstructured":"Giannakopoulou, D., Pasareanu, C.S., Barringer, H.: Component verification with automatically generated assumptions. Autom. Softw. Eng. 12(3), 297\u2013320 (2005)","journal-title":"Autom. Softw. Eng."},{"key":"12_CR42","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-33125-1_18","volume-title":"Intl. Symp. on Static Analysis (SAS)","author":"D. Giannakopoulou","year":"2012","unstructured":"Giannakopoulou, D., Rakamaric, Z., Raman, V.: Symbolic learning of component interfaces. In: Min\u00e9, A., Schmidt, D. (eds.) Intl. Symp. on Static Analysis (SAS). LNCS, vol.\u00a07460, pp.\u00a0248\u2013264. Springer, Heidelberg (2012)"},{"key":"12_CR43","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1090\/S0273-0979-06-01108-6","volume":"43","author":"M. Golubitsky","year":"2006","unstructured":"Golubitsky, M., Stewart, I.: Nonlinear dynamics of networks: the groupoid formalism. Bull. Am. Math. Soc. 43, 305\u2013364 (2006)","journal-title":"Bull. Am. Math. Soc."},{"key":"12_CR44","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/BFb0023732","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"S. Graf","year":"1990","unstructured":"Graf, S., Steffen, B.: Compositional minimization of finite state systems. In: Clarke, E.M., Kurshan, R.P. (eds.) Intl. Conf. on Computer-Aided Verification (CAV), vol.\u00a0531, pp.\u00a0186\u2013196. Springer, Heidelberg (1990)"},{"issue":"3","key":"12_CR45","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. Trans. Program. Lang. Syst. 16(3), 843\u2013871 (1994)","journal-title":"Trans. Program. Lang. Syst."},{"issue":"3","key":"12_CR46","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. 32(3), 285\u2013301 (2008)","journal-title":"Form. Methods Syst. Des."},{"key":"12_CR47","first-page":"331","volume-title":"Symp. on Principles of Programming Languages (POPL)","author":"A. Gupta","year":"2011","unstructured":"Gupta, A., Popeea, C., Rybalchenko, A.: Predicate abstraction and refinement for verifying multi-threaded programs. In: Ball, T., Sagiv, M. (eds.) Symp. on Principles of Programming Languages (POPL), pp.\u00a0331\u2013344. ACM, New York (2011)"},{"key":"12_CR48","first-page":"31","volume-title":"Intl. Symp. on Foundations of Software Engineering (FSE)","author":"T.A. Henzinger","year":"2005","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R.: Permissive interfaces. In: Wermelinger, M., Gall, H.C. (eds.) Intl. Symp. on Foundations of Software Engineering (FSE), pp.\u00a031\u201340. ACM, New York (2005)"},{"key":"12_CR49","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Liu, X., Qadeer, S., Rajamani, S.K.: Formal specification and verification of a dataflow processor array. In: White and Sentovich [53], pp.\u00a0494\u2013499","DOI":"10.1109\/ICCAD.1999.810700"},{"key":"12_CR50","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/BFb0028765","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"T.A. Henzinger","year":"1998","unstructured":"Henzinger, T.A., Qadeer, S., Rajamani, S.K.: You assume, we guarantee: methodology and case studies. In: Hu, A.J., Vardi, M.Y. (eds.) Intl. Conf. on Computer-Aided Verification (CAV), vol.\u00a01427, pp.\u00a0440\u2013451. Springer, Heidelberg (1998)"},{"key":"12_CR51","first-page":"245","volume-title":"International Conference on Computer Aided Design (ICCAD)","author":"T.A. Henzinger","year":"2000","unstructured":"Henzinger, T.A., Qadeer, S., Rajamani, S.K.: Decomposing refinement proofs using assume-guarantee reasoning. In: Sentovich, E. (ed.) International Conference on Computer Aided Design (ICCAD), pp.\u00a0245\u2013252. IEEE, Piscataway (2000)"},{"key":"12_CR52","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/3-540-49519-3_27","volume-title":"Formal Methods in Computer Aided Design (FMCAD)","author":"T.A. Henzinger","year":"1998","unstructured":"Henzinger, T.A., Qadeer, S., Rajamani, S.K., Tasiran, S.: An assume-guarantee rule for checking simulation. In: Gopalakrishnan, G., Windley, P.J. (eds.) Formal Methods in Computer Aided Design (FMCAD). LNCS, vol.\u00a01522, pp.\u00a0421\u2013432. Springer, Heidelberg (1998)"},{"issue":"10","key":"12_CR53","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580 (1969)","journal-title":"Commun. ACM"},{"key":"12_CR54","first-page":"268","volume-title":"Intl. Symp. on Software Testing and Analysis (ISSTA)","author":"F. Howar","year":"2013","unstructured":"Howar, F., Giannakopoulou, D., Rakamaric, Z.: Hybrid learning: interface generation through static, dynamic, and symbolic analysis. In: Intl. Symp. on Software Testing and Analysis (ISSTA), pp.\u00a0268\u2013279. ACM, New York (2013)"},{"issue":"3","key":"12_CR55","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1145\/352591.352593","volume":"9","author":"P. Inverardi","year":"2000","unstructured":"Inverardi, P., Wolf, A.L., Yankelevich, D.: Static checking of system behaviors using derived component assumptions. Trans. Softw. Eng. Methodol. 9(3), 239\u2013272 (2000)","journal-title":"Trans. Softw. Eng. Methodol."},{"key":"12_CR56","series-title":"IFIP Transactions","first-page":"97","volume-title":"CHDL","author":"C.N. Ip","year":"1993","unstructured":"Ip, C.N., Dill, D.L.: Better verification through symmetry. In: Agnew, D., Claesen, L.J.M., Camposano, R. (eds.) CHDL. IFIP Transactions, vol.\u00a0A-32, pp.\u00a097\u2013111. North-Holland, Amsterdam (1993)"},{"issue":"4","key":"12_CR57","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/69575.69577","volume":"5","author":"C.B. Jones","year":"1983","unstructured":"Jones, C.B.: Tentative steps toward a development method for interfering programs. Trans. Program. Lang. Syst. 5(4), 596\u2013619 (1983)","journal-title":"Trans. Program. Lang. Syst."},{"key":"12_CR58","first-page":"441","volume-title":"Symp. on Logic in Computer Science","author":"A. Komuravelli","year":"2012","unstructured":"Komuravelli, A., Pasareanu, C.S., Clarke, E.M.: Learning probabilistic systems from tree samples. In: Symp. on Logic in Computer Science, vol.\u00a0LICS, pp.\u00a0441\u2013450. IEEE, Piscataway (2012)"},{"key":"12_CR59","series-title":"Lecture Notes in Control and Information Sciences","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BFb0042302","volume-title":"Discrete Event Systems: Models and Applications","author":"R. Kurshan","year":"1988","unstructured":"Kurshan, R.: Reducibility in analysis of coordination. In: Varaiya, P., Kurzhanski, A. (eds.) Discrete Event Systems: Models and Applications. Lecture Notes in Control and Information Sciences, vol.\u00a0103, pp.\u00a019\u201339. Springer, Heidelberg (1988)"},{"issue":"2","key":"12_CR60","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/TSE.1977.229904","volume":"3","author":"L. Lamport","year":"1977","unstructured":"Lamport, L.: Proving the correctness of multiprocess programs. Trans. Softw. Eng. 3(2), 125\u2013143 (1977)","journal-title":"Trans. Softw. Eng."},{"key":"12_CR61","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-49213-5_15","volume-title":"Compositionality: The Significant Difference (COMPOS \u201997)","author":"L. Lamport","year":"1998","unstructured":"Lamport, L.: Composition: a way to make proofs harder. In: de Roever, W.P., Langmaack, H., Pnueli, A. (eds.) Compositionality: The Significant Difference (COMPOS \u201997). LNCS, vol.\u00a01536, pp.\u00a0402\u2013423. Springer, Heidelberg (1998)"},{"key":"12_CR62","first-page":"108","volume-title":"Symp. on Logic in Computer Science","author":"K. Larsen","year":"1990","unstructured":"Larsen, K., Xinxin, L.: Equation solving using modal transition systems. In: Symp. on Logic in Computer Science, vol.\u00a0LICS, pp.\u00a0108\u2013117. IEEE, Piscataway (1990)"},{"issue":"2","key":"12_CR63","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1109\/TSE.2013.57","volume":"40","author":"S.W. Lin","year":"2014","unstructured":"Lin, S.W., Andr\u00e9, \u00c9., Liu, Y., Sun, J., Dong, J.S.: Learning assumptions for compositional verification of timed systems. Trans. Softw. Eng. 40(2), 137\u2013153 (2014)","journal-title":"Trans. Softw. Eng."},{"key":"12_CR64","volume-title":"Concurrency: State Models & Java Programs","author":"J. Magee","year":"1999","unstructured":"Magee, J., Kramer, J.: Concurrency: State Models & Java Programs. Wiley, New York (1999)"},{"key":"12_CR65","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/3-540-36576-1_22","volume-title":"Intl. Conf. on Foundations of Software Science and Computational Structures (FoSSaCS)","author":"P. Maier","year":"2003","unstructured":"Maier, P.: Compositional circular assume-guarantee rules cannot be sound and complete. In: Gordon, A.D. (ed.) Intl. Conf. on Foundations of Software Science and Computational Structures (FoSSaCS). LNCS, vol.\u00a02620, pp.\u00a0343\u2013357. Springer, Heidelberg (2003)"},{"key":"12_CR66","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BFb0028738","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"K.L. McMillan","year":"1998","unstructured":"McMillan, K.L.: Verification of an implementation of Tomasulo\u2019s algorithm by compositional model checking. In: Hu, A.J., Vardi, M.Y. (eds.) Intl. Conf. on Computer-Aided Verification (CAV), vol.\u00a01427, pp.\u00a0110\u2013121. Springer, Heidelberg (1998)"},{"key":"12_CR67","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-48153-2_30","volume-title":"Correct Hardware Design and Verification Methods (CHARME)","author":"K.L. McMillan","year":"1999","unstructured":"McMillan, K.L.: Circular compositional reasoning about liveness. In: Pierre, L., Kropf, T. (eds.) Correct Hardware Design and Verification Methods (CHARME). LNCS, vol.\u00a01703, pp.\u00a0342\u2013345. Springer, Heidelberg (1999)"},{"issue":"1","key":"12_CR68","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/357195.357196","volume":"5","author":"P. Merlin","year":"1983","unstructured":"Merlin, P., Bochmann, G.V.: On the construction of submodule specifications and communication protocols. Trans. Program. Lang. Syst. 5(1), 1\u201325 (1983)","journal-title":"Trans. Program. Lang. Syst."},{"issue":"4","key":"12_CR69","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"7","author":"J. Misra","year":"1981","unstructured":"Misra, J., Chandy, K.M.: Proofs of networks of processes. Trans. Softw. Eng. 7(4), 417\u2013426 (1981)","journal-title":"Trans. Softw. Eng."},{"key":"12_CR70","unstructured":"Moon, I.H., Kukula, J.H., Shiple, T.R., Somenzi, F.: Least fixpoint approximations for reachability analysis. In: White and Sentovich [84], pp.\u00a041\u201344"},{"issue":"3","key":"12_CR71","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10703-008-0055-8","volume":"32","author":"W. Nam","year":"2008","unstructured":"Nam, W., Madhusudan, P., Alur, R.: Automatic symbolic compositional verification by learning assumptions. Form. Methods Syst. Des. 32(3), 207\u2013234 (2008)","journal-title":"Form. Methods Syst. Des."},{"key":"12_CR72","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-69738-1_22","volume-title":"Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI)","author":"K.S. Namjoshi","year":"2007","unstructured":"Namjoshi, K.S.: Symmetry and completeness in the analysis of parameterized systems. In: Cook, B., Podelski, A. (eds.) Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI). LNCS, vol.\u00a04349, pp.\u00a0299\u2013313 (2007)"},{"issue":"3","key":"12_CR73","first-page":"16:1","volume":"11","author":"K.S. Namjoshi","year":"2010","unstructured":"Namjoshi, K.S., Trefler, R.J.: On the completeness of compositional reasoning methods. Trans. Comput. Log. 11(3), 16:1\u201316:22 (2010)","journal-title":"Trans. Comput. Log."},{"key":"12_CR74","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-27940-9_23","volume-title":"Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI)","author":"K.S. Namjoshi","year":"2012","unstructured":"Namjoshi, K.S., Trefler, R.J.: Local symmetry and compositional verification. In: Kuncak, V., Rybalchenko, A. (eds.) Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI). LNCS, vol.\u00a07148, pp.\u00a0348\u2013362 (2012)"},{"key":"12_CR75","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-642-35873-9_29","volume-title":"Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI)","author":"K.S. Namjoshi","year":"2013","unstructured":"Namjoshi, K.S., Trefler, R.J.: Uncovering symmetries in irregular process networks. In: Giacobazzi, R., Berdine, J., Mastroeni, I. (eds.) Intl. Conf. on Verification, Model Checking and Abstract Interpretation (VMCAI). LNCS, vol.\u00a07737, pp.\u00a0496\u2013514 (2013)"},{"issue":"5","key":"12_CR76","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1145\/360051.360224","volume":"19","author":"S.S. Owicki","year":"1976","unstructured":"Owicki, S.S., Gries, D.: Verifying properties of parallel programs: an axiomatic approach. Commun. ACM 19(5), 279\u2013285 (1976)","journal-title":"Commun. ACM"},{"key":"12_CR77","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"issue":"3","key":"12_CR78","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10703-008-0049-6","volume":"32","author":"C.S. Pasareanu","year":"2008","unstructured":"Pasareanu, 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. 32(3), 175\u2013205 (2008)","journal-title":"Form. Methods Syst. Des."},{"key":"12_CR79","volume-title":"Handbook of Model Checking","author":"N. Piterman","year":"2018","unstructured":"Piterman, N., Pnueli, A.: Temporal logic and fair discrete systems. In: Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.) Handbook of Model Checking. Springer, Heidelberg (2018)"},{"key":"12_CR80","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. (ed.) Logics and Models of Concurrent Systems, pp.\u00a0123\u2013144. Springer, Heidelberg (1985)"},{"key":"12_CR81","series-title":"LNCS","first-page":"82","volume-title":"Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":"A. Pnueli","year":"2001","unstructured":"Pnueli, A., Ruah, S., Zuck, L.: Automatic deductive verification with invisible invariants. In: Margaria, T., Yi, W. (eds.) Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol.\u00a02031, pp.\u00a082\u201397. Springer, Heidelberg (2001)"},{"issue":"2","key":"12_CR82","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. 103(2), 299\u2013347 (1993)","journal-title":"Inf. Comput."},{"key":"12_CR83","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Concurrency Verification: Introduction to Compositional and Noncompositional Methods","author":"W.P. Roever de","year":"2001","unstructured":"de Roever, W.P., de Boer, F.S., Hannemann, U., Hooman, J., Lakhnech, Y., Poel, M., Zwiers, J.: Concurrency Verification: Introduction to Compositional and Noncompositional Methods. Cambridge Tracts in Theoretical Computer Science, vol.\u00a054. Cambridge University Press, Cambridge (2001)"},{"key":"12_CR84","unstructured":"Scott, D., Strachey, C.: Toward a mathematical semantics for computer languages. Tech. Rep. PRG-6, Oxford Programming Research Group (1971)"},{"key":"12_CR85","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-642-14295-6_45","volume-title":"Intl. Conf. on Computer-Aided Verification (CAV)","author":"R. Singh","year":"2010","unstructured":"Singh, R., Giannakopoulou, D., Pasareanu, C.S.: Learning component interfaces with may and must abstractions. In: Touili, T., Cook, B., Jackson, P. (eds.) Intl. Conf. on Computer-Aided Verification (CAV), vol.\u00a06174, pp.\u00a0527\u2013542. Springer, Heidelberg (2010)"},{"key":"12_CR86","volume-title":"Proceedings of the 1999 IEEE\/ACM International Conference on Computer-Aided Design, 1999","year":"1999","unstructured":"White, J.K., Sentovich, E. (eds.): Proceedings of the 1999 IEEE\/ACM International Conference on Computer-Aided Design, 1999, San Jose, California, USA, November 7\u201311, 1999. IEEE, Piscataway (1999)"},{"key":"12_CR87","first-page":"432","volume-title":"Intl. Conf. on Automated Software Engineering (ASE)","author":"H. Xiao","year":"2013","unstructured":"Xiao, H., Sun, J., Liu, Y., Lin, S.W., Sun, C.: Tzuyu: learning stateful typestates. In: Denney, E., Bultan, T., Zeller, A. (eds.) Intl. Conf. on Automated Software Engineering (ASE), pp.\u00a0432\u2013442. IEEE, Piscataway (2013)"}],"container-title":["Handbook of Model Checking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10575-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T04:12:10Z","timestamp":1526616730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10575-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319105741","9783319105758"],"references-count":87,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10575-8_12","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}