{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:13Z","timestamp":1750307593673,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,3,22]],"date-time":"2010-03-22T00:00:00Z","timestamp":1269216000000},"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":[[2010,3,22]]},"DOI":"10.1145\/1774088.1774561","type":"proceedings-article","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T12:45:48Z","timestamp":1272372348000},"page":"2265-2272","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Graph-based verification of static program constraints"],"prefix":"10.1145","author":[{"given":"Selim","family":"Ciraci","sequence":"first","affiliation":[{"name":"University of Twente, Enschede, AE, The Netherlands"}]},{"given":"Pim","family":"van den Broek","sequence":"additional","affiliation":[{"name":"University of Twente, Enschede, AE, The Netherlands"}]},{"given":"Mehmet","family":"Aksit","sequence":"additional","affiliation":[{"name":"University of Twente, Enschede, AE, The Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2010,3,22]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Gnu prolog. http:\/\/www.gprolog.org\/.  Gnu prolog. http:\/\/www.gprolog.org\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167515.1167479"},{"key":"e_1_3_2_1_3_1","volume-title":"OOPSLA workshop on revival of dynamic languages","author":"Bracha G.","year":"2004","unstructured":"G. Bracha . Pluggable type systems . OOPSLA workshop on revival of dynamic languages , 2004 . G. Bracha. Pluggable type systems. OOPSLA workshop on revival of dynamic languages, 2004."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2008.46"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167473.1167481"},{"key":"e_1_3_2_1_6_1","volume-title":"USA","author":"Covington M. A.","year":"1987","unstructured":"M. A. Covington , D. Nute , and A. Vellino . Prolog programming in depth. Scott, Foresman & Co., Glenview, IL , USA , 1987 . M. A. Covington, D. Nute, and A. Vellino. Prolog programming in depth. Scott, Foresman & Co., Glenview, IL, USA, 1987."},{"key":"e_1_3_2_1_7_1","first-page":"18","volume-title":"DSL'97","author":"Crew R. F.","year":"1997","unstructured":"R. F. Crew . Astlog : a language for examining abstract syntax trees . In DSL'97 , pages 18 -- 18 , Berkeley, CA, USA , 1997 . USENIX Association. R. F. Crew. Astlog: a language for examining abstract syntax trees. In DSL'97, pages 18--18, Berkeley, CA, USA, 1997. USENIX Association."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368142"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02674-4_2"},{"key":"e_1_3_2_1_10_1","volume-title":"Graph grammars with negative application conditions. Fundam. Inf., 26(3--4):287--313","author":"Habel A.","year":"1996","unstructured":"A. Habel , R. Heckel , and G. Taentzer . Graph grammars with negative application conditions. Fundam. Inf., 26(3--4):287--313 , 1996 . A. Habel, R. Heckel, and G. Taentzer. Graph grammars with negative application conditions. Fundam. Inf., 26(3--4):287--313, 1996."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11785477_2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1173706.1173744"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028664.1028670"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11880240_15"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/581339.581382"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/978-3-540-25959-6_40","volume-title":"Applications of Graph Trans. with Industrial Relevance","author":"Rensink A.","year":"2004","unstructured":"A. Rensink . The groove simulator : A tool for state space generation . In Applications of Graph Trans. with Industrial Relevance , pages 479 -- 485 . Springer-Verlag , 2004 . A. Rensink. The groove simulator: A tool for state space generation. In Applications of Graph Trans. with Industrial Relevance, pages 479--485. Springer-Verlag, 2004."}],"event":{"name":"SAC'10: The 2010 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Sierre Switzerland","acronym":"SAC'10"},"container-title":["Proceedings of the 2010 ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1774088.1774561","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1774088.1774561","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:41:34Z","timestamp":1750250494000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1774088.1774561"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,22]]},"references-count":16,"alternative-id":["10.1145\/1774088.1774561","10.1145\/1774088"],"URL":"https:\/\/doi.org\/10.1145\/1774088.1774561","relation":{},"subject":[],"published":{"date-parts":[[2010,3,22]]},"assertion":[{"value":"2010-03-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}