{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:28Z","timestamp":1750306708426,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T00:00:00Z","timestamp":1405900800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,21]]},"DOI":"10.1145\/2632362.2632366","type":"proceedings-article","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T12:10:42Z","timestamp":1405080642000},"page":"11-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Local state space construction for compositional verification of concurrent systems"],"prefix":"10.1145","author":[{"given":"Hao","family":"Zheng","sequence":"first","affiliation":[{"name":"University of South Florida, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,7,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_52"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_14"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_51"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/235321.235323"},{"key":"e_1_3_2_1_5_1","first-page":"346","volume-title":"Proc. Int. Conf. on Tools and Algorithms for Construction and Analysis of Systems (TACAS)","volume":"2619","author":"Cobleigh J.","unstructured":"J. Cobleigh , D. Giannakopoulou , and C. Pasareanu . Learning assumptions for compositional verification . In Proc. Int. Conf. on Tools and Algorithms for Construction and Analysis of Systems (TACAS) , volume 2619 of LNCS, pages 331\u2013 346 . Springer-Verlag, 2003. J. Cobleigh, D. Giannakopoulou, and C. Pasareanu. Learning assumptions for compositional verification. In Proc. Int. Conf. on Tools and Algorithms for Construction and Analysis of Systems (TACAS), volume 2619 of LNCS, pages 331\u2013346. Springer-Verlag, 2003."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1770351.1770363"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-008-0049-6"},{"key":"e_1_3_2_1_8_1","first-page":"224","volume-title":"Proceedings of the 10th International Conference on Model Checking Software, SPIN\u201903","author":"Flanagan C.","unstructured":"C. Flanagan and S. Qadeer . Thread-modular model checking . In Proceedings of the 10th International Conference on Model Checking Software, SPIN\u201903 , pages 213\u2013 224 . Springer-Verlag, 2003. C. Flanagan and S. Qadeer. Thread-modular model checking. In Proceedings of the 10th International Conference on Model Checking Software, SPIN\u201903, pages 213\u2013224. Springer-Verlag, 2003."},{"key":"e_1_3_2_1_9_1","first-page":"12","volume-title":"Proceedings of ASE\u201902","author":"Giannakopoulou D.","unstructured":"D. Giannakopoulou , C. Pasareanu , and H. Barringer . Assumption generation for software component verification . In Proceedings of ASE\u201902 , pages 3\u2013 12 . IEEE Computer Society, 2002. D. Giannakopoulou, C. Pasareanu, and H. Barringer. Assumption generation for software component verification. In Proceedings of ASE\u201902, pages 3\u201312. IEEE Computer Society, 2002."},{"key":"e_1_3_2_1_10_1","first-page":"196","volume-title":"Proc. Int. Conf. on Computer Aided Verification","author":"Graf S.","year":"1990","unstructured":"S. Graf and B. Steffen . Compositional minimization of finite state systems . In Proc. Int. Conf. on Computer Aided Verification , pages 186\u2013 196 , 1990 . S. Graf and B. Steffen. Compositional minimization of finite state systems. In Proc. Int. Conf. on Computer Aided Verification, pages 186\u2013196, 1990."},{"key":"e_1_3_2_1_11_1","first-page":"274","volume-title":"Proc. Int. Conf. on Computer Aided Verification","volume":"2725","author":"Henzinger T.","unstructured":"T. Henzinger , R. Jhala , R. Majumdar , and S. Qadeer . Thread-modular abstraction refinement . In Proc. Int. Conf. on Computer Aided Verification , volume 2725 of LNCS, pages 262\u2013 274 . Springer-Verlag, 2003. T. Henzinger, R. Jhala, R. Majumdar, and S. Qadeer. Thread-modular abstraction refinement. In Proc. Int. Conf. on Computer Aided Verification, volume 2725 of LNCS, pages 262\u2013274. Springer-Verlag, 2003."},{"key":"e_1_3_2_1_12_1","first-page":"451","volume-title":"Proc. Int. Conf. on Computer Aided Verification","author":"Henzinger T.","unstructured":"T. Henzinger , S. Qadeer , and S. Rajamani . You assume, we guarantee: methodology and case studies . In Proc. Int. Conf. on Computer Aided Verification , pages 440\u2013 451 . Springer, 1998. T. Henzinger, S. Qadeer, and S. Rajamani. You assume, we guarantee: methodology and case studies. In Proc. Int. Conf. on Computer Aided Verification, pages 440\u2013451. Springer, 1998."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.588521"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/69575.69577"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/646481.691425"},{"key":"e_1_3_2_1_16_1","first-page":"372","volume-title":"Proceedings of the 17th International Conference on Static Analysis, SAS\u201910","author":"Malkis A.","unstructured":"A. Malkis , A. Podelski , and A. Rybalchenko . Thread-modular counterexample-guided abstraction refinement . In Proceedings of the 17th International Conference on Static Analysis, SAS\u201910 , pages 356\u2013 372 . Springer-Verlag, 2010. A. Malkis, A. Podelski, and A. Rybalchenko. Thread-modular counterexample-guided abstraction refinement. In Proceedings of the 17th International Conference on Static Analysis, SAS\u201910, pages 356\u2013372. Springer-Verlag, 2010."},{"key":"e_1_3_2_1_17_1","volume-title":"Cadence Berkeley Labs","author":"Mcmillan K. L.","year":"1999","unstructured":"K. L. Mcmillan . A methodology for hardware verification using compositional model checking. Technical report , Cadence Berkeley Labs , 1999 . K. L. Mcmillan. A methodology for hardware verification using compositional model checking. Technical report, Cadence Berkeley Labs, 1999."},{"key":"e_1_3_2_1_18_1","first-page":"267","volume-title":"Proc. of SPIN Workshop","volume":"4595","author":"Pel\u00e1nek R.","unstructured":"R. Pel\u00e1nek . Beem : Benchmarks for explicit model checkers . In Proc. of SPIN Workshop , volume 4595 of LNCS, pages 263\u2013 267 . Springer, 2007. R. Pel\u00e1nek. Beem: Benchmarks for explicit model checkers. In Proc. of SPIN Workshop, volume 4595 of LNCS, pages 263\u2013267. Springer, 2007."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2035544"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.816214"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.854638"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2301671"}],"event":{"name":"ISSTA '14: International Symposium on Software Testing and Analysis","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"San Jose CA USA","acronym":"ISSTA '14"},"container-title":["Proceedings of the 2014 International SPIN Symposium on Model Checking of Software"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2632362.2632366","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2632362.2632366","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:14Z","timestamp":1750231154000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2632362.2632366"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,21]]},"references-count":22,"alternative-id":["10.1145\/2632362.2632366","10.1145\/2632362"],"URL":"https:\/\/doi.org\/10.1145\/2632362.2632366","relation":{},"subject":[],"published":{"date-parts":[[2014,7,21]]},"assertion":[{"value":"2014-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}