{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:11:59Z","timestamp":1750306319635,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,2,18]],"date-time":"2016-02-18T00:00:00Z","timestamp":1455753600000},"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":[[2016,2,18]]},"DOI":"10.1145\/2856636.2856652","type":"proceedings-article","created":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T20:06:43Z","timestamp":1454357203000},"page":"70-79","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["An efficient path based equivalence checking for Petri net based models of programs"],"prefix":"10.1145","author":[{"given":"Soumyadip","family":"Bandyopadhyay","sequence":"first","affiliation":[{"name":"BITS Pilani, K K Birla Campus, Goa, India"}]},{"given":"Dipankar","family":"Sarkar","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Kharagpur, India"}]},{"given":"Chittaranjan","family":"Mandal","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Kharagpur, Kharagpur, India"}]}],"member":"320","published-online":{"date-parts":[[2016,2,18]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Z3 SMT Slover. http:\/www.z3.codeplex.com\/.  Z3 SMT Slover. http:\/www.z3.codeplex.com\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Par4all. http:\/\/www.par4all.org\/.  Par4all. http:\/\/www.par4all.org\/."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5220\/0005513903190329"},{"key":"e_1_3_2_1_5_1","volume-title":"A path construction algorithm for translation validation using pres+ models. Parallel processing letter (to appear)","author":"Bandyopadhyay S.","year":"2015","unstructured":"S. Bandyopadhyay , D. Sarkar , K. Banerjee , C. Mandal , and K. R. Duddu . A path construction algorithm for translation validation using pres+ models. Parallel processing letter (to appear) , 2015 . S. Bandyopadhyay, D. Sarkar, K. Banerjee, C. Mandal, and K. R. Duddu. A path construction algorithm for translation validation using pres+ models. Parallel processing letter (to appear), 2015."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2819009.2819187"},{"key":"e_1_3_2_1_7_1","volume-title":"Verification of code motion techniques using value propagation","author":"Banerjee K.","year":"2014","unstructured":"K. Banerjee , C. Karfa , D. Sarkar , and C. Mandal . Verification of code motion techniques using value propagation . IEEE TCAD , 33(8), 2014 . K. Banerjee, C. Karfa, D. Sarkar, and C. Mandal. Verification of code motion techniques using value propagation. IEEE TCAD, 33(8), 2014."},{"key":"e_1_3_2_1_8_1","first-page":"08","article-title":"Pluto: A practical and fully automatic polyhedral program optimization system","author":"Bondhugula U.","year":"2008","unstructured":"U. Bondhugula , A. Hartono , J. Ramanujam , and P. Sadayappan . Pluto: A practical and fully automatic polyhedral program optimization system . In PLDI 08 , 2008 . U. Bondhugula, A. Hartono, J. Ramanujam, and P. Sadayappan. Pluto: A practical and fully automatic polyhedral program optimization system. In PLDI 08, 2008.","journal-title":"PLDI"},{"key":"e_1_3_2_1_9_1","volume-title":"Relations between several parallel computational models. Scalable Computing: Practice and Experience, 10(2)","author":"Bruda S. D.","year":"2009","unstructured":"S. D. Bruda and Y. Zhang . Relations between several parallel computational models. Scalable Computing: Practice and Experience, 10(2) , 2009 . S. D. Bruda and Y. Zhang. Relations between several parallel computational models. Scalable Computing: Practice and Experience, 10(2), 2009."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1383-7621(03)00096-1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/309847.309935"},{"key":"e_1_3_2_1_12_1","first-page":"296","volume-title":"DAC '99","author":"Edwards S.","year":"1999","unstructured":"S. Edwards , L. Lavagno , E. A. Lee , and A. Sangiovanni-Vincentellni . Design of embedded systems: Formal models, validation and synthesis . DAC '99 , pages 296 -- 299 , 1999 . S. Edwards, L. Lavagno, E. A. Lee, and A. Sangiovanni-Vincentellni. Design of embedded systems: Formal models, validation and synthesis. DAC '99, pages 296--299, 1999."},{"key":"e_1_3_2_1_13_1","first-page":"19","volume-title":"Proceedings the 19th Symposium on Applied Mathematics","author":"Floyd R. W.","year":"1967","unstructured":"R. W. Floyd . Assigning meaning to programs. In J. T. Schwartz, editor , Proceedings the 19th Symposium on Applied Mathematics , pages 19 -- 32 , Providence, R.I. , 1967 . American Mathematical Society. Mathematical Aspects of Computer Science. R. W. Floyd. Assigning meaning to programs. In J. T. Schwartz, editor, Proceedings the 19th Symposium on Applied Mathematics, pages 19--32, Providence, R.I., 1967. American Mathematical Society. Mathematical Aspects of Computer Science."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/646727.703202"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/832285.835535"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.822105"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.3166\/tsi.31.987-1019"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.974893"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142155.1142163"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2209291.2209303"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2042903"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_44"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1950815.1950917"},{"key":"e_1_3_2_1_24_1","first-page":"1401","volume-title":"Encyclopedia of Parallel Computing","author":"Lengauer C.","year":"2011","unstructured":"C. Lengauer . Owicki-gries method of axiomatic verification . In Encyclopedia of Parallel Computing , pages 1401 -- 1406 . 2011 . C. Lengauer. Owicki-gries method of axiomatic verification. In Encyclopedia of Parallel Computing, pages 1401--1406. 2011."},{"key":"e_1_3_2_1_25_1","volume-title":"Mathematical Theory of Computation","author":"Manna Z.","year":"1974","unstructured":"Z. Manna . Mathematical Theory of Computation . McGraw-Hill Kogakusha , Tokyo , 1974 . Z. Manna. Mathematical Theory of Computation. McGraw-Hill Kogakusha, Tokyo, 1974."},{"key":"e_1_3_2_1_26_1","volume-title":"Communication and Concurrency","author":"Milner R.","year":"1989","unstructured":"R. Milner . Communication and Concurrency . Prentice-Hall, Inc. , 1989 . R. Milner. Communication and Concurrency. Prentice-Hall, Inc., 1989."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349314"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/646482.691453"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/646252.686146"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676995"}],"event":{"name":"ISEC '16: 9th India Software Engineering Conference","sponsor":["iSOFT iSOFT","ACM India ACM India"],"location":"Goa India","acronym":"ISEC '16"},"container-title":["Proceedings of the 9th India Software Engineering Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2856636.2856652","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2856636.2856652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:13Z","timestamp":1750222453000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2856636.2856652"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,18]]},"references-count":29,"alternative-id":["10.1145\/2856636.2856652","10.1145\/2856636"],"URL":"https:\/\/doi.org\/10.1145\/2856636.2856652","relation":{},"subject":[],"published":{"date-parts":[[2016,2,18]]},"assertion":[{"value":"2016-02-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}