{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T09:10:02Z","timestamp":1748855402188,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662496732"},{"type":"electronic","value":"9783662496749"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","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":[[2016]]},"DOI":"10.1007\/978-3-662-49674-9_39","type":"book-chapter","created":{"date-parts":[[2016,4,8]],"date-time":"2016-04-08T18:49:00Z","timestamp":1460141340000},"page":"589-606","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Parameterized Compositional Model Checking"],"prefix":"10.1007","author":[{"given":"Kedar S.","family":"Namjoshi","sequence":"first","affiliation":[]},{"given":"Richard J.","family":"Trefler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,9]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS, pp. 313\u2013321. IEEE Computer Society (1996)","DOI":"10.1109\/LICS.1996.561359"},{"key":"39_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-642-35873-9_28","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"PA 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.) VMCAI 2013. LNCS, vol. 7737, pp. 476\u2013495. Springer, Heidelberg (2013)"},{"issue":"4","key":"39_CR3","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"SB Akers","year":"1989","unstructured":"Akers, S.B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38(4), 555\u2013566 (1989)","journal-title":"IEEE Trans. Comput."},{"key":"39_CR4","unstructured":"Alur, R., Henzinger, T.: Reactive modules. In: IEEE LICS (1996)"},{"issue":"6","key":"39_CR5","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0020-0190(86)90071-2","volume":"22","author":"KR Apt","year":"1986","unstructured":"Apt, K.R., Kozen, D.: Limits for automatic verification of finite-state concurrent systems. Inf. Process. Lett. 22(6), 307\u2013309 (1986)","journal-title":"Inf. Process. Lett."},{"issue":"1\/2","key":"39_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF00625969","volume":"9","author":"E Clarke","year":"1996","unstructured":"Clarke, E., Enders, R., Filkorn, T., Jha, S.: Exploiting symmetry in temporal logic model checking. Formal Methods Syst. Des. 9(1\/2), 77\u2013104 (1996)","journal-title":"Formal Methods Syst. Des."},{"key":"39_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/11609773_9","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"E Clarke","year":"2006","unstructured":"Clarke, E., Talupur, M., Veith, H.: Environment abstraction for parameterized verification. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 126\u2013141. Springer, Heidelberg (2006)"},{"key":"39_CR8","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, New York (1990)"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Emerson, E., Namjoshi, K.: Reasoning about rings. In: ACM Symposium on Principles of Programming Languages (1995)","DOI":"10.1145\/199448.199468"},{"issue":"1\/2","key":"39_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF00625970","volume":"9","author":"E Emerson","year":"1996","unstructured":"Emerson, E., Sistla, A.: Symmetry and model checking. Formal Methods in System Design 9(1\/2), 105\u2013131 (1996)","journal-title":"Formal Methods in System Design"},{"key":"39_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-39799-8_8","volume-title":"Computer Aided Verification","author":"J Esparza","year":"2013","unstructured":"Esparza, J., Ganty, P., Majumdar, R.: Parameterized verification of asynchronous shared-memory systems. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 124\u2013140. Springer, Heidelberg (2013)"},{"key":"39_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24622-0_19","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"Y Fang","year":"2004","unstructured":"Fang, Y., Piterman, N., Pnueli, A., Zuck, L.D.: Liveness with Invisible Ranking. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 223\u2013238. Springer, Heidelberg (2004)"},{"issue":"3","key":"39_CR13","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1145\/146637.146681","volume":"39","author":"S German","year":"1992","unstructured":"German, S., Sistla, A.: Reasoning about systems with many processes. J. ACM 39(3), 675\u2013735 (1992)","journal-title":"J. ACM"},{"key":"39_CR14","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. Amer. Math. Soc. 43, 305\u2013364 (2006)","journal-title":"Bull. Amer. Math. Soc."},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/2043174.2043194","volume":"54","author":"G Gopalakrishnan","year":"2011","unstructured":"Gopalakrishnan, G., Kriby, R.M., Siegel, S.F., Thakur, R., Gropp, W., Lusk, E., De Supinski, B.R., Schulz, M., Bronevetsky, G.: Formal analysis of MPI-based parallel programs. Commun. of the ACM 54, 82\u201391 (2011)","journal-title":"Commun. of the ACM"},{"key":"39_CR16","unstructured":"Hayes, J.P., Mudge, T.N., Stout, Q.F., Colley, S., Palmer, J.: Architecture of a hypercube supercomputer. In: Conference on Parallel Processing, pp. 653\u2013660 (1986)"},{"issue":"1","key":"39_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-10(1:12)2014","volume":"10","author":"S Jacobs","year":"2014","unstructured":"Jacobs, S., Bloem, R.: Parameterized synthesis. Logical Methods Comput. Sci. 10(1), 1\u201329 (2014)","journal-title":"Logical Methods Comput. Sci."},{"key":"39_CR18","volume-title":"Computer-Aided Verification of Coordinating Processes: TheAutomata-Theoretic Approach","author":"R Kurshan","year":"1994","unstructured":"Kurshan, R.: Computer-Aided Verification of Coordinating Processes: TheAutomata-Theoretic Approach. Princeton University Press, Princeton (1994)"},{"issue":"2","key":"39_CR19","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. IEEE Trans. Softw. Eng. 3(2), 125\u2013143 (1977)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"39_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4222-2","volume-title":"Temporal Verification of Reactive Systems: Safety","author":"Z Manna","year":"1995","unstructured":"Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, New York (1995)"},{"key":"39_CR21","volume-title":"Computation: finite and infinite machines","author":"M Minsky","year":"1967","unstructured":"Minsky, M.: Computation: finite and infinite machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"39_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-27940-9_23","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"KS Namjoshi","year":"2012","unstructured":"Namjoshi, K.S., Trefler, R.J.: Local symmetry and compositional verification. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol. 7148, pp. 348\u2013362. Springer, Heidelberg (2012)"},{"key":"39_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-642-35873-9_29","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"KS Namjoshi","year":"2013","unstructured":"Namjoshi, K.S., Trefler, R.J.: Uncovering symmetries in irregular process networks. In: Giacobazzi, R., Berdine, J., Mastroeni, I. (eds.) VMCAI 2013. LNCS, vol. 7737, pp. 496\u2013514. Springer, Heidelberg (2013)"},{"key":"39_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/978-3-662-46681-0_11","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"KS Namjoshi","year":"2015","unstructured":"Namjoshi, K.S., Trefler, R.J.: Analysis of dynamic process networks. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 164\u2013178. Springer, Heidelberg (2015)"},{"key":"39_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-319-19195-9_7","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"KS Namjoshi","year":"2015","unstructured":"Namjoshi, K.S., Trefler, R.J.: Loop freedom in AODVv2. In: Graf, S., Viswanathan, M. (eds.) Formal Techniques for Distributed Objects, Components, and Systems. LNCS, vol. 9039, pp. 98\u2013112. Springer, Heidelberg (2015)"},{"issue":"5","key":"39_CR26","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1145\/360051.360224","volume":"19","author":"SS 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":"39_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-45319-9_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Pnueli","year":"2001","unstructured":"Pnueli, A., Ruah, S., Zuck, L.D.: Automatic deductive verification with invisible invariants. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 82\u201397. Springer, Heidelberg (2001)"},{"issue":"5","key":"39_CR28","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"FP Preparata","year":"1981","unstructured":"Preparata, F.P., Vuillemin, J.: The cube-connected cycles: a versatile network for parallel computation. CACM 24(5), 300\u2013309 (1981)","journal-title":"CACM"},{"key":"39_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1007\/978-3-319-08867-9_41","volume-title":"Computer Aided Verification","author":"A S\u00e1nchez","year":"2014","unstructured":"S\u00e1nchez, A., S\u00e1nchez, C.: LEAP: a tool for the parametrized verification of concurrent datatypes. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 620\u2013627. Springer, Heidelberg (2014)"},{"issue":"6","key":"39_CR30","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s00236-015-0222-5","volume":"52","author":"A Sanchez","year":"2015","unstructured":"Sanchez, A., Sanchez, C.: Parametrized invariance for infinite state processes. Acta Informatica 52(6), 525\u2013557 (2015)","journal-title":"Acta Informatica"},{"key":"39_CR31","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/2465.2467","volume":"28","author":"CL Seitz","year":"1985","unstructured":"Seitz, C.L.: The cosmic cube. Commun. ACM 28, 22\u201333 (1985)","journal-title":"Commun. ACM"},{"key":"39_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-540-24732-6_20","volume-title":"Model Checking Software","author":"SF Siegel","year":"2004","unstructured":"Siegel, S.F., Avrunin, G.S.: Verification of MPI-based software for scientific computation. In: Graf, S., Mounier, L. (eds.) SPIN 2004. LNCS, vol. 2989, pp. 286\u2013303. Springer, Heidelberg (2004)"},{"key":"39_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-18275-4_2","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"SF Siegel","year":"2011","unstructured":"Siegel, S.F., Gopalakrishnan, G.: Formal analysis of message passing. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 2\u201318. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49674-9_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T08:28:06Z","timestamp":1748852886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49674-9_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496732","9783662496749"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49674-9_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}