乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T19:15:06Z","timestamp":1730315706837,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,7,20]]},"DOI":"10.1145\/2003476.2003482","type":"proceedings-article","created":{"date-parts":[[2011,7,20]],"date-time":"2011-07-20T12:34:54Z","timestamp":1311165294000},"page":"17-28","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Graph-transformation verification using monadic second-order logic"],"prefix":"10.1145","author":[{"given":"Kazuhiro","family":"Inaba","sequence":"first","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}]},{"given":"Soichiro","family":"Hidaka","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}]},{"given":"Zhenjiang","family":"Hu","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}]},{"given":"Hiroyuki","family":"Kato","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}]},{"given":"Keisuke","family":"Nakano","sequence":"additional","affiliation":[{"name":"The University of Electro-Communications, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2011,7,20]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1007\/s007990050005"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/1322432.1322433"},{"unstructured":"ATLAS group. KM3 manual. http:\/\/www.eclipse.org\/gmt\/atl\/doc\/. ATLAS group. KM3 manual. http:\/\/www.eclipse.org\/gmt\/atl\/doc\/.","key":"e_1_3_2_1_3_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.5555\/645502.656107"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/233269.233368"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1007\/s007780050084"},{"unstructured":"J. Clark and M. Murata. RELAX NG specification. http:\/\/www.relaxng.org\/ 2001. J. Clark and M. Murata. RELAX NG specification. http:\/\/www.relaxng.org\/ 2001.","key":"e_1_3_2_1_8_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/298514.298591"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1016\/0304-3975(94)90268-2"},{"unstructured":"DTD. DTD: Document Type Definition. http:\/\/www.w3.org\/XML\/1998\/06\/xmlspec-report.htm. DTD. DTD: Document Type Definition. http:\/\/www.w3.org\/XML\/1998\/06\/xmlspec-report.htm.","key":"e_1_3_2_1_11_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.5555\/1783534.1783558"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/1071610.1071614"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.5555\/646479.693761"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/1863543.1863573"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/1529282.1529383"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.5555\/646731.703838"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1007\/11768869_14"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1007\/11965893_18"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1016\/S0022-0000(02)00030-2"},{"key":"e_1_3_2_1_22_1","first-page":"1","article-title":"Decidability of second-order theories and automata on infinite trees","volume":"141","author":"Rabin M. O.","year":"1969","unstructured":"M. O. Rabin . Decidability of second-order theories and automata on infinite trees . Transactions of American Mathematical Society , 141 : 1 -- 35 , 1969 . M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of American Mathematical Society, 141: 1--35, 1969.","journal-title":"Transactions of American Mathematical Society"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","DOI":"10.1142\/3303","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations","author":"Rozenberg G.","year":"1997","unstructured":"G. Rozenberg , editor. Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 . World Scientific . G. Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations, 1997. World Scientific."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1007\/BF01691346"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1016\/j.entcs.2006.05.044"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/502187.502191"},{"key":"e_1_3_2_1_27_1","first-page":"569","article-title":"Impossibility of an algorithm for the decision problem for finite classes","volume":"70","author":"Trakhtenbrot B. A.","year":"1950","unstructured":"B. A. Trakhtenbrot . Impossibility of an algorithm for the decision problem for finite classes . Doklady Akademiia Nauk SSSR , 70 : 569 -- 572 , 1950 . B. A. Trakhtenbrot. Impossibility of an algorithm for the decision problem for finite classes. Doklady Akademiia Nauk SSSR, 70:569--572, 1950.","journal-title":"Doklady Akademiia Nauk SSSR"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.5555\/1947873.1947903"},{"unstructured":"W3C XML Schema WG. W3C XML Schema. http:\/\/www.w3c.org\/XML\/Schema. \\end{thebibliography}. W3C XML Schema WG. W3C XML Schema. http:\/\/www.w3c.org\/XML\/Schema. \\end{thebibliography}.","key":"e_1_3_2_1_29_1"}],"event":{"sponsor":["University of Southern Denmark","Danish Agency for Science Technology and Innovation DASTI","SIGPLAN ACM Special Interest Group on Programming Languages"],"acronym":"PPDP '11","name":"PPDP '11: Symposium on Principles and Practices of Declarative Programming","location":"Odense Denmark"},"container-title":["Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2003476.2003482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T23:06:23Z","timestamp":1673564783000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2003476.2003482"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,20]]},"references-count":27,"alternative-id":["10.1145\/2003476.2003482","10.1145\/2003476"],"URL":"https:\/\/doi.org\/10.1145\/2003476.2003482","relation":{},"subject":[],"published":{"date-parts":[[2011,7,20]]},"assertion":[{"value":"2011-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}